Abstract
This paper introduces a Genetic Algorithm (GA) based solution technique for press machines scheduling problem of a car manufacturing factory. Firstly, the problem at hand, and the application of the GA in terms of coding, chromosome evaluation, crossover and mutation operators, are described in detail. After that, the GA is experimentally evaluated through some test problems. As the objective of the problem is the minimization of the completion time of the jobs, the GA based solution is compared with the Longest Processing Time (LPT) rule, and it is observed that the GA always produces better schedules than the LPT rule in a reasonably short amount of CPU time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer, Berlin (1996)
Blazewicz, J., Cellary, W., Slowinski, R., Weglarz, J.: Scheduling Under Resource Constraints: Deterministic Models. Annals of Operations Research 7, 11–93 (1986)
Cheng, R., Gen, M.: Parallel Machine Scheduling Problems Using Memetic Algorithms. Comp. Ind. Eng. 33, 761–764 (1997)
Cochran, J.K., Horng, S.M., Fowler, J.W.: A Multi-Population Genetic Algorithm to Solve Multi-Objective Scheduling Problems for Parallel Machines. Computers & Operations Research 30, 1087–1102 (2003)
Emel, E., Tasci, H.B.E.: An Optimization Approach for Scheduling of Jobs on Lines of Press Machines. In: The 6th Industrial Eng. Research Conference, Florida (1997)
Garey, M.R., Graham, R.L., Johnson, D.S.: Performance Guarantees for Scheduling Algorithms. Operations Research 26, 3–21 (1978)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1989)
Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975); MIT Press, Cambridge (1992)
Lenstra, J.K.: Sequencing by Enumerative Methods. Mathematical Centre Tracts 69, 18–39 (1985)
Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of Scheduling Under Precedence Constraints. Operations Research 26, 22–35 (1978)
Michalewicz, Z.: Genetic Algorithm+Data Structure=Evolution Programs, 3rd edn. Springer, New York (1996)
Min, L., Cheng, W.: A Genetic Algorithm for Minimizing the Makespan in the Case of Scheduling Identical Parallel Machines. Artif. Intel. Eng. 13, 399–403 (1999)
Ozalp, S.A.: Modeling and Scheduling of Jobs on Lines of Press Machines: A Heuristic Approach. In: 5th EUROSIM Congress on Modeling and Simulation, ESIEE, Paris (2004)
Ozel, S.A.: Programming of Production Scheduling Algorithms. MSc Thesis, Uludag University, Industrial Engineering Department, Bursa (1999)
Peng, J., Liu, B.: Parallel Machine Scheduling Models with Fuzzy Processing Times. Information Sciences 166, 49–66 (2004)
Pinedo, M.: Scheduling: Theory, Algorithms and Systems. Prentice Hall, New Jersey (1995)
Rinnooy Kan, A.H.G.: Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff, The Hague (1976)
Sethi, R.: On the Complexity of Mean Flow Time Scheduling. Mathematics of Operations Research 2, 320–330 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ozalp, S.A. (2006). A Genetic Algorithm for Scheduling of Jobs on Lines of Press Machines. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2005. Lecture Notes in Computer Science, vol 3743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11666806_61
Download citation
DOI: https://doi.org/10.1007/11666806_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31994-8
Online ISBN: 978-3-540-31995-5
eBook Packages: Computer ScienceComputer Science (R0)