Journal
MATHEMATICAL AND COMPUTER MODELLING
Volume 53, Issue 1-2, Pages 330-336Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.mcm.2010.08.020
Keywords
Scheduling; Single machine; Flowshop; Learning effect
Categories
Funding
- Natural Science Foundation of China [11001181, 71031002]
Ask authors/readers for more resources
In this paper, we show that the main results in a recent paper by Zhang and Yan [X. Zhang and G. Yan, Machine scheduling problems with a general learning effect. Mathematical and Computer Modelling 51(2010)84-90] are incorrect as an important reason is missing, that is, the processing time of a job is variable according to a general learning effect. Here we point out these wrong results by a counter-example. In addition, we give a revised model with a general learning effect. We show that some single machine scheduling problems are still polynomially solvable under the revised model. We also show that some special cases of the flowshop scheduling problems can be solved in polynomial time under the revised model. (C) 2010 Elsevier Ltd. All rights reserved.
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