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
Garey, M., Johnson, D., Sethi, R.: The Complexity Of Flow Shop And Job Shop Scheduling. Maths Ops Res., Vol. 1 (1976) 117-129
Bagchi, T.P.: Multiobjective Scheduling by Genetic Algorithms, Kluwer Academic Publishers, Boston/Dordrecht/London (1999)
Garen, J.: A Genetic Algorithm for Tackling Multiobjective Job-Shop Scheduling Problems. In: Gandibleux X., Sevaux, M., Sörensen, K., T’kindt, V. (eds): Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, Vol. 535 (2004) 201- 219
Bagchi, T.P.: Pareto-optimal Solutions for Multi-objective Production Scheduling Problems. In: Int. Conf. on Evolutionary Multi-Criteria Optimization, LNCS 1993 (2001) 458-471
Chan, T.M., Man, K.F., Tang, K.S., Kwong, S.: A Jumping Gene Algorithm for Multiobjective Resource Management in Wideband CDMA Systems. Computer Journal, Vol. 48, No. 6. (2005) 749-768
Man, K.F., Chan T.M., Tang, K.S., Kwong, S.: Jumping Genes in Evolutionary Computing. In: Thirtieth Annual Conf. of the IEEE Industrial Electronics Society, Busan, Korean (2004) 1268-1272
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. Evolutionary Computation, Vol. 6, No. 2. (2002) 182-197
Landa Silva, J.D., Burke, E.K., Petrovic S.: An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling. In: Gandibleux X., Sevaux, M., Sörensen, K., T’kindt, V. (eds): Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, , Vol. 535 (2004) Springer, Berlin91-129
Muth, J.F., Thompson, G.L.: Industrial Scheduling. Prentice-Hall, Englewood Cliffs, N.J. (1963)
Bucker, P., Jurish B., Sievers, B.: A Branch and Bound Algorithm for the Job- shop Scheduling Problem. Discrete Applied Mathematics, Vol. 49. (1994) 105-127
Martin, P.D.: A Time-Oriented Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. Ph.D. Thesis, School of Operations Research and Industrial Engineering, Cornell University, NY, USA. (1996)
Chen, H., Chu, C., Proth, J.M.: A More Efficient Lagrangian Relaxation Approach to Job-shop Scheduling Problems, In: IEEE Int. Conf. on Robotics and Automation. (1995) 496-501
Steinhöfel, K., Albrecht, A., Wong, C.K.: Fast Parallel Heuristics for the Job Shop Scheduling Problem. Computers & Operations Research, Vol. 29. (2002) 151-169
Nowicki E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Scheduling Problem. Management Science. Vol. 42. (1996) 797-813
Yamada T., Nakano, R.: A Genetic Algorithm Applicable to Large-scale Job Shop Problems. In: Second Int. Conf. on Parallel Problem Solving from Nature (PPSN-II), North-Holland, Amsterdam. (1992) 281-290
Pérez, E., Herrera F., Hernández, C.: Finding Multiple Solutions in Job Shop Scheduling by Niching Genetic Algorithm. J. Intelligent Manufacturing. Vol. 14. (2003) 323-339
Wang L., Zheng, D.Z.: An Effective Hybrid Optimization Strategy for Job- shop Scheduling Problems. Computers & Operations Research. Vol. 28. (2001) 585-596
Blum, C., Sampels, M.: An Ant Colony Optimization Algorithm for Shop Scheduling Problems. J. Mathematical Modelling and Algorithms, Vol. 3. (2004) 285-308
Ge., H.W., Liang, Y.C., Zhou, Y., Guo, X.C.: A Particle Swarm Optimization-based Algorithm for Job-shop Scheduling Problems. Int. J. Computational Methods, Vol. 2, No. 3. (2005) 419-430
Vaessens, R.J.M., Aarts E.H.L., Lenstra, J.K.: Job Shop Scheduling by Local Search. INFORMS J. Computing, Vol. 8. (1996) 302-317
Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science, Vol. 34. (1988) 391-401
Balas, E., Vazacopoulos, A.: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling. Management Science, Vol. 44. (1998) 262-275
Brinkkötter W., Brucker, P.: Solving Open Benchmark Problems for the Job Shop Problem. J. Scheduling, Vol. 4. (2001) 53-64
Aiex, R.M., Binato S., Resende, M.G.C.: Parallel GRASP with Path-relinking for Job Shop Scheduling. Parallel Computing, Vol. 29. (2003) 393-430
Blazewicz, J., Domschke, W., Pesch, E.: The Job Shop Scheduling Problem: Conventional and New Solution Techniques, European J. Operations Research, Vol. 93. (1996) 1-33
Jain, A., Meeran, S.: Deterministic Job-shop Scheduling: Past, Present and Future. European J. Operations Research, Vol. 113. (1999) 390-434
Cheng, R., Gen, M., Tsujimura, Y.: A Tutorial Survey of Job-shop Scheduling Problems using Genetic Algorithms - I: Representation. Computers and Industrial Engineering, Vol. 30, No. 4. (1996) 983-997
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. (1975)
Davis, L.: Job-shop Scheduling with Genetic Algorithm. In: First Int. Conf. on Genetic Algorithms and Their Applications, Pittsburgh, PA, USA, Lawrence Erlbaum. (1985) 136-140
Nakano, R., Yamada, T.: Conventional Genetic Algorithm for Job-shop Problem. In: Fourth Int. Conf. on Genetic Algorithms, San Diego, CA, Morgan Kaufmann, San Mateo, CA. (1991) 474-479
Hart, E., Ross P., Corne, D.: Evolutionary Scheduling: A Review. Genetic Programming and Evolvable Machines, Vol. 6. (2005) 191-220
Hapke, M., Jaszkiewicz, A., Kurowski, K.: Multi-objective Genetic Local Search Methods for the Flowshop Problem. In: Advances in Nature-Inspired Computation: The PPSN IV Workshops, PEDAL, University of Reading, UK. (2002) 22-23
Deb, K.: Multi-objective Optimization using Evolutionary Algorithms. John Wiley & Sons. (2001)
Allahverdi, A.: The Two- and M-machine Flowshop Scheduling Problem with Bicriteria of Makespan and Mean Flowtime. European J. of Operational Research, Vol. 147. (2003) 373-396
Hapke, M., Jaszkiewicz A., SáowiĔski, R.: Interactive Analysis of Multiple- criteria Project Scheduling Problems. European J. of Operational Research, Vol. 107. (1998) 315-324
Fonseca, C.M., Fleming, P.J.: Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization. In: Forrest, S. (ed): Fifth Int. Conf. on Genetic Algorithms, San Mateo, California, UIUC, Morgan Kaufmann Publishers. (1993) 416-423
T’kindt V., Billaut, J.C.: Multicriteria Scheduling: Theory, Models and Algorithms. Springer. (2006)
Murata, T., Ishibuchi, H., Tanaka, H.: Multi-objective GA and Its Applications to Flowshop Scheduling. Computers and Industrial Engineering, Vol. 30, No. 4. (1996) 957-968
39. Jain, A., Meeran, S.: A State-of-the-art Review of Job-shop Scheduling Techniques. Technical Report, University of Dundee. (1998)
Yamada, T., Nakano, R.: Scheduling by Genetic Local Search with Multi-step Crossover. In: Voigt, H.-M., Ebeling, W., Rechenberg I., Schwefel, H.-P. (eds): Parallel Problem Solving from Nature - PPSN IV, LNCS 1141, Springer. (1996) 960-969
Caporale, L.H.: Jumping Genes. In: Darwin in the Genome: Molecular Strategies in Biological Evolution. McGraw-Hill, New York. (2003) 145-153
Bierwirth, C.: A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms, OR Spektrum. (1995) 87-92
Yamada, T.: Studies on Meta Heuristics for Jobshop and Flowshop Scheduling Problems. PhD. Thesis, Kyoto University, Japan. (2003)
Giffler, B., Thompson, G.: Algorithms for Solving Production Scheduling Problems. Operations Research, Vol 8, No 4. (1960) 487-503
Varela, R., Serrano, D., Sierra, M.: New Codification Schemas for Scheduling with Genetic Algorithms. In: Mira J., Álvarez, J.R. (eds): IWINAC 2005, LNCS 3562 (ISBN: 3-540-26319-5), Springer-Verlag. (2005) 11-20
Gen, M., Tsujimura, Y., Kubota, E.: Solving Job-Shop Scheduling Problem Using Genetic Algorithms, In: Sixteenth Int. Conf. on Computers and Industrial Engineering. (1994) 576-579
Poon P., Carter, N.: Genetic Algorithm Crossover Operators for Ordering Applications. Computers and Operations Research, Vol. 22. (1995) 135-147
Bierwirth, C., Matfield, D.C., Kopfer, H.: On Permutation Representation for Scheduling Problems. In: Parallel Problem Solving from Nature, Vol. 4. (1996) 310-318
Spirov, A.V., Kazansky, A.B.: Jumping Genes-Mutators Can Rise Efficacy of Evolutionary Search. In: Genetic and Evolutionary Computation Conference, New York, USA. (2002) 561 568
Applegate, D., Cook, W.: A Computational Study of the Job-shop Scheduling Problem. ORSA J. Computing, Vol. 3, No. 2. (1991) 149-156
Lawrence, S.: Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement). Technical report, Graduate School of Industrial Administration, Carnegie Mellon University. (1984)
OR Library. URL: http://mscmga.ms.ic.ac.uk
Ombuki, B., Ventresca, M.: Local Search Genetic Algorithms for Job Shop Scheduling Problem. Technical Report No. CS-02-22, Brock University, Canada. (2002)
Aarts, E.H.L., Van Laarhoven, P.J.M., Lenstra, J.K., Ulder, N.L.J.: A Computational Study of Local Search Algorithms for Job Shop Scheduling. ORSA J. Computing, Vol. 6, No. 2. (1994) 118-125
Mattfeld, D.C., Kopfer, H., Bierwirth, C.: Control of Parallel Population Dynamics by Social-like Behavior of GA-individuals. In: Parallel Problem Solving from Nature, Vol. 866 (1994) 16-25
Schott, J.R.: Fault Tolerant Design Using Single and Multi-Criteria Genetic Algorithms. Master’s Thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Boston, MA. (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ripon, K.S.N., Tsang, CH., Kwong, S. (2007). An Evolutionary Approach for Solving the Multi-Objective Job-Shop Scheduling Problem. In: Dahal, K.P., Tan, K.C., Cowling, P.I. (eds) Evolutionary Scheduling. Studies in Computational Intelligence, vol 49. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48584-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-48584-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48582-7
Online ISBN: 978-3-540-48584-1
eBook Packages: EngineeringEngineering (R0)