Minimizing total tardiness on a batch processing machine with incompatible job families

IIE Transactions (Institute of Industrial Engineers)

Volumn 30, Issue 2, 1998, Pages 165-178

  Mehta, Sanjay V ^a   Uzsoy, Reha ^b  

^a i2 Technologies   (United States)

^b SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; POLYNOMIALS; PROCESS CONTROL; PRODUCTION CONTROL; SEMICONDUCTOR DEVICE MANUFACTURE;

BATCH PROCESSING MACHINES; INCOMPATIBLE JOB FAMILIES;

SCHEDULING;

EID: 0032003105     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179808966448     Document Type: Article

References (31)

1. Uzsoy, R., Lee, C.-Y., and Martin-Vega, L.A., (1992) A review of production planning and scheduling models in the semiconductor industry. Part I system characteristics, performance evaluation and production planning. IIE Transactions on Scheduling and Logistics, 24, 47–59.
2. Uzsoy, R., Lee, C.Y., and Martin-Vega, L.A., (1992) Scheduling semiconductor test operations minimizing maximum lateness and number of tardy jobs on a single machine. Naval Research Logistics, 39, 369–388.
3. Runyan, W.R., and Bean, K.E., (1990) Semiconductor IntegratedCircuit Processing Technology, Addison-Wesley, New York.
4. Uzsoy, R., (1995) Scheduling batch processing machines with incompatible job families. International Journal of Production Research, 33, 2685–2708.
5. Du, J., and Leung, J.Y.T., (1990) Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483–95.
6. Lawler, E.L., (1977) A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1, 331–342.
7. Potts, C.N., Van Wassenhove, L.N., (1982) A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 1, 177–181.
8. Vepsalainen, A., and Morton, T.E., (1987) Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs. Management Science, 33, 1036–1047.
9. Chambers, R.J., Carraway, R.L., Lowe, T.J., and Morin, T.L., (1991) Dominance and decomposition heuristics for single machine scheduling. Operations Research, 39, 639–647.
10. Abdul-Razaq, T.S., Potts, C.N., van Wassenhove, L.N., (1990) A survey of algorithms for the single machine weighted tardiness problem. Discrete Applied Mathematics, 26, 235–253.
11. Pinedo, M., (1995) Scheduling Theory, Algorithms and Systems, Prentice Hall, NJ.
12. Webster, S., and Baker, K.R., (1995) Scheduling groups of jobs on a single machine. Operations Research, 43, 692–703.
13. Ikura, Y., and Gimple, M., (1986) Scheduling algorithms for a single batch processing machine. Operations Research Letters, 5, 61–65.
14. Ue, C.Y., Uzsoy, R., and Martin-Vega, L.A., (1992) Efficient algorithms for scheduling batch processing machines. Operations Research, 40, 764–775.
15. Li, C.-L., and Le, C.-Y., (1997) Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research, (forthcoming).
16. Ahmadi, J.H., Ahmadi, R.H., Dasu, S., and Tang, C.S., (1992) Batching and scheduling jobs on batch and discrete processors, Operations Research, 40, 750–763.
17. Chandru, V., Lee, C.Y., and Uzsoy, R., (1993) Minimizing total completion time on batch processing machines. International Journal of Production Research, 31, 2097–2121.
18. Chandru, V., Lee, C.Y., and Uzsoy, R., (1993) Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13, 61–65.
19. Hochbaum, D.S., and Landy, D., (1994) Algorithms and heuristics for scheduling semiconductor burn-in operations; Research Report ESRC 94–8, Department of Industrial Engineering and Operations Research, University-of California, Berkeley, CA 94720.
20. Uzsoy, R., (1994) Scheduling a single batch processing machine with nonidentical job sizes. International Journal of Production Research, 32, 1615–1635.
21. Uzsoy, R., Lee, C.Y., and Martin-Vega, L.A., (1994) A survey of production planning and scheduling models in the semiconductor industry. Part II shop-floor control. IIE Transactions on Scheduling and Logistics, 26, 44–45.
22. Uzsoy, R., and Yang, Y., (1997) Minimizing total weighted completion time on a single batch processing machine. Production and Operations Management, 6, 57–73.
23. Lee, C.Y., and Uzsoy, R., (1996) Minimizing makespan on a single batch processing machine with dynamic job arrivals. School of Industrial Engineering, Purdue University, West Lafayette, IN.
24. Dobson, G., and Nabinadom, R.S., (1992) The batch loading and scheduling problem. Research Report, Simon Graduate School of Business Administration, University of Rochester.
25. Chandra, P., and Gupta, S., (1992) An analysis of a last-station-bottleneck semiconductor packaging line. Research Report, Faculty of Management, McGill University.
26. Lenstra, J.K., Rinnooy Kan, A.H.G., and Brucker, P., (1977) Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362.
27. Monma, C.L., and Potts, C.N., (1989) On the complexity of scheduling with batch setup times. Operations Research, 37, 798–804.
28. Ashour, S., (1967) A decomposition approach for the machine scheduling problem. International Journal of Production Research, 6, 109–122.
29. Sidney, J.B., (1975) Decomposition algorithms for single machine sequencing with precedence relations and deferral costs. Operations Research, 23, 283–298.
30. Sidney, J.B., (1981) A decomposition algorithm for sequencing with general precedence constraints. Mathematics of Operations Research, 6, 190–204.
31. Ovacik, I., and Uzsoy, R., (1994) Rolling horizon algorithms for a single machine dynamic scheduling problem with sequence dependent setup times. International Journal of Production Research, 32, 1243–1263.