Minimizing makespan in a multimode multiprocessor shop scheduling problem

Naval Research Logistics

Volumn 46, Issue 8, 1999, Pages 893-911

  Bianco, Lucio ^a   Dell'Olmo, Paolo ^b   Giordani, Stefano ^a   Speranza, Maria Grazia ^c  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF BRESCIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS;

DEDICATED PROCESSORS; HEURISTIC ALGORITHMS; LOWER BOUNDS; MULTIPLE MODES; SHOP SCHEDULING;

SCHEDULING;

EID: 0033328681     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199912)46:8<893::AID-NAV2>3.0.CO;2-7     Document Type: Article

References (19)

1. L. Babel, Finding maximum cliques in arbitrary and special graphs, Computing, 46 (1991), 321-341.
2. L. Bianco, P. Dell'Olmo, and M.G. Speranza, Nonpreemptive scheduling of independent tasks with prespecified processor allocations, Nav Res Logistics 41 (1994), 959-971.
3. L. Bianco, P. Dell'Olmo, and M.G. Speranza, Scheduling independent tasks with multiple modes, Discrete Appl Math 62 (1995), 35-50.
4. L. Bianco, P. Dell'Olmo, and M.G. Speranza, "Scheduling independent tasks with multiple shared resources," Optimization in industry 3, A. Sciomachen (Editor), Wiley, New York, 1995, 35-53.
5. L. Bianco, P. Dell'Olmo, and M.G. Speranza, Heuristics for multimode scheduling problems with dedicated resources, Eur J Oper Res 107 (1998), 260-271.
6. J. Błazewicz, K. Ecker, E. Pesch, G. Schmidt, and J. Wȩglarz. Scheduling computers and manufacturing processes, Springer-Verlag, Berlin, 1996.
7. F.F. Boctor, Heuristics for scheduling projects with resources restrictions and several resource-durations modes, Int J Prod Res 31 (1993), 2547-2558.
8. A. Drexl, Scheduling of project networks by job assignment, Manage Sci 37 (1991), 1590-1602.
9. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
10. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.G.H. Rinnooy Kan, Optimization and approximation in deterministic scheduling: A survey, Ann Discrete Math 5 (1979), 287-326.
11. R. Kolish, Project scheduling under resources constraints - efficient heuristic for some problem classes, Physica-Verlag, Heidelberg, 1995.
12. P. Serafini and M.G. Speranza, A decomposition approach for a resource constrained scheduling problem, Eur J Oper Res 75 (1993), 112-135.
13. M.G. Speranza and C. Vercellis, Hierarchical models for multi-project planning and scheduling, Eur J Oper Res 64 (1993), 312-325.
14. A. Sprecher, "Resource-constrained project scheduling: Exact methods for the multi-mode case," Lecture notes in economics and mathematical systems, 409, Springer-Verlag, Berlin, 1993.
15. J.P. Stinson, E.W. Davis, and B.M. Khumawala, Multiple resource-constrained scheduling using branch and bound, AIIE Trans 10 (1978), 252-259.
16. F.B. Talbot, Resource-constrained project scheduling with time-resource trade-offs: The nonpreemptive case, Manage Sci 28 (1982), 1197-1210.
17. B. Veltman, Multiprocessor scheduling with communication delays, Ph.D. thesis, Technische Universiteit Eindhoven, 1993.
18. J. Wȩglarz, Project scheduling with discrete and continuously divisible resources, IEEE Trans Syst Man Cybernet 9 (1979), 664-650.
19. J. Wȩglarz, On certain models of resources allocation problems, Kybernetics 9 (1980), 61-66.