Abstract
The job shop scheduling problem that is concerned with minimizing makespan is discussed. A new heuristic algorithm that embeds an improved shifting bottleneck procedure into the Tabu Search (TS) technique is presented. This algorithm is different from the previous procedures, because the improved shifting bottleneck procedure is a new procedure for the problem, and the two remarkable strategies of intensification and diversification of TS are modified. In addition, a new kind of neighborhood structure is defined and the method for local search is different from the previous.
This algorithm has been tested on many common problem benchmarks with various sizes and levels of hardness and compared with several other algorithms. Computational experiments show that this algorithm is one of the most effective and efficient algorithms for the problem. Especially, it obtains a lower upbound for an instance with size of 50 jobs and 20 machines within a short period.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aarts, E., Lenstra, J.K.: Local Search and Combinational Optimization. Wiley, New York (1997)
Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Sci. 3, 391–401 (1988)
Applegate, D., Cook, W.: A Computational Study of Job-shop Scheduling. ORSA J. Computing 2, 149–156 (1991)
Balas, E.: Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Algorithm. Oper. Res. 17, 941–957 (1969)
Balas, E., Vazacopoulos, A.: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling. Management Sci. 2, 262–275 (1998)
Dell’Amico, M., Trubian, M.: Applying Tabu-search to the Job-shop Scheduling Problem. Ann. Oper. Res. 4, 231–252 (1993)
Dongarra, J.J.: Performance of Various Computers Using Standard Liner Equations Software. Report CS-89-85, Computer Science Department, University of Tennessee, Knox-ville TN (1993)
French, S.: Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop, pp. 31–157. Wiley, New York (1982)
Huang, W.q., Yin, A.H.: An Improved Shifting Bottleneck Procedure for the Job Shop Scheduling Problem. Computers and Operations Research 12, 2093–2110 (2004)
Glover, F.: Tabu Search—Part I. ORSA J. Computing 3, 190–206 (1989)
Glover, F.: Tabu Search—Part II. ORSA J. Computing 1, 4–32 (1990)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Grabowski, J., Nowicki, E., Zdrzalaka, S.: A Block Approach for Single Machine Scheduling with Release Dates and Due Dates. European J. of Oper. Res. 1, 278–285 (1986)
Hertz, A., Taillard, E., De Werra, D.: Local Search in Combinatorial Optimization. In: Aarts, E., Lenstra, J. (eds.) Tabu Search, vol. 5, pp. 121–136. Wiley, New York (1977)
Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job Shop Scheduling by Simulated Annealing. Oper. Res. 2, 113–125 (1992)
Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Scheduling Problem. Management Sci. 6, 797–813 (1996)
Pezzella, F., Merelli, E.: A Tabu Search Method Guided by Shifting Bottleneck for the Job Shop Scheduling Problem. European J. of Oper. Res. 2, 297–310 (2000)
Taillard, E.: Benchmarks for Basic Scheduling Problems. European J. Operational Res. 4, 278–285 (1993)
Vaessens, R.J.M., Aarts, E.H.L., Lenstra, J.K.: Job Shop Sheduling by Local Sarch. Memorandum COSOR 94-05. Eindhoven University of Technology, Department of Mathematics and Computing Science. Eindhoven The Netherlands (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Yin, AH. (2004). A Heuristic Algorithm for the Job Shop Scheduling Problem. In: Jin, H., Gao, G.R., Xu, Z., Chen, H. (eds) Network and Parallel Computing. NPC 2004. Lecture Notes in Computer Science, vol 3222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30141-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-30141-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23388-6
Online ISBN: 978-3-540-30141-7
eBook Packages: Springer Book Archive