Reactive Tabu Search for Job-shop scheduling problems considering peak shift of electric power energy consumption
Authors:
- 1 November 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3406-3409
Abstract
The Job-shop scheduling problem (JSP) can be formulated as a combinatorial optimization problem. Up to now, the problem has been solved by various evolutionary computation techniques such as Genetic Algorithm (GA) and Tabu Search (TS). Recently, practical methods for the JSP considering various practical constraints have been developed. However, methods for the JSP considering peak shift of electric power energy consumption have not been developed yet. This paper presents an application of Reactive Tabu Search for the JSP considering the peak shift of electric power energy consumption.Keywords
This publication has 10 references indexed in Scilit:
- A Multi - Population Based Frog - Memetic Algorithm for Job Shop Scheduling ProblemAdvanced Computing: An International Journal, 2012
- Ant colony optimization combined with taboo search for the job shop scheduling problemComputers & Operations Research, 2008
- A Bee Colony Optimization Algorithm to Job Shop Scheduling2006
- A new approach to job shop scheduling problems with due date constraints considering operation subcontractsInternational Journal of Production Economics, 2005
- Use of an Artificial Immune System for Job Shop Scheduling2003
- Tabu Search1997
- The Reactive Tabu SearchINFORMS Journal on Computing, 1994
- Critical Block Simulated Annealing for Job Shop SchedulingIEEJ Transactions on Electronics, Information and Systems, 1994
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988