An analysis of heuristics for the parallel-machine flexible-resource scheduling problem

Annals of Operations Research

Volumn 70, Issue , 1997, Pages 439-472

  Daniels, Richard L ^a   Hoopes, Barbara J ^b   Mazzola, Joseph B ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b PAMPLIN COLLEGE OF BUSINESS   (United States)

^c DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031527551     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018946810121     Document Type: Article

References (28)

1. I. Adiri and Z. Yehudai, Scheduling on machines with variable service rates, Computers and Operations Research 14(1987)289-297.
2. R. Ahmadi and U. Bagchi, Scheduling multi-job customer orders in multi-machine environments, Working Paper, University of California, Los Angeles, 1992.
3. J.W. Barnes and M. Laguna, A tabu search experience in production scheduling, Annals of Operations Research 41(1993)141-156.
4. J.W. Barnes and M. Laguna, Solving the multiple-machine weighted flow time problem using tabu search, HE Transactions 25(1993)121-128.
5. J. Blazewicz, J.K. Lenstra and A.H.G. Rinooy Kan, Scheduling subject to resource constraints: Classification and complexity, Discrete Applied Mathematics 5(1983)11-24.
6. T.C.E. Cheng and C.C.S. Sin, A state-of-the-art review of parallel-machine scheduling research, European Journal of Operational Research 47(1990)271-292.
7. R.L. Daniels, Resource allocation and multi-project scheduling, in: Advances in Project Scheduling, R. Slowinski and J. Weglarz, eds., Elsevier, Amsterdam, 1989.
8. R.L. Daniels, B.J. Hoopes and J.B. Mazzola, Scheduling parallel manufacturing cells with resource flexibility, Management Science 42(1996)1260-1276.
9. R.L. Daniels and J.B. Mazzola, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, Annals of Operations Research 41(1993)207-230.
10. R.L. Daniels and J.B. Mazzola, Flow shop scheduling with resource flexibility, Operations Research 42(1994)504-522.
11. R.L. Daniels and R.K. Sarin, Single machine scheduling with controllable processing times and number of jobs tardy, Operations Research 37(1989)981-984.
12. G. Dobson and U.S. Karmarkar, Simultaneous resource scheduling to minimize weighted flow times, Operations Research 37(1989)592-600.
13. 31 - 1, SIAM Journal on Scientific and Statistical Computation, 7(1986)24-45.
14. M.R. Garey and D.S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM Journal of Computing 4(1975)397-411.
15. F. Glover, Tabu search - Part I, ORSA Journal on Computing 1(1989)190-206.
16. F. Glover, Tabu Search - Part II, ORSA Journal on Computing 2(1990)4-32.
17. F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Annals of Operations Research 41(1993)3-28.
18. A.M.A. Hariri and C.N. Potts, Heuristics for scheduling unrelated parallel machines, Computers and Operations Research 18(1991)323-331.
19. S.R. Lawrence and T.E. Morton, Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics, European Journal of Operational Research 64(1993)168-187.
20. S.S. Panwalker and R. Rajagopalan, Single-machine sequencing with controllable processing times, European Journal of Operational Research 59(1992)298-302.
21. J. Skorin-Kapov and A.J. Vakharia, Scheduling a flow-line manufacturing cell: A tabu search approach, International Journal of Production Research 31(1993)1721-1734.
22. R. Slowinski and J. Weglarz, Solving the general project scheduling problem with multiple constrained resources by mathematical programming, Lecture Notes in Control and Information Systems 7(1978)278-289.
23. E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research 47(1990)65-74.
24. E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Comp. 17(1991) 443-455.
25. F.B. Talbot, Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case, Management Science 28(1982)1197-1210.
26. M.A. Trick, Scheduling multiple variable-speed machines, Operations Research 42(1994)234-248.
27. R.G. Vickson, Choosing the job sequence and processing times to minimize processing plus flow cost on a single machine, Operations Research 28(1980)1155-1167.
28. R.G. Vickson, Two single-machine sequencing problems involving controllable job processing times, AIEE Transactions 12(1980),258-262.