Paper Info
Title
Valid inequalities for a time-indexed formulation
Abstract
We present a general time-indexed formulation that contains scheduling problems with unrelated parallel machines. We derive a class of basic valid inequalities for this formulation, and we show that a subset of these inequalities are facet-defining. We characterize all facet-defining inequalities with right-hand side 1. Further, we show how to efficiently separate these inequalities.
Year
DOI
Venue
2015
10.1016/j.orl.2015.02.011
Operations Research Letters
Keywords
Field
DocType
Unrelated parallel machines,Valid inequalities,Separation
Combinatorics,Mathematical optimization,Scheduling (computing),Inequality,Mathematics
Journal
Volume
Issue
ISSN
43
3
0167-6377
Citations 
PageRank 
References 
0
0.34
11
Authors
2
Name
Order
Citations
PageRank
Lotte Berghman1222.34
Frits C. R. Spieksma259158.84