A pairwise interchange algorithm for parallel machine scheduling

Production Planning and Control

Volumn 9, Issue 7, 1998, Pages 685-689

  Fatemi Ghomi, S M T F ^a   Ghazvini, F Jolai ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b GRENOBLE INSTITUTE OF TECHNOLOGY   (France)

Author keywords

Heuristics; Makespan; Parallel machines; Scheduling

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING; PROCESS CONTROL; SCHEDULING; STRATEGIC PLANNING;

PAIRWISE INTERCHANGE ALGORITHM; PARALLEL MACHINE SCHEDULING;

PRODUCTION CONTROL;

EID: 0032183061     PISSN: 09537287     EISSN: 13665871     Source Type: Journal    
DOI: 10.1080/095372898233687     Document Type: Article

References (10)

1. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (New York: John Wiley).
2. Coffman, E. G., 1976, Computer and J ob Shop Scheduling (New York: John Wiley).
3. Fisher, M L., 1973a, Optimal solution of scheduling problems using Lagrangian multipliers: Part I. Operations Research, 21, 1114-1127.
4. Fisher, M L., 1973b, Optimal solution of scheduling problems using Lagrangian multipliers: Part II. In S. E. Elmaghraby (ed.) Symposium on the T heory of Scheduling and its Applications, Berlin (Springer) pp. 294-318.
5. Garey, M R., Graham, R. L., and Johnson, D. S., 1978, Performanceguarantees for scheduling algorithms. Operations Research, 26, 3-21.
6. Garey, M R., and Johnson, D. S., 1979, Computer and Intractability: A Guide to the T heory of NP-Completeness (San Francisco: Freeman).
7. Graham, R. L., 1969, Bounds on multiprocessing anomalies. SIAM J ournal of Applied M athematics, 17, 416-429.
8. McNaughton, R., 1969, Scheduling with deadlines and loss functions. Management Science, 6, 1-12.
9. Sahni, S., 1976, Algorithms for scheduling independent tasks. Journal of A CM, 23, 116-137.
10. Sahni, S., 1977, General techniques for combinatorial approximations. Operations Research, 23, 920-936.