On the strength of time-indexed formulations for the resource-constrained project scheduling problem
type: Item
instance of: scholarly article
title: On the strength of time-indexed formulations for the resource-constrained project scheduling problem
zbMATH Open document ID: 1409.90085
author: Christian Artigues
published in: Operations Research Letters
publication date: 2019-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7027507
zbMATH Keywords: resource-constrained project scheduling
zbMATH Keywords: the linear programming
zbMATH Keywords: time-indexed variables
zbMATH Keywords: on/off variables
zbMATH Keywords: relaxation strength
zbMATH Keywords: non-singular transformations
MaRDI profile type: Publication
full work available at URL: j.orl.2017.02.001
OpenAlex ID: W2587456227
cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
cites work: Project scheduling. A research handbook.
cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program
cites work: Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
cites work: Scheduling of resource-constrained projects
cites work: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
cites work: On project scheduling with irregular starting time costs
cites work: A time indexed formulation of non-preemptive single machine scheduling problems
DOI: 10.1016/J.ORL.2017.02.001
description: scientific article; zbMATH DE number 7027507