Journal
OPERATIONS RESEARCH LETTERS
Volume 45, Issue 2, Pages 154-159Publisher
ELSEVIER
DOI: 10.1016/j.orl.2017.02.001
Keywords
Resource-constrained project scheduling; The linear programming; Time-indexed variables; On/off variables; Relaxation strength; Non-singular transformations
Categories
Ask authors/readers for more resources
For non-preemptive scheduling, time-indexed zero-one linear programming formulations have been deeply analyzed. This note clarifies the current knowledge about the strength of these formulations and shows that some formulations that have been proposed new in the literature are in fact weaker or equivalent to those already known. Much of the arguments used follow from a Ph.D. thesis by Sousa, which has been largely overlooked in the literature. (C) 2017 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available