Journal ArticleDOI
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation
Reads0
Chats0
TLDR
This work considers various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time, and shows that the objective function is priority-generating and therefore the corresponding scheduling problem under series-parallel precedence constraints is polynomially solvable.Abstract:
We consider various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time. We focus on problems of minimizing the makespan or the sum of (weighted) completion times of the jobs. In many situations we show that the objective function is priority-generating, and therefore the corresponding scheduling problem under series-parallel precedence constraints is polynomially solvable. In other situations we provide counter-examples that show that the objective function is not priority-generating.read more
Citations
More filters
Journal ArticleDOI
Scheduling problems under learning effects: classification and cartography
TL;DR: A concise overview of some important learning models is presented and a new classification scheme for the different model of scheduling under learning effects is proposed and discussed and a cartography showing the relation between some well-known models is proposed.
Journal ArticleDOI
Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
Chuanli Zhao,Heng-yong Tang +1 more
TL;DR: In this article, the authors considered single machine scheduling with an aging effect in which the processing time of a job depends on its position in a sequence and provided a polynomial time algorithm to solve the problem.
Journal ArticleDOI
A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
TL;DR: This paper explores a sequence-independent, single processor makespan problem with position-dependent processing times and proves that under certain conditions, the optimal policy is to schedule the RMA in the middle of the task sequence.
Journal ArticleDOI
Single machine scheduling and due date assignment with positionally dependent processing times
TL;DR: This work presents polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK.
Journal ArticleDOI
Single-machine due-window assignment problem with learning effect and deteriorating jobs
Ji-Bo Wang,Cheng Wang +1 more
TL;DR: In this article, the authors considered a single-machine common due-window assignment scheduling problem with learning effect and deteriorating jobs and showed that the problem remains polynomially solvable under the proposed model.
References
More filters
Sequencing and scheduling: algorithms and complexity
TL;DR: This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.
Sequencing and scheduling : algorithms and complexity
TL;DR: A survey of deterministic machine scheduling can be found in this article, where complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops are presented.
Journal ArticleDOI
Single-machine scheduling with learning considerations
TL;DR: It is shown in this paper that even with the introduction of learning to job processing times two important types of single-machine problems remain polynomially solvable.