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

International Journal of Advanced Manufacturing Technology

Volumn 39, Issue 3-4, 2008, Pages 344-354

  Chen, J C ^a   Chen, K H ^b   Wu, J J ^c   Chen, C W ^a  

^a CHUNG YUAN CHRISTIAN UNIVERSITY   (Taiwan)

^b MINISTRY OF NATIONAL DEFENSE   (Taiwan)

^c Data Systems Consulting   (Taiwan)

Author keywords

Makespan; On time delivery; Parallel machine; Reentrant

Indexed keywords

COMPUTER SOFTWARE MAINTENANCE; DISPERSIONS; INDUSTRIAL PLANTS; MACHINE SHOPS; MARKOV PROCESSES; PARALLEL ALGORITHMS; TECHNICAL PRESENTATIONS;

BILL-OF-MATERIALS; CASE STUDIES; EARLIEST-DUE-DATE; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; HIERARCHICAL STRUCTURING; JOB SHOP SCHEDULING PROBLEM; LONGEST PROCESSING TIME; MACHINE SELECTION; MAKESPAN; MAXIMUM LATENESS; ON-TIME DELIVERY; OPERATION SCHEDULING; PARALLEL MACHINE; PARALLEL MACHINES; PERFORMANCE MEASURE; PERFORMANCE MEASURES; REENTRANT; SCHEDULING METHODS; SIMULATION RESULTS; WEAPONS PRODUCTION;

SCHEDULING;

EID: 52649152349     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-1227-1     Document Type: Article

References (21)

1. A Allahverdi FS Al-Anzi 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
2. A Allahverdi JND Gupta T Aldowaisan 2006 A review of scheduling research involving setup considerations OMEGA 27 2 219 239
3. A Baykasoǧlu 2002 Linguistic-based meta-heuristic optimization model for flexible job shop scheduling Int J Prod Res 40 17 4523 4543
4. P Brucker R Schlie 1990 Job-shop scheduling with multi-purpose machines Computing 45 4 369 375
5. G Centeno RL Armacost 2004 Minimizing makespan on parallel machines with release time and machine eligibility restrictions Int J Prod Res 42 6 1243 1256
6. FTS Chan TC Wong LY Chan 2006 Flexible job-shop scheduling problem under resource constraints Int J Prod Res 44 11 2071 2089
7. JC Chen C-W Chen J-Y Dai JC Tyan 2004 Dynamic state-dependent dispatching for wafer fab Int J Prod Res 42 21 4547 4562
8. JC Chen C-W Chen CJ Lin H Rau 2005 Capacity planning with capability for multiple semiconductor manufacturing fabs Comput Ind Eng 48 4 709 732
9. I-C Choi D-S Choi 2002 A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups Comput Ind Eng 42 1 43 58
10. TC Hu 1961 Parallel sequencing and assembly line problems Oper Res 9 6 841 848
11. J Hurink S Knust 2001 List scheduling in a parallel machine environment with precedence constraints and setup time Oper Res Lett 29 5 231 239
12. AA Kalir SC Sarin 1999 The role of advanced start and dominance rules in simulated annealing for parallel processor scheduling problems Prod Plan Control 10 8 757 766
13. YK Kim K Park J Ko 2003 A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling Comput Oper Res 30 8 1151 1171
14. ME Kurz RG Askin 2001 Heuristic scheduling of parallel machines with sequence-dependent set-up times Int J Prod Res 39 16 3747 3769
15. Law AM, Kelton WD (2000) Simulation modeling and analysis, 3rd edn. McGraw-Hill, New York
16. M Mastrolilli LM Gambardella 2000 Effective neighbourhood functions for the flexible job shop problem J Sched 3 1 3 20
17. BA Norman JC Bean 1999 A genetic algorithm methodology for complex scheduling problems Nav Res Logist 46 2 199 211
18. H Pierreval N Mebarki 1997 Dynamic scheduling selection of dispatching rules for manufacturing system Int J Prod Res 35 6 1575 1591
19. M Saidi-Mehrabad P Fattahi 2007 Flexible job shop scheduling with tabu search algorithms Int J Adv Manuf Technol 32 5-6 563 570
20. V Subramaniam GK Lee GS Hong YS Wong T Ramesh 2000 Dynamic selection of dispatching rules for job shop scheduling Prod Plan Control 11 1 73 81
21. MY Wang SP Sethi SL van de Velde 1997 Minimizing makespan in a class of reentrant shops Oper Res 45 5 702 712