Minimizing total tardiness on a single machine with controllable processing times

Computers and Operations Research

Volumn 36, Issue 6, 2009, Pages 1852-1858

  Tseng, Chao Tang ^a   Liao, Ching Jong ^b   Huang, Kuo Ling ^b  

^a CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Controllable processing time; Scheduling; Single machine; Total tardiness

Indexed keywords

DATA COMPRESSION; DYNAMIC PROGRAMMING; EVAPORATIVE COOLING SYSTEMS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; PLASMA WAVES; SCHEDULING;

COMPUTATIONAL RESULTS; CONCEPT OF TIMES; CONTROLLABLE PROCESSING TIME; CONTROLLABLE PROCESSING TIMES; LINEAR PROGRAMMING MODELS; LOCAL SEARCH METHODS; MIP MODELS; MIXED-INTEGER PROGRAMMINGS; OPTIMAL SOLUTIONS; PERT/CPM; PROBLEM INSTANCES; PROCESSING TIMES; SINGLE MACHINES; SINGLE-MACHINE; TOTAL TARDINESS; TOTAL TARDINESSES; VARIABLE NEIGHBORHOOD SEARCHES;

HEURISTIC METHODS;

EID: 56549107166     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.05.009     Document Type: Article

References (32)

1. Sen T., and Gupta S.K. A state-of-art survey of static scheduling research involving due dates. OMEGA, The International Journal of Management Science 12 (1984) 63-76
2. Abdul-Razaq T.S., Potts C.N., and Van Wassenhove L.N. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Applied Mathematics 26 (1990) 235-253
3. Koulamas K. The total tardiness problem: review and extensions. Operations Research 42 (1994) 1025-1041
4. Nowicki E., and Zdrzałka S. A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics 26 (1990) 271-287
5. Wang X., and Cheng T.C.E. Single machine scheduling with resource dependent release times and processing times. European Journal of Operational Research 162 (2005) 727-739
6. Vickson R.G. Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Operations Research 28 (1980) 1155-1167
7. Vickson R.G. Two single machine sequencing problems involving controllable job processing times. AIIE Transaction 12 (1980) 258-262
8. Van Wassenhove L.N., and Baker K.R. A bicriterion approach to time/cost trade-offs in sequence. European Journal of Operational Research 11 (1982) 48-54
9. Daniels R.L., and Sarin R.K. Single machine scheduling with controllable processing times and number of jobs tardy. Operations Research 37 (1989) 981-984
10. Janiak A. General flow-shop scheduling with resource constraints. International Journal of Production Research 26 (1988) 1089-1103
11. Janiak A., and Kovalyov M.Y. Single machine scheduling subject to deadlines and resource dependent processing times. European Journal of Operational Research 94 (1996) 284-291
12. Cheng T.C.E., Chen Z.L., and Li C.L. Single-machine scheduling with trade-off between number of tardy jobs and resource allocation. Operations Research Letters 19 (1996) 237-242
13. Chen Z.L., Lu Q., and Tang G. Single machine scheduling with discretely controllable processing times. Operation Research Letters 21 (1997) 69-76
14. Shabtay D., and Kaspi M. Minimizing the total weighted flow time in a single machine with controllable processing times. Computers and Operations Research 31 (2004) 2279-2289
15. Shabtay D. Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine. Computers and Operations Research 31 (2004) 1303-1315
16. Kaspi M., and Shabtay D. A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Computers and Operations Research 33 (2006) 3015-3033
17. Shabtay D., and Steiner G. A survey of scheduling with controllable processing times. Discrete Applied Mathematics 155 (2007) 1643-1666
18. Panwalkar S.S., and Rajagopalan R. Single-machine sequencing with controllable processing times. European Journal of Operational Research 59 (1992) 298-302
19. Liman S.D., Panwalkar S.S., and Thongmee S. A single machine scheduling problem with common due window and controllable processing times. Annals of Operations Research 70 (1997) 145-154
20. Ng C.T.D., Cheng T.C.E., Kovalyov M.Y., and Lam S.S. Single machine scheduling with a variable common due date and resource-dependent processing times. Computers and Operations Research 30 (2003) 1173-1185
21. Hansen P., and Mladenović N. Variable neighborhood search: principles and applications. European Journal of Operational Research 130 (2001) 449-467
22. Du J., and Leung J.Y.T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
23. Pinedo M. Scheduling: theory, algorithm, and system. 2nd ed (2002), Prentice-Hall, New Jersey
24. Nemhauser G., and Wolsey L. Integer and combinatorial optimization (1988), Wiley, New York
25. Hillier F.S., and Lieberman G.J. Introduction to operations research. 7th ed (2001), McGraw-Hill, New York
26. Russell R.M., and Holsenback J.E. Evaluation of leading heuristics for the single machine tardiness problem. European Journal of Operational Research 96 (1997) 538-545
27. Schrage L.E. Optimization modeling with LINDO. 5th ed (1997), Brooks, Cole, California
28. Mladenović N., and Hansen P. Variable neighborhood search. Computers and Operations Research 24 (1997) 1097-1100
29. Hansen P., and Mladenović N. Variable neighborhood search for the p-Median. Location Science 5 (1997) 207-226
30. Avanthay C., Hertz A., and Zufferey N. A variable neighborhood search for graph coloring. European Journal of Operational Research 151 (2003) 379-388
31. Ben-Daya M., and Al-Fawzan M. A simulated annealing approach for the one-machine mean tardiness scheduling problem. European Journal of Operational Research 93 (1996) 61-67
32. Etiler O., Toklu B., Atak M., and Wilson J. A genetic algorithm for flow shop scheduling problems. Journal of the Operational Research Society 55 (2004) 830-835