Parallel-machine rescheduling with machine disruptions

Author: Azizoglu Meral  

Publisher: Taylor & Francis Ltd

ISSN: 0740-817X

Source: IIE Transactions, Vol.37, Iss.12, 2005-12, pp. : 1113-1118

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

In this study we consider a rescheduling problem on identical parallel machines. The rescheduling is undertaken because of a period of unavailability on one of the machines. We consider the total flow time as an efficiency measure and stability is gauged in terms of the number of jobs processed on different machines in the original and new schedules. We show that all efficient schedules with respect to efficiency and stability measures can be generated in polynomial time.