Article ID Journal Published Year Pages File Type
1135228 Computers & Industrial Engineering 2010 4 Pages PDF
Abstract

This paper considers some scheduling problems with deteriorating jobs and learning effects. The following objective functions are considered: the makespan, the total completion times, and the total absolute differences in completion times. Several polynomial time algorithms are proposed to optimally solve the single-machine scheduling problems. Finally, we show that several special cases of the flowshop scheduling problems remain polynomially solvable under the proposed model.

Related Topics
Physical Sciences and Engineering Engineering Industrial and Manufacturing Engineering
Authors
, ,