Single machine scheduling under potential disruption

Authors:
Chung-Yee Lee;Gang Yu
Affiliations:
Department of Industrial Engineering and Logistics Management, The Hong Kong University of Science and Technology, Hong Kong;Dell Inc., One Dell Way, Round Rock, TX 78682, USA
Venue:
Operations Research Letters
Year:
2007

Citing 5
Cited 3

Single machine flow-time scheduling with a single breakdown

Acta Informatica
Matchup scheduling with multiple resources, release dates and disruptions

Operations Research
Single machine flow-time scheduling with scheduled maintenance

Acta Informatica
Two Machine Scheduling under Disruptions with Transportation Considerations

Journal of Scheduling
Assessing the effects of machine breakdowns in stochastic scheduling

Operations Research Letters

A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Algorithmics of Large and Complex Networks
Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information

Operations Research
Analysis of robustness in proactive scheduling: A graphical approach

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

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.