Journal
INFORMATION SCIENCES
Volume 275, Issue -, Pages 226-231Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2014.02.034
Keywords
Scheduling; Single machine; Start time dependent processing time; Group technology; Ready time
Categories
Funding
- National Natural Science Foundation of China [71271039]
- New Century Excellent Talents in University [NCET-13-0082]
- Changjiang Scholars and Innovative Research Team in University [IRT1214]
- State Key Laboratory for Manufacturing Systems Engineering (Xi'an Jiaotong University) [sklms201306]
Ask authors/readers for more resources
In this paper we investigate a single machine scheduling problem with time dependent processing times and group technology (GT) assumption. By time dependent processing times and group technology assumption, we mean that the group setup times and job processing times are both increasing functions of their starting times, i.e., group setup times and job processing times are both described by function which is proportional to a linear function of time. We attempt to minimize the makespan with ready times of the jobs. We show that the problem can be solved in polynomial time when start time dependent processing times and group technology are considered simultaneously. (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