Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 58, Issue 1, Pages 25-28Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2009.06.016
Keywords
Scheduling; Single machine; Deteriorating jobs; Learning effects; Flowshop; Polynomial time algorithm
Funding
- National Science Council of Taiwan, Republic of China [NSC-97-2221-E150-056-MY2]
Ask authors/readers for more resources
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. (C) 2009 Published by Elsevier Ltd.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available