Journal
APPLIED MATHEMATICAL MODELLING
Volume 38, Issue 21-22, Pages 5231-5238Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2014.04.002
Keywords
Scheduling; Unrelated parallel machines; Learning effect; Deteriorating jobs
Funding
- National Natural Science Foundation of China [11001181, 71271039]
- New Century Excellent Talents in University [NCET-13-0082]
- Changjiang Scholars and Innovative Research Team in University [IRT1214]
- Fundamental Research Funds for the Central Universities [DUT14YQ211]
Ask authors/readers for more resources
In this study we consider unrelated parallel machines scheduling problems with learning effect and deteriorating jobs, in which the actual processing time of a job is a function of joint time-dependent deterioration and position-dependent learning. The objective is to determine the jobs assigned to corresponding each machine and the corresponding optimal schedule to minimize a cost function containing total completion (waiting) time, total absolute differences in completion (waiting) times and total machine load. If the number of machines is a given constant, we show that the problems can be solved in polynomial time under the time-dependent deterioration and position-dependent learning model. (C) 2014 Elsevier Inc. 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