Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 117, Issue -, Pages 1-5Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.01.002
Keywords
Scheduling; Single-machine; Group technology; Makespan; Total completion time; Learning effect; Aging effect
Funding
- Zhejiang Provincial Educational Commission Foundation of China [Y201738850]
- Hong Kong Polytechnic University under the Fung Yiu King - Wing Hang Bank Endowed Professorship in Business Administration
- Zhejiang Provincial Natural Science Foundation of China [LQ15G010001, LR15G010001]
- Contemporary Business and Trade Research Center of Zhejiang Gongshang University, key Research Institute of Social Sciences and Humanities of the Ministry of Education
Ask authors/readers for more resources
We propose new models of position-dependent processing times for single-machine group scheduling problems. The two objectives of the scheduling problems are to minimize the makespan and the total completion time, respectively. We present polynomial-time algorithms to solve the problems.
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
Share Paper
