Scheduling with batch setup times and earliness-tardiness penalties

European Journal of Operational Research

Volumn 96, Issue 3, 1997, Pages 518-537

  Chen, Zhi Long ^a  

^a Princeton University   (United States)

Author keywords

Batch setup times; Common due date; Dynamic programming algorithm; Earliness tardiness penalties; NP hardness; Single machine scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; MACHINERY; MATHEMATICAL MODELS; PRODUCTION;

BATCH SETUP TIMES; COMMON DUE DATE; DYNAMIC PROGRAMMING ALGORITHM; EARLINESS TARDINESS PENALTIES; SINGLE MACHINE SCHEDULING;

SCHEDULING;

EID: 0031078986     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0377-2217(96)00096-3     Document Type: Article

References (25)

1. Baker, K.R., and Scudder, G.D., "Sequencing with earliness and tardiness penalties: A review", Operations Research 38 (1990) 22-36.
2. Bagchi, U., Chang, Y., and Sullivan, "Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date", Naval Research Logistic Quarterly 34 (1987) 739-751.
3. Chen, B., "A better heuristic for preemptive parallel machine scheduling with batch setup times", SIAM Journal on Computing 22 (1993) 1303-1318.
4. Chen, Z.L., "Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs", European Journal of Operational Research 93 (1996) 49-60.
5. Cheng, T.C.E., and Chen, Z.L., "Parallel machine scheduling with batch setup times", Operations Research 42 (1994) 1171-1174.
6. Cheng, T.C.E., and Chen, Z.L., "Parallel machine scheduling with earliness and tardiness penalties", Journal of the Operational Research Society 45 (1994) 685-695.
7. Cheng, T.C.E., and Gupta, M.C., "Survey of scheduling research involving due date determination decisions", European Journal of Operational Research 38 (1989) 156-166.
8. Conway, R.W., Maxwell, W.L., and Miller, L.W., Theory of Scheduling, Addison-Wesley, Reading, MA, 1967.
9. Davis, J.S., and Kanet, J.J., "Single-machine scheduling with early and tardy completion costs", Naval Research Logistics 40 (1993) 85-101.
10. Federgruen, A., and Mosheiov, G., "Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems", Naval Research Logistics 40 (1993) 951-970.
11. Garey, M.R., Tarjan, R.E., and Wilfong, G.T., "One-processor scheduling with symmetric earliness and tardiness penalties", Mathematics of Operations Research 13 (1988) 330-348.
12. Ghosh, J.B., "Batch scheduling to minimize total completion time", Operations Research Letters 16 (1994) 271-275.
13. Hall, N.G., Kubiak, W., and Sethi, S.P., "Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date", Operations Research 39 (1991) 847-856.
14. Hall, N.G., and Posner, M.E., "Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date", Operations Research 39 (1991) 836-846.
15. Herrmann, J.W., and Lee, C.-Y., "On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date", European Journal of Operational Research 70 (1993) 272-288.
16. Lee, C.-Y., Danusaputro, S.L., and Lin, C.S., "Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date", Computers and Operations Research 18 (1991) 379-389.
17. Li, C.-L., Chen, Z.-L., and Cheng, T.C.E., "A note on one-processor scheduling with asymmetric earliness and tardiness penalties", Operations Research Letters 13 (1993) 45-48.
18. Li, C.-L., and Cheng, T.C.E., "The parallel machine min-max weighted absolute lateness scheduling problem", Naval Research Logistics 41 (1994) 33-46.
19. Li, C.-L., Cheng, T.C.E., and Chen, Z.-L., "Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs", Computers and Operations Research 22 (1995) 205-219.
20. Liman, S.D., and Lee, C.-Y., "Error bound of a heuristic for the common due date scheduling problem", ORSA Journal on Computing 5 (1993) 420-425.
21. Monma, C.L., and Potts, C.N., "On the complexity of scheduling with batch setup times", Operations Research 37 (1989) 798-804.
22. Monma, C.L., and Potts, C.N., "Analysis of heuristics for preemptive parallel machine scheduling with batch setup times", Operations Research 41 (1993) 981-993.
23. Panwalkar, S., Smith, M., and Seidmann, A., "Common due date assignment to minimize total penalty for one machine scheduling problem", Operations Research 30 (1982) 391-399.
24. Potts, C.N., and Van Wassenhove, L.N., "Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity", Journal of Operational Research Society 43 (1992) 395-406.
25. Sung, C.S., and Joo, U.G., "A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date", Computers and Operations Research 19 (1992) 757-766.