Journal
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING
Volume 7, Issue 3, Pages 350-369Publisher
INDERSCIENCE ENTERPRISES LTD
DOI: 10.1504/EJIE.2013.054135
Keywords
scheduling; learning effect; group scheduling
Funding
- Natural Science Foundation for Young Scholars of Jiangxi, China [2010GQS0003]
- Science Foundation of Education Committee for Young Scholars of Jiangxi, China [GJJ11143]
- NSC [NSC 99-2221-E-035 -057-MY3]
Ask authors/readers for more resources
This paper investigates some single-machine scheduling problems with a general learning effect and the group technology assumption. A setup time is incurred whenever the single machine transfers job processing from a family to another family. By the general learning effect, we mean that the actual group setup time depends not only on the total setup time of the groups already processed but also on its scheduled position, and the actual processing time of a job in a certain group depends not only on the total normal processing time of the jobs already processed in the group but also on its scheduled position. We show that the makespan minimisation problem remains polynomially solvable under the proposed models. We also show that the problems of minimising the total completion time, the total weighted completion time and the discounted total weighted completion time of all jobs have polynomial optimal solutions under certain conditions.
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