A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system

Journal of the Operational Research Society

Volumn 54, Issue 10, 2003, Pages 1038-1049

  Lee, G C ^a   Kim, Y D ^a   Kim, J G ^b   Choi, S H ^c  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Georgia Institute of Technology   (United States)

^c Daebul University   (South Korea)

Author keywords

Dispatching rules; Printed circuit board manufacturing; Production scheduling; Simulation

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CUSTOMER SATISFACTION; HEURISTIC METHODS; PARALLEL PROCESSING SYSTEMS; PRINTED CIRCUIT MANUFACTURE;

DISPATCHING RULES; PARALLEL MACHINES; PRODUCTION-SCHEDULING;

SCHEDULING;

EID: 0141680814     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601601     Document Type: Article

References (32)

1. Denggiz B and Akbay KS (2000). Computer simulation of a PCB production line: metamodeling approach. Int J Prod Econ 63: 195-205.
2. Lin WL and Tardif V (1999). Component partitioning under demand and capacity uncertainty in printed circuit board assembly. Int J Flexible Manuf Syst 11: 159-176.
3. Brah SA and Hunsucker JL (1991). Branch and bound algorithm for the flow shop with multiple processors. Eur J Opl Res 51: 88-99.
4. Garetti M, Pozzetti A and Tavecchio R (1996). Production scheduling in SMT electronic boards assembly. Prod Plann Control 7: 197-204.
5. Ng MK (2000). Clustering methods for printed circuit board insertion problems. J Opl Res Soc 51: 1205-1211.
6. Lim JM (1997). A genetic algorithm for a single hoist scheduling in the printed-circuit-board electroplating line. Comput Ind Eng 33: 789-792.
7. Mak RWT, Lam KK and Gupta SR (1998). A practical algorithm for cyclic hoist scheduling in a PCB manufacturing. J Electron Manuf 8: 193-207.
8. Kim YD, Lim HG and Park MW (1996). Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process. Eur J Opl Res 91: 124-143.
9. Lin FR, Shaw MJ and Locascio A (1997). Scheduling printed circuit board production systems using the two-level scheduling approach. J Manuf Syst 16: 129-149.
10. Häyrinen T et al (2000). Scheduling algorithms for computer-aided line balancing in printed circuit board assembly. Prod Plann Control 11: 497-510.
11. Dessouky MM and Leachman RC (1997). Dynamic models of production with multiple operations and general processing times. J Opl Res Soc 48: 647-654.
12. Kim YD, Kim JU, Lim SK and Jun HB (1998). Due-date based scheduling and control policies in a multiproduct semiconductor wafer fabrication facility. IEEE Trans Semicond Manuf 11: 155-164.
13. Kim YD, Lee DH, Kim JU and Roh HK (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 YD, Kim JG, Choi B and Kim HU (2001). Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates. IEEE Trans Robot Autom 17: 589-598.
15. Dabbas RM, Chen HN, Fowler JW and Shunk D (2001). A combined dispatching criteria approach to scheduling semiconductor manufacturing systems. Comput Ind Eng 39: 307-324.
16. Elmaghraby SE (1978). The economic lot scheduling problem (ELSP): review and extensions. Managt Sci 24: 587-598.
17. Dobson G (1987). The economic lot scheduling problem: achieving feasibility using time-varying lot sizes. Oper Res 35: 764-771.
18. Khouja M and Mehrez A (1994). An economic production lot size model with imperfect quality and variable production rate. J Opl Res Soc 45: 1405-1417.
19. Moon I, Giri BC and Choi K (2002). Economic lot scheduling problem with imperfect production processes and setup times. J Opl Res Soc 53: 620-629.
20. Brah SA (1996). A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Prod Plann Control 7: 362-373.
21. Doll CL and Whybark DC (1973). An iterative procedure for the single-machine multi-product lot scheduling problem. Managt Sci 20: 50-55.
22. Kekre S, Kekre S, Freeman S and Karmarkar US (1985). Lot-sizing and lead-time performance in a manufacturing cell. Interfaces 15(2): 1-9.
23. Panwalkar SS and Iskander W (1977). A survey of scheduling rules. Oper Res 25: 45-61.
24. Blackstone JH, Phillips Jr DT and Hogg DL (1982). A state-of-the-art survey of dispatching rules for manufacturing jobshop operations. Int J Prod Res 25: 1143-1156.
25. Kim YD (1990). A comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings. Int J Prod Res 28: 953-962.
26. Kim YD (1995). A backward approach in list scheduling algorithms for multi-machine tardiness problems. Comput Oper Res 22: 307-320.
27. Russell RS, Dar-El EM and Taylor III BS (1987). A comparative analysis of the COVERT job sequencing rule using various shop performance measures. Int J Prod Res 25: 1523-1540.
28. Vepsalainen APJ and Morton TE (1987). Priority rules for job shops with weighted tardiness cost. Managt Sci 33: 1035-1047.
29. Caskey K and Storch RL (1996). Heterogeneous dispatching rules in job and flow shops. Prod Plann Control 7: 351-361.
30. Barman S (1997). Simple priority rule combinations: an approach to improve both flow time and tardiness. Int J Prod Res 35: 2857-2870.
31. Barman S (1998). The impact of priority rule combinations on lateness and tardiness. IIE Trans 30: 495-504.
32. Schirmer A (2001). Resource-constrained project scheduling: an evaluation of adaptive control schemes for parameterized sampling heuristics. Int J Prod Res 39: 1343-1365.