Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics

Flexible Services and Manufacturing Journal

Volumn 25, Issue 3, 2013, Pages 343-366

  Wang, I Lin ^a   Wang, Yi Chi ^b   Chen, Chih Wei ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^b FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Dispatching rule; Local search; Mixed integer programming; Scheduling

Indexed keywords

DISPATCHING RULES; LARGE-SCALE SCHEDULING PROBLEMS; LOCAL SEARCH; MIXED INTEGER PROGRAMMING; MIXED INTEGER PROGRAMMING (MIP); SEMICONDUCTOR MANUFACTURING; SEMICONDUCTOR MANUFACTURING PROCESS; SEQUENCE-DEPENDENT SETUP TIME;

POLYNOMIALS; SCHEDULING ALGORITHMS; SEMICONDUCTOR DEVICE MANUFACTURE;

SCHEDULING;

EID: 84879008848     PISSN: 19366582     EISSN: 19366590     Source Type: Journal    
DOI: 10.1007/s10696-012-9150-7     Document Type: Article

References (24)

1. Altendorfer K, Kabelka B, Stöher W (2007) A new dispatching rule for optimizing machine utilization at a semiconductor test field. In: Advance semiconductor manufacturing conference IEEE/SEMI, pp 188-193
2. Arzi Y, Raviv D (1998) Dispatching in a workstation belonging to a re-entrant production line under sequence-dependent set-up times. Prod Plan Control 9:690-699 (Pubitemid 128624361)
3. Balakrishnan N, Kanet JJ, Sridharan SV (1999) Early/Tardy scheduling with sequence dependent setups on uniform parallel machines. Comput Oper Res 26:127-141 (Pubitemid 29346480)
4. Bank J, Werner F (2001) Heuristic algorithms for unrelated parallel-machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties. Math Comput Model 33:363-383 (Pubitemid 32122694)
5. Bilge Ü, KIrac F, Kurtulan M, Pekgün P (2004) A Tabu search algorithm for parallel machine total tardiness problem. Comput Oper Res 31:397-414 (Pubitemid 38092934)
6. Bixby R, Burda R, Miller D (2006) Short-interval detailed production scheduling in 300 mm semiconductor manufacturing using mixed integer and constraint programming. In: Advance semiconductor manufacturing conference IEEE/SEMI, pp 148-154 (Pubitemid 44815897)
7. Blackstone JH, Phillips DT, Hogg GL (1982) A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int J Prod Res 20:27-45
8. Dabbas R, Fowler JW (2003) A new scheduling approach using combined dispatching criteria in wafer fabs. IEEE Trans Semicond Manuf 16(3):501-510
9. Haupt R (1999) A survey of priority rule-based scheduling. OR Spectr 11:3-16
10. Hochbaum DS, Landy D (1997) Scheduling semiconductor burn-in operations to minimize total flowtime. Oper Res 45:874-885 (Pubitemid 127684768)
11. Jula P, Leachman RC (2010) Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints. Oper Res 58:933-947
12. Kim CO, Shin HJ (2003) Scheduling jobs on parallel machines: a restricted Tabu search approach. Int J Adv Manuf Technol 22:278-287
13. Kim YD, Lee DH, Kim JU (1998) A simulation study on lot release control, mask scheduling, and batch scheduling in semiconductor wafer fabrication facilities. J Manuf Syst 17:107-117
14. Kim SS, Shin HJ, Eom DH, Kim CO (2003) A due date density-based categorising heuristic for parallel machines scheduling. Int J Adv Manuf Technol 22:753-760
15. Kurz ME, Askin RG (2001) Heuristic scheduling of parallel machines with sequence-dependent set-up times. Int J Prod Res 39:3747-3769 (Pubitemid 35165511)
16. Lee YH, Bhaskaran K, Pinedo M (1997) A heuristic to minimize the total weighted tardiness with sequence dependent setups. IIE Trans 29:45-52 (Pubitemid 127754351)
17. Lee YH, Park JK, Kim SY (2002) Experimental study on input and bottleneck scheduling for a semiconductor fabrication line. IIE Trans 34:179-190 (Pubitemid 34138509)
18. Logendran R, McDonell B, Smucker B (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Comput Oper Res 34:3420-3438 (Pubitemid 46517865)
19. Ovacik IM, Uzsoy R (1995) Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. Int J Prod Res 33:3173-3192
20. Pinedo M (1995) Scheduling theory algorithm and systems. Prentice Hall Englewood Cliffs, New Jersey
21. Schutten JMJ (1996) List scheduling revisited. Oper Res Lett 18:167-170 (Pubitemid 126398840)
22. Sivrikaya-Serifoglu F, Ulusoy G (1999) Parallel machine scheduling with earliness and tardiness penalties. Comput Oper Res 26:773-787 (Pubitemid 29351336)
23. Wang C, Ghenniwa H, Shen W (2005) Heuristic scheduling algorithm for flexible manufacturing systems with partially overlapping machine capabilities. Mechatron Autom IEEE Int Conf 3:1139-1144 (Pubitemid 41585565)
24. Zhu X, Wilhelm WE (2006) Scheduling and lot sizing with sequence-dependent setup: a literature review. IIE Trans 38:987-1007 (Pubitemid 44355862)