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.
|Original language||English (US)|
|Number of pages||6|
|Journal||IIE Transactions (Institute of Industrial Engineers)|
|State||Published - Dec 1 2005|
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering