Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
Published 2017 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
Authors
Keywords
Scheduling, Tool change, Workload-dependent, Total completion time
Journal
JOURNAL OF SCHEDULING
Volume 21, Issue 4, Pages 461-482
Publisher
Springer Nature
Online
2017-10-05
DOI
10.1007/s10951-017-0543-z
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
- (2016) Peter Brucker et al. JOURNAL OF SCHEDULING
- Single-machine scheduling with a variable maintenance activity
- (2015) Wenchang Luo et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Single machine scheduling with two competing agents and equal job processing times
- (2015) Daniel Oron et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Scheduling a variable maintenance and linear deteriorating jobs on a single machine
- (2015) Wenchang Luo et al. INFORMATION PROCESSING LETTERS
- Single machine total completion time scheduling problem with workload-dependent maintenance duration
- (2015) Dehua Xu et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- Single-machine scheduling with preemptive jobs and workload-dependent maintenance durations
- (2015) Zhijun Xu et al. Operational Research
- Online scheduling of incompatible unit-length job families with lookahead
- (2014) Wenhua Li et al. THEORETICAL COMPUTER SCIENCE
- Due-window assignment problems with unit-time jobs
- (2013) Enrique Gerstl et al. APPLIED MATHEMATICS AND COMPUTATION
- Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
- (2013) Alain Quilliot et al. DISCRETE APPLIED MATHEMATICS
- Due-window assignment with identical jobs on parallel uniform machines
- (2013) Enrique Gerstl et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs
- (2013) Enrique Gerstl et al. INFORMATION PROCESSING LETTERS
- Semi-online scheduling with two GoS levels and unit processing time
- (2013) Taibo Luo et al. THEORETICAL COMPUTER SCIENCE
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- (2012) Adam Janiak et al. 4OR-A Quarterly Journal of Operations Research
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- (2012) Dvir Shabtay et al. Discrete Optimization
- Scheduling tool changes and special jobs on a single machine to minimize makespan
- (2012) Dehua Xu et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- Temperature aware online algorithms for scheduling equal length jobs
- (2012) Martin Birks et al. THEORETICAL COMPUTER SCIENCE
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- (2011) Dvir Shabtay et al. COMPUTERS & OPERATIONS RESEARCH
- Due dates assignment and JIT scheduling with equal-size jobs
- (2010) Nguyen Huynh Tuong et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Scheduling jobs under increasing linear machine maintenance time
- (2010) Dehua Xu et al. JOURNAL OF SCHEDULING
- Scheduling of coupled tasks with unit processing times
- (2010) J. Blazewicz et al. JOURNAL OF SCHEDULING
- Reliability concepts applied to cutting tool change time
- (2010) Carmen Elena Patiño Rodriguez et al. RELIABILITY ENGINEERING & SYSTEM SAFETY
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
- (2007) Chung-Lun Li et al. COMPUTERS & OPERATIONS RESEARCH
- Optimization models for the tool change scheduling problem
- (2006) Jen-Shiang Chen OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started