Showing 1 - 10 of 179,195
NP-completeness and other complexity proofs often merely State that the problem at hand is a generalization of some other intractable problem. This proof technique relies on the widely accepted assumption that complexity results hold regardless of the model formulation used to represent the...
Persistent link: https://www.econbiz.de/10011744028
In this paper we present a heuristic methodology for solving resource-constrained project scheduling problems with renewable and spatial resources. We especially concentrate on spatial resources that are encountered in construction projects, but our analysis can easily be generalized to other...
Persistent link: https://www.econbiz.de/10012725657
Persistent link: https://www.econbiz.de/10012228983
This paper addresses methods for formulating and solving a general class of nonpreemptive resource-constrained project scheduling problems in which job durations are discrete functions of committed renewable, nonrenewable and doubly-constrained resources (multi-mode time resource tradeoff). We...
Persistent link: https://www.econbiz.de/10011745969
In our paper, we analyze new exact approaches for the multi-mode resource-constrained project scheduling (MRCPSP) problem with the aim of makespan minimization. For the single-mode RCPSP (SRCPSP) recent exact algorithms combine a Branch and Bound algorithm with principles from Constraint...
Persistent link: https://www.econbiz.de/10011822834
Project scheduling is one of the core elements of project management, which is essential for engineering-to-order manufacturing companies to improve productivity, reduce costs and shorten project finish time. This paper explores the multi-mode project scheduling problem under resource and finish...
Persistent link: https://www.econbiz.de/10014261061
Persistent link: https://www.econbiz.de/10014265740
We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high volume, discrete make-to-order products. Based on a list scheduling procedure which has...
Persistent link: https://www.econbiz.de/10011737305
Complexity proofs often restrict themselves to stating that the problem at hand is a generalization of some other intractable problem, This proof technique relies on the widely accepted assumptions that complexity results hold regardless of the model formulation used to represent the problem and...
Persistent link: https://www.econbiz.de/10011744026
Persistent link: https://www.econbiz.de/10013185176