A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates

Computers and Operations Research

Volumn 37, Issue 11, 2010, Pages 1924-1938

  Xu, Kailiang ^a   Feng, Zuren ^a   Jun, Keliang ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Convex resource consumption function; Single machine scheduling; Tabu search

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; COMMON RESOURCES; COMPUTATIONAL RESULTS; COMPUTATIONAL TIME; CONTROLLABLE PROCESSING TIME; CONVEX RESOURCE CONSUMPTION FUNCTION; DUE DATES; NEAR-OPTIMAL SOLUTIONS; NON-LINEAR; OPTIMAL PROCESSING; OPTIMAL RESOURCE ALLOCATION; PROCESSING TIME; PRODUCTION SYSTEM; REAL-WORLD; RELEASE DATE; RESOURCE CONSUMPTION; SCHEDULING JOBS; SEARCH ALGORITHMS; SINGLE MACHINES; SINGLE-MACHINE SCHEDULING; STRONGLY NP-HARD; TWO LAYERS;

COMPUTER RESOURCE MANAGEMENT; ECONOMICS; LEARNING ALGORITHMS; LINEAR PROGRAMMING; MACHINERY; STRUCTURED PROGRAMMING; TABU SEARCH;

SCHEDULING ALGORITHMS;

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

References (23)

1. Lee C.Y., and Lei L. Multiple-project scheduling with controllable project duration and hard resource constraint: some solvable cases. Annals of Operations Research 102 (2001) 287-307
2. Wisner J.D., and Siferd S.P. A survey of US manufacturing practices in make-to-order machine shops. Production and Inventory Management Journal 1 (1995) 1-7
3. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
4. Janiak A. One-machine scheduling problems with resource constraints. In: Lecture notes in control and information sciences, vol. 84 1986. p. 358-64.
5. Janiak A. Minimization of the blooming mill standstills-mathematical model, suboptimal algorithms. Mechanika 8 2 (1989) 37-49
6. Janiak A. Single machine scheduling problem with common deadline and resource dependent release dates. European Journal of Operational Research 53 (1991) 317-325
7. Monma C.L., Schrijver A., Todd M.J., and Wei V.K. Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions. Mathematics of Operations Research 15 4 (1990) 736-748
8. Kaspi M., and Shabtay D. Convex resource allocation for minimizing the makespan in a single machine with job release dates. Computers and Operations Research 31 9 (2004) 1481-1489
9. Shabtay D. Single and a two-resource allocation algorithms for minimizing the maximal lateness in a single machine-scheduling problem. Computers and Operations Research 31 8 (2004) 1303-1315
10. Shabtay D., and Kaspi M. Minimizing the total weighted flow time in a single machine with controllable processing times. Computers and Operations Research 31 13 (2004) 2279-2280
11. Shabtay D., and Kaspi M. Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research 173 1 (2006) 92-107
12. Shabtay D., and Kaspi M. Minimizing the makespan in open-shop scheduling problem with a convex resource-dependent processing times. Naval Research Logistics 3 3 (2006) 204-216
13. Shabtay D., and Steiner G. A survey of scheduling with controllable processing times. Discrete Applied Mathematics 155 13 (2007) 1643-1666
14. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Computational complexity of discrete optimization problems. Annals of Discrete Mathematics 1 (1977) 343-362
15. Zdrzalka S. Scheduling jobs on a single machine with release dates, delivery times, and controllable processing times. Operations Research Letters 10 (1991) 519-532
16. Biskup D., and Cheng T.C.E. Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties. Engineering Optimization 31 3 (1999) 329-336
17. Xu K, Feng Z. A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates. Annals of Operations Research, in review
18. Glover F. Tabu search: a tutorial. Interfaces 20 4 (1990) 665-679
19. Dell'Amico M., and Trubian M. Applying tabu-search to the job shop scheduling problems. Annals of Operations Research 22 (1991) 231-252
20. Bilge U., Kirac F., Kurtulan M., and Pekgun P. A tabu search algorithm for parallel machine total tardiness problem. Computers and Operational Research 31 3 (2004) 397-414
21. Yedidsion L., Shabtay D., and Kaspi M. A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. Journal of scheduling 10 6 (2007) 341-352
22. Potts C.N. Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research 28 6 (1980) 1436-1441
23. McMahon G.B., and Florian M. On scheduling with ready times and due dates to minimize maximum lateness. Operations Research 23 3 (1975) 475-482