Title of article :
Exact algorithmsforageneralizationoftheorderacceptanceandscheduling
problem inasingle-machineenvironment
Author/Authors :
Fabrice TallaNobibon، نويسنده , , RoelLeus ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
This paperstudiesageneralizationoftheorderacceptanceandschedulingprobleminasingle-machine
environmentwhereapoolconsistingoffirmplannedordersaswellaspotentialordersisavailablefrom
which anover-demandedcompanycanselect.Thecapacityavailableforprocessingtheacceptedorders
is limitedandeachorderischaracterizedbyaknownprocessingtime,deliverydate,revenueanda
weightrepresentingapenaltyperunit-timedelaybeyondthedeliverydate.Weprovethatthe
existenceofaconstant-factorapproximationalgorithmforthisproblemisunlikely.Weproposetwo
linear formulationsthataresolvedusinganIPsolverandwedevisetwoexactbranch-and-bound
proceduresabletosolveinstanceswithupto50jobswithinreasonableCPUtimes.Wecomparethe
efficiencyandqualityoftheresultsobtainedusingthedifferentsolutionapproaches.
Keywords :
Firm planned orders , Scheduling , Order acceptance , Single machine , branch-and-bound , Integer programming
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
