A case study on the multistage IC final testing scheduling problem with reentry

International Journal of Production Economics

Volumn 88, Issue 3, 2004, Pages 257-267

  Pearn, W L ^a   Chung, S H ^a   Chen, A Y ^a   Yang, M H ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL UNITED UNIVERSITY   (Taiwan)

Author keywords

Complex flow shop; Due date; Parallel machine scheduling problem; Reentrant flow lines; Sequence dependent setup time

Indexed keywords

ALGORITHMS; BATCH DATA PROCESSING; COMPUTER SIMULATION; INTEGER PROGRAMMING; MANUFACTURE; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

COMPLEX FLOW SHOP; DUE DATE; PARALLEL-MACHINE SCHEDULING PROBLEM; REENTRANT FLOW LINES; SEQUENCE DEPENDENT SET UP TIME;

INTEGRATED CIRCUIT TESTING;

EID: 1642352034     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(03)00186-5     Document Type: Article

References (17)

1. Altinkemer K., Gavish B. Parallel savings based heuristics for the delivery problem. Operations Research. 39(3):1991;456-469.
2. Centeno G., Armacost R.L. Parallel machine scheduling with release time and machine eligibility restrictions. Computers and Industrial Engineering. 33(1-2):1997;273-276.
3. Chen T.R., Chang T.S., Chen C.W., Kao J. Scheduling for IC sort and test with preemptiveness via Lagrangian relaxation. Transactions on Systems, Man, and Cybernetics. 25(8):1995;1249-1256.
4. Chikamura, A., Nakamae, K., Fujioka, H., 1997. Effect of express lots on production dispatching rule scheduling and cost in final test process of LSI manufacturing system. IEEE International Symposium on Semiconductor Manufacturing Conference Proceedings, D23-D26.
5. Clark G., Wright J. Scheduling vehicles from a central depot to a number of delivery points. Operations Research. 12:1964;568.
6. Connors D.P., Feigin G.E., Yao D.D. A queuing network model for semiconductor manufacturing. IEEE Transactions on Semiconductor manufacturing. 9(3):1996;412-427.
7. Hwang H., Sun J.U. Production sequencing problem with reentrant work flows and sequence dependent setup times. Computers and Industrial Engineering. 33(3-4):1997;773-776.
8. Kumar P.R. Re-entrant lines. Queueing Systems: Theory and Applications. 13:1993;87-110.
9. Ovacik I.M., Uzsoy R. Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup time. International Journal of Production Research. 33(11):1995;3173-3192.
10. Ovacik I.M., Uzsoy R. Decomposition methods for scheduling semiconductor testing facilities. International Journal of Flexible Manufacturing Systems. 8:1996;357-388.
11. Pearn W.L., Chung S.H., Yang M.H. The wafer probing scheduling problem (WPSP). Journal of the Operational Research Society. 53:2002;864-874.
12. Potvin Y., Rousseau J.M. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research. 66:1993;331-340.
13. Sawik T. Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Mathematical and Computer Modelling. 31(13):2000;39-52.
14. Schutten J.M.J., Leussink R.A.M. Parallel machine scheduling with release dates, due dates and family setup times. International Journal of Production Economics. 46-47:1996;119-125.
15. Vargas-Villamil, F.D., Rivera, D.E., 1997. Scheduling of reentrant manufacturing lines using a model predictive control (MPC) approach. Proceedings of the 1997 American Control Conference, American Automatic Control Council, Vol. 1(3), pp. 1919-1923.
16. Yalaoui F., Chu C. Parallel machine scheduling to minimize total tardiness. International Journal of Production Economics. 76(3):2002;265-279.
17. Yoo W.S., LA M.V. A decomposition methodology for scheduling semiconductor test operations for number of tardy job measures. Journal of Electronics Manufacturing. 17(1):1997;51-61.