Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1033443 | Omega | 2006 | 10 Pages |
Abstract
This paper addresses no-wait or no-idle flow shop scheduling problems with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting time. A simple linear deterioration function is assumed and some dominating relationships between machines can be satisfied. It is shown that for the problems to minimize makespan or weighted sum of completion time, polynomial algorithms still exist, although these problems are more complicated than the classical ones. When the objective is to minimize maximum lateness or maximum tardiness, the solutions of a classical version may not hold.
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Strategy and Management
Authors
Ji-Bo Wang, Zun-Quan Xia,