A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups

Journal of the Operational Research Society

Volumn 47, Issue 10, 1996, Pages 1247-1261

  Lee, Hochang ^a   Guignard, Monique ^b  

^a Kyung Hee University   (South Korea)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Lagrangean decomposition; Lagrangean relaxation; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HYBRID COMPUTERS; MANUFACTURING DATA PROCESSING; OPERATIONS RESEARCH; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

HYBRID APPROXIMATION; HYBRID BOUNDING PROCEDURE; LAGRANGEAN DECOMPOSITION; LAGRANGEAN RELAXATION; OPTIMAL MAKESPAN VALUE; PARALLEL UNRELATED MACHINES; WORKLOAD ALLOCATION PROBLEM;

RESOURCE ALLOCATION;

EID: 0030269395     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.152     Document Type: Article

References (19)

1. A. Balakrishnan (1989) Preemptive scheduling of hybrid parallel machines. Opns Res. 37, 301-313.
2. T. Gonzales and S. Sahni (1978) Preemptive scheduling of uniform processor systems. J. Assoc. Comput. Mach. 25, 92-101.
3. E. Horvath, S. Lam and R. Sethi (1977) A level algorithm for preemptive scheduling. J. Assoc. Comput. Mach. 24, 32-43.
4. E. L. Lawler and C. U. Martel (1989) Preemptive scheduling of two uniform machines to ^minimize the number of late jobs. Opns Res. 37, 314-318.
5. J. W. S. Liu and A. Yang (1974) Optimal scheduling of independent tasks on heterogeneous computing systems. In Proceedings ACM Annual Conference, pp 38-45. Association for Computing Machinery, New York.
6. C. Martel (1982) Scheduling uniform machines with release times, deadlines and due dates. J. Assoc. Comput. Mach. 29, 812-829.
7. J. D. Ullman (1976), Complexity of scheduling problems. In Computer and Job/Shop Scheduling Theory. (E. G. Coffman, Ed.) pp 139-164. Wiley, New York.
8. B. L. Dietrich (1989) A two phase heuristic for scheduling on parallel unrelated machines with set-ups. In Flexible Manufacturing Systems. (K. E. Stecke and R. Suri, Ed.) pp 187-192. Elsevier Science, Amsterdam.
9. B. L. Dietrich and L. F. Escudero (1989) On solving a 0-1 model for workload allocation on parallel unrelated machines with set-ups. IBM Research Report, T. J. Watson Research Center, Yorktown Heights, New York.
10. B. L. Dietrich and L. F. Escudero (1989) On strengthening the formulation of the workload allocation problem for parallel unrelated machines with set-ups. IBM Research Report, T. J. Watson Research Center, Yorktown Heights, New York.
11. B. L. Dietrich and L. F. Escudero (1993) On modelling the maximum workload allocation for parallel unrelated machines with set-ups. Ann. of Opns Res. 43, 359-377.
12. J. Krarup and P. M. Pruzan (1983) The simple plant location problem: survey and synthesis. Eur. J. Opl Res. 12, 36-81.
13. M. Guignard and S. Kim (1987) Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Math. Prog. 39, 215-228.
14. M. Held, P. Wolfe and H. D. Crowder (1974) Validation of subgradient optimization. Math. Prog. 6, 62-88.
15. D. Erlenkotter (1978) A dual based procedure for uncapacitated facility location. Opns Res. 26, 992-1009.
16. P. M. Camerini, L. Fratta and F. Maffioli (1975) On improving relaxation methods by modified gradient techniques. Math. Prog. Study 3, 26-34.
17. M. Guignard and M. Rosenwein (1989) An application-oriented guide for designing Lagrangean dual ascent algorithms. Eur. J. Opl Res. 43,197-205.
18. D. Fayard and G. Plateau (1982) An algorithm for the solution of the 0-1 knapsack problem. Computing 28, 269- 287.
19. J. J. Dongarra (1990) Performance of various computers using standard linear equations software. CS-89-85, Computer Science Dept., University of Tennessee.