Group-scheduling problems in electronics manufacturing

Journal of Scheduling

Volumn 13, Issue 2, 2010, Pages 177-202

  Gelogullari, Cumhur A ^a   Logendran, Rasaratnam ^b  

^a AMR   (United States)

^b Oregon State University   (United States)

Author keywords

Branch and price; Carryover sequence dependent setups; Column generation; Lower bound; Mathematical programming; PCB scheduling; Tabu search

Indexed keywords

BRANCH AND PRICE; COLUMN GENERATION; LOWER BOUND; LOWER BOUNDS; PCB SCHEDULING; SEQUENCE DEPENDENT SETUPS;

COMPUTER SOFTWARE SELECTION AND EVALUATION; LINEAR PROGRAMMING; LINEARIZATION; PRINTED CIRCUIT BOARDS; PRINTED CIRCUIT MANUFACTURE; STATISTICAL TESTS;

TABU SEARCH;

EID: 77952424614     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-009-0147-3     Document Type: Article

References (37)

1. Amini, M. M., and Racer, M. A. (1994). Rigorous computational comparison of alternative solution methods for the generalized assignment problem. Management Science, 40(7), 868-890.
2. Anon. (2003). ILOG Branch&Price&Cut and shortest path optimizers prototype manual. Mountain View: Ilog Inc.
3. Anon. (2004a). ILOG CPLEX 9.0 reference manual. Mountain View: Ilog Inc.
4. Anon. (2004b). SAS: The SAS system for Windows. Cary: SSAS Institute Inc.
5. Balakrishnan, A., and Vanderbeck, F. (1999). A tactical planning model for mixed-model electronics assembly operations. Operations Research, 47(3), 395-409.
6. Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., and Vance, P. (1998). Branch-and-Price: Column generation for solving huge integer programs. Operations Research, 46, 316-329.
7. Barr, R. S., Golden, B. L., Kelly, J. P., Resende, M. G. C., and Stewart, W. R. (1995). Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1, 9-32.
8. Bulbul, K., Kaminsky, P., and Yano, C. (2004). Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs. Naval Research Logistics, 51, 407-445.
9. Chen, Z. L., and Powell, W. (1999). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing, 11, 78-94.
10. Coffin, M., and Saltzman, M. J. (2000). Statistical analysis of computational tests of algorithms and heuristics. INFORMS Journal on Computing, 12(1), 24-44.
11. Crama, Y., van de Klundert, J. J., and Spieksma, F. C. R. (2002). Production planning problems in printed circuit board assembly. Discrete Applied Mathematics, 123, 339-361.
12. du Merle, O., Villeneuve, D., Desrosiers, J., and Hansen, P. (1999). Stabilized column generation. Discrete Mathematics, 194, 229-237.
13. Eom, D. H., Shin, H. J., Kwun, I. H., Shim, J. K., and Kim, S. S. (2002). Scheduling jobs on parallel machines with sequence-dependent family set-up times. International Journal on Advanced Manufacturing Technology, 19, 926-932.
14. Garey, M. R., Johnson, D. S., and Sethi, R. R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 36, 767-777.
15. Gelogullari, C. A. (2005). Group scheduling problems in electronics manufacturing. Doctoral dissertation, Oregon State University, Corvallis, OR, USA.
16. Glover, F., and Laguna, M. (1997). Tabu search. Boston: Kluwer Academic.
17. Gopalakrishnan, M., Ding, K., Bourjolly, J. M., and Mohan, S. (2001). A tabu-search heuristic for the capacitated lot sizing problem with set-up carryover. Management Science, 47, 851-863.
18. Hayrinen, T., Johnsson, M., Jahletta, T., Smed, J., and Nevalainen, O. (2000). Scheduling algorithms for computer-aided line balancing in printed circuit board assembly. Production Planning and Control, 11, 497-510.
19. Hooker, J. N. (1994). Needed: An empirical science ofalgorithms. Operations Research, 42(3), 201-212.
20. Johnson, M., and Smed, J. (2001). Observations on PCB assembly optimization. Electronic Packaging and Production, 28, 1871-1883.
21. Kanet, J. J., and Sridharan, V. (2000). Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research, 48, 99-110.
22. Leon, V. J., and Peters, B. A. (1996). Replanning and analysis of partial setup strategies in printed circuit board assembly systems. International Journal of Flexible Manufacturing Systems, 8, 389-412.
23. Logendran, R., and Sonthinen, A. (1997). A tabu search-based approach for scheduling job-shop type flexible manufacturing systems. Journal of the Operational Research Society, 48, 264-277.
24. Logendran, R., and Subur, F. (2004). Unrelated parallel machine scheduling with job splitting. IIE Transactions, 6(4), 359-372.
25. Maimon, O., and Schtub, A. (1991). Grouping methods for printed circuit boards. International Journal ofProduction Research, 29, 1370-1390.
26. McGinnis, L. F., Ammons, J. C., Carlyle, M., Cranmer, L., Depuy, G. W., Ellis, K. P. Tovey, C. A. and Xu, H. (1992). Automated process planning for printed circuit card assembly. IIE Transactions, 24, 18-30.
27. Montgomery, D. C. (2005). Design and analysis of Experiments.New York: Wiley.
28. Rossetti, M. D., and Stanford, K. J. A. (2003). Group sequencing a PCB assembly system via an expected sequence dependent setup heuristic. Computers and Industrial Engineering, 45(1), 231-254.
29. Savelsbergh, M. (1997). A branch-and-price algorithm for the generalized assignment problem. Operations Research, 45, 831-841.
30. Schaller, J. E. (2001). A new lower bound for the flow shop group scheduling problem. Computers and Industrial Engineering, 41, 151-161.
31. Smed, J., Salonen, K., Johnsson, M., Johletta, T., and Nevalainen, O. (2004). Grouping PBCs with minimum feeder changes. International Journal of Flexible Manufacturing Systems, 15, 19-35.
32. Sox, C. R., and Gao, Y. (1999). The capacitated lot sizing problem with setup carry-over. IIE Transactions, 31, 173-181.
33. Strusevic, V. A. (2000). Group technology approach to the open shop scheduling problem with batch setup times. Operations Research Letters, 26, 181-192.
34. Suerie, C., and Stadtler, H. (2003). The capacitated lot-sizing problem with linked lot sizes. Management Science, 49, 1039-1054.
35. Tang, C. S., and Denardo, E. V. (1988). Models arising from a flexible manufacturing machine, part 1: Minimization of the number of tool switches. Operations Research, 36, 767-777.
36. Van den Akker, J., Hoogeven, J., and Van de Velde, S. (1999). Parallel machine scheduling by column generation. Operations Research, 47, 862-872.
37. Vanderbeck, F., and Wolsey, L. (1996). An exact algorithm for IP column generation. Operations Research Letters, 19, 151-159.