Single machine group scheduling with decreasing time-dependent processing times subject to release dates
Release Time:2019-03-09 Hits:
Indexed by: Journal Article
Date of Publication: 2014-05-15
Journal: APPLIED MATHEMATICS AND COMPUTATION
Included Journals: Scopus、EI、SCIE
Volume: 234
Page Number: 286-292
ISSN: 0096-3003
Key Words: Scheduling; Single machine; Time-dependent processing times; Group technology; Ready times
Abstract: In this paper we investigate a single machine scheduling problem with decreasing timedependent processing times and group technology assumption. By the decreasing timedependent processing times and group technology assumption, we mean that the group setup times and job processing times are both decreasing linear functions of their starting times. We want to minimize the makespan subject to release dates. We show that the problem can be solved in polynomial time. (C) 2014 Published by Elsevier Inc.