Skip to main content
SpringerLink
Log in

A study of the flexible job shop scheduling problem with parallel machines and reentrant process

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper develops a scheduling algorithm for the job shop scheduling problem with parallel machines and reentrant process. This algorithm includes two major modules: the machine selection module (MSM) and the operation scheduling module (OSM). An order has several jobs and each job has several operations in a hierarchical structure. The MSM helps an operation to select one of the parallel machines to process it. The OSM is then used to schedule the sequences and the timing of all operations assigned to each machine. A real-life weapons production factory is used as a case study to evaluate the performance of the proposed algorithm. Due to the high penalty of delays in military orders, the on-time delivery rate is the most important performance measure and then makespan is the next most important measure. Well-known performance measures in the scheduling literature, such as maximum lateness and average tardiness, are also evaluated. The simulation results demonstrate that the MSM and OSM using the combination of earliest due date (EDD), the operations’ lowest level code (LLC) of the bill of materials (BOM), and the longest processing time (LPT) outperforms the other scheduling methods.

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. Allahverdi A, Al-Anzi FS (2006) A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times. Eur J Oper Res 169(3):767–780

    Article  MATH  MathSciNet  Google Scholar 

  2. Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. OMEGA 27(2):219–239

    Article  Google Scholar 

  3. Baykasoğlu A (2002) Linguistic-based meta-heuristic optimization model for flexible job shop scheduling. Int J Prod Res 40(17):4523–4543

    Article  MATH  Google Scholar 

  4. Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45(4):369–375

    Article  MATH  MathSciNet  Google Scholar 

  5. Centeno G, Armacost RL (2004) Minimizing makespan on parallel machines with release time and machine eligibility restrictions. Int J Prod Res 42(6):1243–1256

    Article  MATH  Google Scholar 

  6. Chan FTS, Wong TC, Chan LY (2006) Flexible job-shop scheduling problem under resource constraints. Int J Prod Res 44(11):2071–2089

    Article  MATH  Google Scholar 

  7. Chen JC, Chen C-W, Dai J-Y, Tyan JC (2004) Dynamic state-dependent dispatching for wafer fab. Int J Prod Res 42(21):4547–4562

    Article  MATH  Google Scholar 

  8. Chen JC, Chen C-W, Lin CJ, Rau H (2005) Capacity planning with capability for multiple semiconductor manufacturing fabs. Comput Ind Eng 48(4):709–732

    Article  Google Scholar 

  9. Choi I-C, Choi D-S (2002) A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups. Comput Ind Eng 42(1):43–58

    Article  Google Scholar 

  10. Hu TC (1961) Parallel sequencing and assembly line problems. Oper Res 9(6):841–848

    Google Scholar 

  11. Hurink J, Knust S (2001) List scheduling in a parallel machine environment with precedence constraints and setup time. Oper Res Lett 29(5):231–239

    Article  MATH  MathSciNet  Google Scholar 

  12. Kalir AA, Sarin SC (1999) The role of advanced start and dominance rules in simulated annealing for parallel processor scheduling problems. Prod Plan Control 10(8):757–766

    Article  Google Scholar 

  13. Kim YK, Park K, Ko J (2003) A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Comput Oper Res 30(8):1151–1171

    Article  MATH  MathSciNet  Google Scholar 

  14. Kurz ME, Askin RG (2001) Heuristic scheduling of parallel machines with sequence-dependent set-up times. Int J Prod Res 39(16):3747–3769

    Article  MATH  Google Scholar 

  15. Law AM, Kelton WD (2000) Simulation modeling and analysis, 3rd edn. McGraw-Hill, New York

    Google Scholar 

  16. Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Sched 3(1):3–20

    Article  MATH  MathSciNet  Google Scholar 

  17. Norman BA, Bean JC (1999) A genetic algorithm methodology for complex scheduling problems. Nav Res Logist 46(2):199–211

    Article  MATH  MathSciNet  Google Scholar 

  18. Pierreval H, Mebarki N (1997) Dynamic scheduling selection of dispatching rules for manufacturing system. Int J Prod Res 35(6):1575–1591

    Article  MATH  Google Scholar 

  19. Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32(5–6):563–570

    Article  Google Scholar 

  20. Subramaniam V, Lee GK, Hong GS, Wong YS, Ramesh T (2000) Dynamic selection of dispatching rules for job shop scheduling. Prod Plan Control 11(1):73–81

    Article  Google Scholar 

  21. Wang MY, Sethi SP, van de Velde SL (1997) Minimizing makespan in a class of reentrant shops. Oper Res 45(5):702–712

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Chung-Yuan University, Chung-Li, Taiwan, Republic of China

    J. C. Chen & C. W. Chen

  2. System Manufacturing Center, Chung-Shan Institute of Science and Technology, Armaments Bureau, MND, Taipei, Taiwan, Republic of China

    K. H. Chen

  3. Data Systems Consulting, Taipei, Taiwan, Republic of China

    J. J. Wu

Authors
  1. J. C. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. H. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. J. Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. C. W. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. C. Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, J.C., Chen, K.H., Wu, J.J. et al. A study of the flexible job shop scheduling problem with parallel machines and reentrant process. Int J Adv Manuf Technol 39, 344–354 (2008). https://doi.org/10.1007/s00170-007-1227-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-007-1227-1

Keywords

Search

Navigation