1983
DOI: 10.1016/0166-218x(83)90012-4
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling subject to resource constraints: classification and complexity

Abstract: In deterministic sequencing and scheduling problems, jobs are to be processed on machines of limited capacity. We consider an extension of this class of problems, in which the jobs require the use of additional scarce resources during their execution. A classification scheme for resource constraints is proposed and the computational complexity of the extended problem class is investigated in terms of this classification. Models involving parallel machines, unit-time jobs and the maximum completion time criteri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
547
0
32

Year Published

1999
1999
2017
2017

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 1,186 publications
(579 citation statements)
references
References 7 publications
0
547
0
32
Order By: Relevance
“…The combinatorial nature of the RCPSP makes it NP-hard [2] problem. Analogously, the solution of MS-RCPSP is a feasible schedule -the one in which resource units and precedence constraints are preserved.…”
Section: Formulation Of Ms-rcpspmentioning
confidence: 99%
See 1 more Smart Citation
“…The combinatorial nature of the RCPSP makes it NP-hard [2] problem. Analogously, the solution of MS-RCPSP is a feasible schedule -the one in which resource units and precedence constraints are preserved.…”
Section: Formulation Of Ms-rcpspmentioning
confidence: 99%
“…[3][12] [8]) as extension of RCPSP [4]. It is NP-hard [2] and there is no effective algorithm to solve it. Thus, several types of (meta)heuristic methods can be effectively applied.…”
Section: Introductionmentioning
confidence: 99%
“…Methods that consider task dependencies are usually extensions of the job shop scheduling problem, which is NP-complete [40]. The Resource Constrained Project Scheduling Problem (RCPSP) is a prominent extension for which the fastest solutions use genetic algorithms and metaheuristics [41].…”
Section: Related Workmentioning
confidence: 99%
“…The Resource-Constrained Project Scheduling Problem (RCPSP, see Błazewicz, Lenstra and Kan (1983) as well as Brucker et al (1999)) provides a framework for the formalization of scheduling problems. We take it as a starting point for the description of DM problems due to the following reasons.…”
Section: The Extended Rcpspmentioning
confidence: 99%