An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem |
| |
| Affiliation: | 1. Marriott International, Bethesda MD, USA;2. Lehigh University, Bethlehem PA, USA;1. Department of Chemistry, Innovative Drug Research Center, Shanghai University, Shanghai 200444, PR China;2. State Key Laboratory of Organometallic Chemistry, Shanghai Institute of Organic Chemistry, Chinese Academy of Sciences, Shanghai 200032, PR China;3. Key Laboratory of Organofluorine Chemistry, Shanghai Institute of Organic Chemistry, Chinese Academy of Sciences, Shanghai 200032, PR China;4. Laboratory for Microstructures, Instrumental Analysis and Research Center of Shanghai University, Shanghai 200444, PR China;1. Institut für Statistik und Operations Research, Universität Graz, Universitätsstraße 15, A-8010 Graz, Austria;2. Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA 94720, USA;3. Department of Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London SE10 9LS, UK |
| |
| Abstract: | ![]()
In this paper a branch-and-bound procedure is described for scheduling project activities subject to precedence and resource constraints, where activities can be preempted at any discrete time instant and where the objective is to minimize the project duration. The procedure is based on a depth-first solution strategy in which nodes in the solution tree represent resource and precedence feasible partial schedules. Branches emanating from a parent node correspond to exhaustive and minimal combinations of activities, the delay of which resolves resource conflicts at each parent node. A precedence based lower bound and several dominance rules are introduced in order to restrict the growth of the solutions tree. The solution procedure has been programmed in the C language and extensive computational experience is reported. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
