Abstract
This paper describes a methodology of automatic genetic algorithm parameters adjustment dedicated to a job-shop problem with a no-wait constraint with a makespan criterion. The numerical results show that in a given problem, the efficiency of an algorithm with auto-tuning is placed at the level of an algorithm steered in a classical way with the best-fit steering parameters.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bożejko W, Makuchowski M (2009) A fast hybrid tabu search algorithm for the no-wait job shop problem. Comput Ind Eng 56:1502–1509
Framinan J, Schuster C (2006) An enhanced timetabling procedure for the nowait job shop problem: a complete local search approach. Comput Oper Res 33(5):1200–1213
Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading
Graham RL, Lawler EL, Lenstra JK, Rinnooy KanA HG (1979) Optimization and approximation in deterministic sequencing and scheduling: survey. Ann Discrete Math 5:287–326
Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125:535–550
Hall GN, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44:510–524
Holland JH (1992) Genetic algorithms. Sci Am 267:44–50
Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Technical report. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania
Raaymakers W, Hoogeveen J (2000) Scheduling multipurpouse batch process industries with no-wait restrictions by simulated annealing. Eur J Oper Res 126:131–151
Reddi S, Ramamoorth C (1973) A scheduling problem. Oper Res Q 24:441–446
Schuster C (2006) No-wait job shop scheduling: tabu search and complexity of subproblems. Math Methods Oper Res 63(3):473–491
Schuster CJ, Framinan JM (2003) Approximative procedures for no-wait job-shop scheduling. Oper Res Lett 31:308–318
Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41:1069–1072 (1990). http://people.brunel.ac.uk/∼mastjjb/jeb/info.html
Ovacik I, Uzsoy R (2003) Decompisition methods for complex factory scheduling problems. Oper Res Lett 31:308–318
Weinberger ED (1990) Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol Cybern 63:325–336
Wismer DA (1972) Solution of the flowshop scheduling-problem with no intermediate queues. Oper Res 20:689–697
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Bożejko, W., Makuchowski, M. Solving the no-wait job-shop problem by using genetic algorithm with automatic adjustment. Int J Adv Manuf Technol 57, 735–752 (2011). https://doi.org/10.1007/s00170-011-3297-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-011-3297-3