Scheduling under Labour Resource Constraints

Authors:
Susanne Heipcke;Yves Colombani;Cristina C. B. Cavalcante;Cid C. de Souza
Affiliations:
Dash Associates Ltd., Quinton Lodge, Binswood Avenue, Leamington Spa CV32 5TH, U.K.;Dash Associates Ltd., Quinton Lodge, Binswood Avenue, Leamington Spa CV32 5TH, U.K.;ILOG SA, 9, rue de Verdun, BP 85, F-94253 Gentilly Cedex, France;Instituto de Computacão, Universidade Estadual de Campinas—UNICAMP, Caixa Postal 6176, 13081-970 Campinas—SP, Brasil
Venue:
Constraints
Year:
2000

Citing 4
Cited 1

Scheduling project networks with resource constraints and time windows

Annals of Operations Research
Characterization and generation of a general class of resource-constrained project scheduling problems

Management Science
Scheduling projects with labor constraints

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Solving Project Scheduling Problems by Minimum Cut Computations

Management Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introducean optimisation problem extracted from an industrial application:the scheduling problem under labour constraints. After givinga short summary of the origins of this problem and its mathematicalformulation, the different methods used for solving it (at leastpartially) are briefly described. In the last part, we presenta set of 25 instances of different sizes for benchmark purposes.So far, only 5 of these test instances have been solved to optimality,the others remaining open.