Skip to main content
SpringerLink
Log in

Job shop scheduling problem with alternative machines using genetic algorithms

  • Published:
Journal of Central South University Aims and scope Submit manuscript

Abstract

The classical job shop scheduling problem (JSP) is the most popular machine scheduling model in practice and is known as NP-hard. The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed. However, JSP with alternative machines for various operations is an extension of the classical JSP, which allows an operation to be processed by any machine from a given set of machines. Since this problem requires an additional decision of machine allocation during scheduling, it is much more complex than JSP. We present a domain independent genetic algorithm (GA) approach for the job shop scheduling problem with alternative machines. The GA is implemented in a spreadsheet environment. The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures. The result shows that the proposed GA is competitive with the existing approaches. A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.

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

  1. NASR N, ELSAYED E A. Job shop scheduling with alternative machines [J]. International Journal of Production Research, 1990, 28(9): 1595–1609.

    Article  MATH  Google Scholar 

  2. NSAR N. Scheduling of production systems with flexible routings [C]// Proceedings of the Second Industrial Engineering Research Conference. Los Angeles, CA, USA, 1992: 487–492.

  3. WILHELM W, SHIN H. Effectiveness of alternative operations in a flexible manufacturing system [J]. International Journal of Production Research, 1985, 23(1): 65–79.

    Article  Google Scholar 

  4. HANKINS S L, WYSK R A, FOX K R. Using a CATS database for alternative machine loading [J]. Journal of Manufacturing Systems, 1984, 3: 115–120.

    Article  Google Scholar 

  5. AHN J, HE W, KUSIAK A. Scheduling with alternative operations [J]. IEEE Transactions on Robotics & Automation, 1993, 9(3): 297–303.

    Article  Google Scholar 

  6. KIM K H, EGBELU P J. Scheduling in a production environment with multiple process plans per job [J]. International Journal of Production Research, 1999, 37(12): 2725–2753.

    Article  MATH  Google Scholar 

  7. RAJAMANI D, SINGH N, ANEJA Y P. Integrated design of cellular manufacturing systems in the presence of alternative process plans [J]. International Journal of Production Research, 1990, 28(8): 1541–1554.

    Article  MATH  Google Scholar 

  8. JIANG J, HSIAO W. Mathematical programming for the scheduling problem with alternative process plans in FMS [J]. Computer & Industrial Engineering, 1994, 27(1–4): 15–18.

    Article  Google Scholar 

  9. KIM K H, EGBELU P J. A mathematical model for job shop scheduling with multiple process plan consideration per job [J]. Production Planning & Control, 1998, 9: 250–259.

    Article  Google Scholar 

  10. CHOI I C, CHOI D S. A local search algorithm for job shop scheduling problems with alternative operations and sequence-dependent setups [J]. Computers & Industrial Engineering, 2002, 42(1): 43–58.

    Article  Google Scholar 

  11. CHEN J S, PAN J C H. Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling [J]. International Journal of Systems Science, 2005, 36(12): 757–766.

    Article  MathSciNet  MATH  Google Scholar 

  12. THOMALLA C S. Job shop scheduling with alternative process plans [J]. International Journal of Production Economics, 2001, 74(1): 125–134.

    Article  Google Scholar 

  13. DAUZÈRE-PÉRÈS S, PAULLI J. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling [J]. Annals of Operations Research, 1997, 70(3): 281–306.

    Article  MathSciNet  MATH  Google Scholar 

  14. LOGENDRAN R, SONTHINEN A. A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems [J]. Journal of Operational Research Society, 1997, 48(3): 264–277.

    MATH  Google Scholar 

  15. BILGE Ü, KIRAÇ F, KURTULAN M, PEKGÜN P. A tabu search algorithm for parallel machine total tardiness problem [J]. Computers & Operations Research, 2004, 31(3): 397–414.

    Article  MATH  Google Scholar 

  16. SCRICH C R, ARMENTANO V A, LAGUNA M. Tardiness minimization in a flexible job shop: A tabu search approach [J]. Journal of Intelligent Manufacturing, 2004, 15(1): 103–115.

    Article  Google Scholar 

  17. CAO D, CHEN M, WAN G. Parallel machine selection and job scheduling to minimize machine cost and job tardiness [J]. Computers & Operations Research, 2005, 32(8): 1995–2012.

    Article  MATH  Google Scholar 

  18. MEHRABAD M S, FATTAHI P. Flexible job shop scheduling with tabu search algorithms [J]. International Journal of Advanced Manufacturing Technology, 2007, 32(5/6): 563–570.

    Article  Google Scholar 

  19. CANDIDO M A B, KHATOR S K, BARCIA R M. A genetic algorithm based procedure for more realistic job shop scheduling problems [J]. International Journal of Production Research, 1998, 36(12): 3437–3457.

    Article  MATH  Google Scholar 

  20. ZHAO C, WU Z. A genetic algorithm approach to the scheduling of FMSs with multiple routes [J]. International Journal of Flexible Manufacturing Systems, 2001, 13(1): 71–88.

    Article  Google Scholar 

  21. ROSSI A, DINI G. An evolutionary approach to complex job-shop and flexible manufacturing system scheduling [J]. Journal of Engineering Manufacture, 2001, 215(2): 233–245.

    Article  Google Scholar 

  22. KIM Y K, PARK K, KO J. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling [J]. Computers & Operations Research, 2003, 30(8): 1151–1171.

    Article  MathSciNet  MATH  Google Scholar 

  23. TAVAKKOLI-MOGHADDAM R, KHODADADEGHAN Y, HAGHNEVIS M. Efficient algorithm for a multi-criteria parallel machine scheduling problem with sequence-dependent setup times [C]// Proceedings of 5th International Symposium on Intelligent Manufacturing Systems. Sakarya, Turkey: Sakarya University, 2006: 159–167.

    Google Scholar 

  24. BASKAK M, EROL V A. Genetic algorithm approach for solving flexible job-shop scheduling problem [C]// Proceedings of 35th International Conference on Computers & Industrial Engineering. Istanbul, Turkey, 2005: 245–250.

  25. HUSSAIN M F, JOSHI S B. A genetic algorithm for job shop scheduling problems with alternate routing [C]// IEEE International Conference on Systems, Man and Cybernetics. San Diego, CA, USA, 1998: 2225–2230.

  26. JAWAHAR N, ARAVINDAN P, PONNAMBALAM S G. A genetic algorithm for scheduling flexible manufacturing systems [J]. International Journal of Advanced Manufacturing Technology, 1998, 14(8): 588–607.

    Article  Google Scholar 

  27. BECK J C, FOX M S. Constraint-directed techniques for scheduling alternative activities [J]. Artificial Intelligence, 2000, 121(1/2): 211–250.

    Article  MathSciNet  MATH  Google Scholar 

  28. FERREIRA J C E, WYSK R A. On the efficiency of alternatives in process plans [J]. Journal of Brazilian Society of Mechanical Sciences, 2001, 23(3): 303–319.

    Google Scholar 

  29. SAYGIN C, CHEN F F, SINGH J. Real-time manipulation of alternative routings in flexible manufacturing systems: A simulation study [J]. International Journal of Advanced Manufacturing Technology, 2001, 18(10): 755–763.

    Article  Google Scholar 

  30. DEMIR H I. Scheduling with alternative routes [C]// Proceedings of 5th International Symposium on Intelligent Manufacturing Systems. Sakarya, Turkey: Sakarya University, 2006: 1323–1338.

    Google Scholar 

  31. ROSSI A, DINI G. Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method [J]. Robotics & Computer Integrated Manufacturing, 2007, 23(5): 503–516.

    Article  Google Scholar 

  32. LOW C, HSU C J, SU C T. A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines [J]. Computers & Operations Research, 2008, 35(3): 845–853.

    Article  MathSciNet  MATH  Google Scholar 

  33. HOLLAND J. Adaptation in natural and artificial systems [M]. Ann Arbor: University of Michigan Press, 1975.

    Google Scholar 

  34. GOLDBERG D E. Genetic algorithms in search, optimization and machine learning [M]. New York: Addison-Wesley Publishing Company, 1989.

    Google Scholar 

  35. DAVIS L. Job shop scheduling with genetic algorithms [C]// GREFENSTETTE J J. Proceedings of the 1st International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum, 1985: 136–140.

    Google Scholar 

  36. CHAUDHRY I A, DRAKE P R. Minimizing flow time variance in a single machine system using genetic algorithms [J]. International Journal of Advanced Manufacturing Technology, 2008, 39(3/4): 355–366.

    Article  Google Scholar 

  37. CHAUDHRY I A, Drake P R. Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms [J]. International Journal of Advanced Manufacturing Technology, 2009, 42(5/6): 581–594.

    Article  Google Scholar 

  38. CHAUDHRY I A. Minimizing flow time for the worker assignment problem in identical parallel machine models using GA [J]. International Journal of Advanced Manufacturing Technology, 2009, 48(5–8): 747–760.

    Google Scholar 

  39. Palisade Corp. Genetic algorithm solver for Microsoft Excel: Guide to evolver [M]. New York: Palisade corporation, 1998.

    Google Scholar 

  40. DAVIS L. Handbook of genetic algorithms [M]. New York: Van Nostrand Reinhold, 1991: 332–349.

    Google Scholar 

  41. MUELLER K. Development, implementation and test of a heuristic branch-and-bound procedure for machine assignment in flexible manufacturing system [D]. Diplomarbeit, Universitat Karlsruhe, Fakultat fur Informatik, 1992. (in German).

    Google Scholar 

  42. SUNDARAM R M, FU S S. Process planning and scheduling-A method of integration for productivity improvement [J]. Computers & Industrial Engineering, 1998, 15(1–4): 296–301.

    Google Scholar 

  43. MORAD N, ZALZALA A M S. Genetic algorithms in integrated process planning and scheduling [J]. Journal of Intelligent Manufacturing, 1999, 10(2): 169–179.

    Article  Google Scholar 

  44. PALMER G. J. A simulated annealing approach to integrated production scheduling [J]. Journal of Intelligent Manufacturing, 1996, 7(3): 163–176.

    Article  Google Scholar 

  45. KACEM I, HAMMADI S, BORNE P. Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems [J]. IEEE Transactions on Systems, Man & Cybernetics, Part C, 2002, 32(1): 1–13.

    Article  Google Scholar 

  46. XING L N, CHEN Y W, YANG K W. Multi-objective flexible job shop schedule: Design and evaluation by simulation modelling [J]. Applied Soft Computing, 2009, 9(1): 362–376.

    Article  Google Scholar 

  47. XIA W, WU Z. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems [J]. Computers & Industrial Engineering, 2005, 48(3): 409–425.

    Article  Google Scholar 

  48. ZHANG H, GEN M. Multistage-based genetic algorithm for flexible job-shop scheduling problem [J]. Journal of Complexity International, 2005, 11: 223–232.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National University of Sciences and Technology, Islamabad, Pakistan

    I. A. Chaudhry

Authors
  1. I. A. Chaudhry
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. A. Chaudhry.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chaudhry, I.A. Job shop scheduling problem with alternative machines using genetic algorithms. J. Cent. South Univ. Technol. 19, 1322–1333 (2012). https://doi.org/10.1007/s11771-012-1145-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-012-1145-8

Key words

Search

Navigation