Single machine scheduling under potential disruption

Single machine scheduling under potential disruption

0.00 Avg rating0 Votes
Article ID: iaor20083057
Country: Netherlands
Volume: 35
Issue: 4
Start Page Number: 541
End Page Number: 548
Publication Date: Jul 2007
Journal: Operations Research Letters
Authors: ,
Abstract:

We provide optimal algorithms to solve a new scheduling problem in which there is a possibility that a disruption will happen at a particular time and last for a period of time with a certain probability. The objective functions are the expected total weighted completion times and the expected maximum tardiness, respectively.

Reviews

Required fields are marked *. Your email address will not be published.