Parallel-machine scheduling under potential disruption

Parallel-machine scheduling under potential disruption

0.00 Avg rating0 Votes
Article ID: iaor2009273
Country: Germany
Volume: 2
Issue: 1
Start Page Number: 27
End Page Number: 37
Publication Date: Jan 2008
Journal: Optimization Letters
Authors: ,
Abstract:

In this paper, we study a parallel-machine scheduling problem that arises in a disruptive environment. Such a problem deals with a situation when there is a possibility that a disruption will occur at a particular time and if it happens all machines will become unavailable for certain duration with a certain probability. Our goal is to schedule the jobs so that the expected sum of weighted completion times is minimized. We provide pseudo-polynomial time algorithms to solve the problem to optimality.

Reviews

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