Title of article
A familyofinequalitiesvalidfortherobustsinglemachine schedulingpolyhedron
Author/Authors
Ismael RegisdeFariasJR، نويسنده , , HongxiaZhao، نويسنده , , MingZhao ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
5
From page
1610
To page
1614
Abstract
We considertheproblemofsequencingasetofjobsinasinglemachinetominimizethemaximumof
the totalweightedcompletiontimeofthejobsoveranumberofscenarios,eachcorrespondingtoaset
of jobprocessingtimes.Wegivealargefamilyofinequalitiesthatarevalidfortheconvexhulloftheset
of feasibleschedules.Wethenpresentcomputationalexperienceinwhichsomeoftheinequalitiesare
added totheoriginalformulation.Wedemonstratethroughthecomputationalresultsthattheir
additiontotheformulationcansubstantiallyimprove,amongotherthings,thetimerequiredtosolve
difficultinstancesoftheproblemthroughbranch-and-cut.
Keywords
Single machine scheduling , Mixed-integer programming , Robust optimization , Branch-and-cut
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927768
Link To Document