Heuristics for multimode scheduling problems with dedicated resources

European Journal of Operational Research

Volumn 107, Issue 2, 1998, Pages 260-271

  Bianco, L ^a   Dell'Olmo, P ^a   Speranza, M Grazia ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b UNIVERSITY OF BRESCIA   (Italy)

Author keywords

Dedicated resources; Heuristic algorithms; Multiple modes; Project scheduling

Indexed keywords

ALGORITHMS; BUDGET CONTROL; COMPUTATIONAL METHODS; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEMS (RCPSP);

PRODUCTION ENGINEERING;

EID: 0032099144     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00347-0     Document Type: Article

References (20)

1. Blazewicz, J., Cellary, W., Slowinski, R., Weglarz, J., 1986. Scheduling under Resource Constraints: Deterministic Models. Baltzer, Basel.
2. Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J., 1996. Scheduling Computer and Manufacturing. Springer, Berlin.
3. Bianco, L., Dell'Olmo, P., Speranza, M.G., 1994. Nonpreemptive scheduling of independent tasks with prespecified processors allocation. Naval Research Logistics 41, 959-971.
4. Bianco, L., Dell'Olmo, P., Speranza, M.G., 1995a. Scheduling independent tasks with multiple modes. Discrete Applied Mathematics 62, 35-50.
5. Bianco, L., Dell'Olmo, P., Speranza, M.G., 1995b. Scheduling independent tasks with multiple shared resources. In: A. Shomachen (Ed.), Optimization in Industry, vol. 3. Wiley, New York.
6. Boctor, F.F., 1993. Heuristics for scheduling projects with resources restrictions and several resource-durations modes. Int. J. Prod. Res. 31, 2547-2558.
7. Demeulemeester, E., 1995. Minimizing resources availability costs in time limited project networks. Management Science 41, 1590-1598.
8. Drexl, A., 1991. Scheduling of projects networks by job assignment. Management Science 37, 1590-1602.
9. Kolisch, R., 1995. Project Scheduling under Resources Constraints - Efficient Heuristic for Several Problem Classes. Physica, Heidelberg.
10. Kolisch, R., Sprecher, A., Drexl, A., 1995. Characterization and generation of resource-constrained project scheduling problems. Management Science 41, 1693-1703.
11. Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A guide to the Theory of NP-completeness. Freeman, San Francisco, CA.
12. Golumbic, M.C., 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
13. Möhring, R.H., 1984. Minimizing costs of resource requirements in project networks subject to a fixed completion time. Operations Research 32, 89-120.
14. Serafini, P., Speranza, M.G., 1993. A decomposition approach for a resource constrained scheduling problem. European Journal of Operational Research 75, 112-135.
15. Slowinski, R., Weglarz, J. (Eds.), 1989. Advances in Project Scheduling. Elsevier, Amsterdam.
16. Speranza, M.G., Vercellis, C., 1993. Hierarchical models for multi-project planning and scheduling. European Journal of Operational Research 64, 312-325.
17. Sprecher, A., 1994. Resource-constrained project scheduling. In: Lecture Notes in Economics and Mathematical Systems, vol. 409, Springer, Berlin, 1994.
18. Talbot, F.B., 1982. Resource-constrained project scheduling with time-resource trade-offs: The nonpreemptive case. Management Science 28, 1197-1210.
19. Weglarz, J., 1979. Project scheduling with discrete and continuously divisible resources. IEEE Transactions on Systems, Man, and Cybernetics 9, 650-664.
20. Weglarz, J., 1980. On certain models of resources allocation problems. Kybernetica 9, 61-66.