Skip to main content

Advertisement

SpringerLink
Log in

A two-stage genetic algorithm for multi-objective job shop scheduling problems

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

This paper presents a two-stage genetic algorithm (2S-GA) for multi-objective Job Shop scheduling problems. The 2S-GA is proposed with three criteria: Minimize makespan, Minimize total weighted earliness, and Minimize total weighted tardiness. The proposed algorithm is composed of two Stages: Stage 1 applies parallel GA to find the best solution of each individual objective function with migration among populations. In Stage 2 the populations are combined. The evolution process of Stage 2 is based on Steady-State GA using the weighted aggregating objective function. The algorithm developed can be used with one or two objectives without modification. The genetic algorithm is designed and implemented with the GALIB object library. The random keys representation is applied to the problem. The schedules are constructed using a permutation with m-repetitions of job numbers. Performance of the proposed algorithm is tested on published benchmark instances and compared with results from other published approaches for both the single objective and multi-objective cases. The experimental results show that 2S-GA is effective and efficient to solve job shop scheduling problem in term of solution quality.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adams J., Balas E., Zawack D. (1988) The shifting bottleneck procedure for job shop scheduling. Management Science 34: 391–401

    Article  Google Scholar 

  • Asano M., Ohta H. (2002) A heuristic for job shop scheduling to minimize total weighted tardiness. Computers & Industrial Engineering 42: 137–147

    Article  Google Scholar 

  • Bean J. C. (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 6(2): 154–160

    Google Scholar 

  • Beasley J. E. (1996) Obtaining test problems via internet. Journal of Global Optimization 8(4): 429–433

    Article  Google Scholar 

  • Beasley, J. E. (2005). OR-library. Available online at: http://people.brunel.ac.uk/~mastjjb/jeb/info.html. Accessed 16 September 2005.

  • Bierwirth, C. (1995). A generalized permutation approach to job shop scheduling with genetic algorithms. In E. Pesch, & S. Vo (Eds.), OR-spektrum, special issue: Applied local search, vol 17(213) (pp. 87–92).

  • Eilon S., Chowdhury I. G. (1976) Due date in job shop scheduling. International Journal of Production Research 14(2): 233

    Article  Google Scholar 

  • Elaoud S., Loukil T., Teghem J. (2007) The Pareto fitness genetic algorithm: Test function study. European Journal of Operational Research 177(3): 1703–1719

    Article  Google Scholar 

  • Fisher H., Thompson G. L. (1963) Probabilistic learning combinations of local job shop scheduling rules. In: Muth J. F., Thompson G. L. (eds) Industrial scheduling. Prentice-Hall, Englewood Cliffs, NJ, pp 225–251

    Google Scholar 

  • Gary M. R., Johnson D. S., Sethi R. R. (1976) The complexity of flow-shop and job shop scheduling. Mathematics and Operations. Research 1: 117–129

    Article  Google Scholar 

  • Gonçalves J. F., José J., Resende M. G. C. (2005) A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operation Research 167: 77–95

    Article  Google Scholar 

  • Kacem I., Hammadi S., Borne P. (2002) Pareto-optimality approach for flexible job shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation 60: 245–276

    Article  Google Scholar 

  • Lam, N. V., & Kachitvichyanukul, V., & Luong, H. T. (2005). An multistage parallel genetic algorithm for multi-objective job shop scheduling. In Proceedings of the APIEMS 2005 conference, Manila, Philippines, December 2005

  • Lawrence, S. (1984). Supplement to, resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques. In Technical report, GSIA, Carnegie Mellon University.

  • Matsuo, H., Suh, C. J., & Sullivan, R. S. (1988). A controlled search simulated annealing method for the general job-shop scheduling problem. In Working paper #03-04-88, Graduate School of Business, The University of Texas at Austin, Austin, Texas, USA.

  • Nagar A., Haddock J., Heragu S. (1995) Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research 81: 88–104

    Article  Google Scholar 

  • Nowicki E., Smutnicki C. (1996) A fast tabu search algorithm for the job shop problem. Management Science 42(6): 797–813

    Article  Google Scholar 

  • Pinedo M., Singer M. (1999) A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics 46(1): 1–17

    Article  Google Scholar 

  • Rookapibal, L., & Kachitvichyanukul, V. (2006). Particle swarm optimization for job shop scheduling. In Proceedings of the international computers and industrial engineering conference, Taipei, Taiwan, June 2006.

  • Singer M., Pinedo M. (1998) A computational study of branch and bound techniques, for minimizing the total weighted tardiness in job shops. IIE Transactions 30(2): 109–118

    Google Scholar 

  • Udomsakdigool A., Kachitvichyanukul V. (2006) Two-way scheduling approach in ant algorithm for solving job shop problems. International Journal of Industrial Engineering and Management Systems 5(2): 68–75

    Google Scholar 

  • Udomsakdigool A., Kachitvichyanukul V. (2008) Multiple colony ant algorithm for job-shop scheduling problem. International Journal of Production Research 46(15): 4155–4175

    Article  Google Scholar 

  • Van Laarhoven P. J. M., Aarts E. H. L., Lenstra J. K. (1992) Job shop scheduling by simulated annealing. Operations Research 40(1): 113–125

    Article  Google Scholar 

  • Wall, M. (1996). GALib: A C++ library of genetic algorithm components. http://lancet.mit.edu/ga. Accessed 21 December 2004.

  • Xia W., Wu Z. (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering 48: 409–425

    Article  Google Scholar 

  • Yamada, T., & Nakano, R. (1995). A genetic algorithm with multi-step crossover for job-shop scheduling problems. In Proceedings of the IEE/IEEE international conference on genetic algorithms in engineering systems: Innovations and applications (pp. 146–151).

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering and Management, School of Engineering and Technology, Asian Institute of Technology, P.O. Box 4, Klong Luang, Pathumthani, 12120, Thailand

    Voratas Kachitvichyanukul & Siriwan Sitthitham

Authors
  1. Voratas Kachitvichyanukul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Siriwan Sitthitham
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Voratas Kachitvichyanukul.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kachitvichyanukul, V., Sitthitham, S. A two-stage genetic algorithm for multi-objective job shop scheduling problems. J Intell Manuf 22, 355–365 (2011). https://doi.org/10.1007/s10845-009-0294-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-009-0294-6

Keywords

Search

Navigation