An effective heuristic for minimising makespan on unrelated parallel machines

Journal of the Operational Research Society

Volumn 49, Issue 8, 1998, Pages 886-894

  Srivastava, B ^a  

^a MARQUETTE UNIVERSITY   (United States)

Author keywords

Heuristics; Scheduling; Tabu search; Unrelated machines

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LINEAR PROGRAMMING; OPTIMIZATION; SCHEDULING;

LIST SCHEDULING ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0032140746     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600547     Document Type: Article

References (26)

1. Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Math 5: 287-326.
2. Lawler EL, Lenstra JK, Rinnooy Kan AGH and Shmoys DB (1993). Sequencing and scheduling: algorithms and complexity. In: Graves SC (ed). Handbooks in Operations Research and Management Science. North-Holland: Amsterdam, pp 445-522.
3. van de Velde SL (1991). Machine scheduling and Lagrangian relaxation, PhD thesis. CWI: Amsterdam.
4. Lenstra JK, Shmoys DB and Tardos E (1990). Approximation algorithms for scheduling unrelated parallel machines. Math Prog 46: 259-271.
5. Ibarra OH and Kim CE (1977). Heuristic algorithms for scheduling independent tasks on nonidentical processors. J of Association of Computing Machinery 24: 280-289.
6. Spinrad J (1985). Worst case analysis of a scheduling algorithm. Opns Res Lett 4: 9-11.
7. De P and Morton TE (1980). Scheduling to minimize makespan on unequal parallel processors. Decis Sci 11: 586-603.
8. Davis D and Jaffe JM (1981). Algorithms for scheduling tasks on unrelated processors. J Association of Computing Machinery 28: 721-736.
9. Horowitz E and Sahni S (1976). Exact and approximate algorithms for scheduling nonidentical processors. J Association of Computing Machinery 23: 317-327.
10. Hariri AMA and Potts CN (1991). Heuristics for scheduling unrelated parallel machines. Computers and Opns Res 18: 323-331.
11. Potts CN (1985). Analysis of linear programming heuristic for scheduling unrelated machines. Discrete Applied Math 10: 155-164.
12. van de Velde SL (1993). Duality-based algorithms for scheduling unrelated parallel machines. ORSA J Computing 5: 192-205.
13. Glover F (1989). Tabu search, Part I. ORSA J Computing 1: 190-206.
14. Glover F (1990). Tabu search, Part II. ORSA J Computing 2: 432.
15. Malek M, Guruswamy M, Owens H and Pandya M (1989). Serial and parallel search techniques for the traveling salesman problem: theory and applications. Annals of Opns Res 21: 2651.
16. Skorin-Kapov J (1994). Extensions of a tabu search adaptation to the quadratic assignment problem. Computers and Opns Res 21: 855-865.
17. Taillard E (1991). Robust tabu search for the quadratic assignment problem. Parallel Computing 17: 443-455.
18. Kuik R, Salomon M and Van Wassenhove L (1993). Linear programming, simulated annealing and tabu search heuristics for lotsizing in bottleneck assembly systems. IIE Trans 25: 62-73.
19. Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for vehicle routing problem. MgmtSci 40: 1276-1290.
20. Laguna M and Glover F (1993). Bandwidth packing: a tabu search approach. Mgmt Sci 39: 492-500.
21. Srivastava B and Chen W-H (1993). Part type selection in flexible manufacturing systems: tabu search algorithms. Annals of Opns Res 41: 279-297.
22. Barnes JW and Laguna M (1993). Solving the multiple- machine weighted flow time problem using tabu search. IIE Trans 25: 121-128.
23. Hubscher R and Glover F (1994). Applying tabu search with influential diversification to multiprocessor scheduling. Computers and Opns Res 21: 877-884.
24. Laguna M and Glover F (1993). Integrating target analysis and tabu search for improved scheduling systems. Expert Systems with Applications 3: 287-298.
25. Woodruff DL and Zemel E (1993). Hashing vectors for tabu search. Annals of Opns Res 41: 123-140.
26. Horowitz E and Sahni S (1978). Fundamentals of Computer Algorithms. Computer Science Press: Rockville, Maryland.