Single-facility resource allocation under capacity-based economies and diseconomies of scope
Article Abstract:
The problem of optimal resource allocation in a single-facility production environment with capacity-based economies and diseconomies is considered. The resulting model, SCOPE, is a generalization of the 0-1 collapsing knapsack problem. It characterizes capacity-based economies and diseconomies as being determined by the number of tasks assigned to the facility. An allocation model, GENCAP, is also developed, which generalizes SCOPE and models nonlinear capacity interaction as dependent on the specific set of jobs loaded into the facility. Tabu-search heuristics and branch-and-bound algorithms are formulated to solve the two problems. Extensive computational testing shows the effectiveness of both solution procedures. The analysis also demonstrates the tractability of problems with nonlinear capacity behavior.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
New benchmark results for the resource-constrained project scheduling problem
Article Abstract:
A revision and extension of the efficient depth-first branch-and-bound procedure developed by Demeulemeester and Herroelen (1992) to address the resource-constrained project scheduling problem (RCPSP) was conducted. This new DH-procedure makes use of the advances in 32-bit programming found in Microsoft Visual C++ 2.0 compilers under Windows NT 3.50. The new code increased speed by a factor of approximately three on the 110 Patterson problems and, more significantly, facilitated the optimal solution of the 480 Kolisch, Sprecher and Drexl (KSD) instances. This proved that the actual bottleneck was occurring in addressable computer memory. In addition, it allowed for the solution of the remaining problem of KSD 291 within three hours of computation time. These represent a fresh benchmark for the RCPSP.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
Scheduling of project networks by job assignment
Article Abstract:
The project management problem of the cost-effective allocation of sparse resources to the different jobs making up the project is examined. This time-resource-cost-tradeoff problem is studied using a combination of brand and bound/dynamic programming algorithm, together with the Monte Carlo stochastic scheduling technique. Computational results are discussed.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1991
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Diversification and performance: critical review and future directions. A cognitive model of CEO dismissal: understanding the influence of board perceptions, attributions and efficacy beliefs
- Abstracts: Demand signalling under unobservable effort in franchising: linear and nonlinear price contracts. Multiple market entry, cost signalling and entry deterrence