Journal ArticleDOI
Machine scheduling with availability constraints
Eric Sanlaville,Günter Schmidt +1 more
TLDR
A survey on results related to scheduling problems where machines are not continuously available for processing, NP-hardness results, polynomial optimization and approximation algorithms, and single and multi machine problems.Abstract:
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems and analyze their complexity. We survey NP-hardness results, polynomial optimization and approximation algorithms. We also distinguish between on-line and off-line formulations of the problems. Results are concerned with criteria on completion times and due dates.read more
Citations
More filters
Journal ArticleDOI
Smart manufacturing systems for Industry 4.0: Conceptual framework, scenarios, and future perspectives
Pai Zheng,Honghui wang,Zhiqian Sang,Runyang Zhong,Yongkui Liu,Chao Liu,Khamdi Mubarok,Shiqiang Yu,Xun Xu +8 more
TL;DR: This study examines smart manufacturing systems for Industry 4.0 using a conceptual framework and demonstrative scenarios that pertain to smart design, smart machining, smart control, smart monitoring, and smart scheduling.
Journal ArticleDOI
A survey of scheduling with deterministic machine availability constraints
TL;DR: In this paper, a survey of deterministic scheduling problems with availability constraints motivated by preventive maintenance is presented, where complexity results, exact algorithms and approximation algorithms in single machine, parallel machine, flow shop, open shop, job shop scheduling environment with different criteria are surveyed briefly.
Journal ArticleDOI
Fifty years of scheduling: a survey of milestones
TL;DR: The historical development of the subject since the mid-1950s when the landmark publications started to appear is explored, highlighting the key contributions that helped shape the subject.
Journal ArticleDOI
Machine scheduling with a rate-modifying activity
Chung Yee Lee,V.J. Leon +1 more
TL;DR: It is proved that the problem of minimizing maximum lateness is NP-hard and also provided a pseudo-polynomial time algorithm to solve it optimally.
Journal ArticleDOI
Skilled workforce scheduling in Service Centres
TL;DR: An efficient and quick hybrid genetic algorithm that combines local searches with genetic population management techniques is presented to manage the Skilled Workforce Project Scheduling Problem.
References
More filters
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Journal ArticleDOI
NP-complete scheduling problems
TL;DR: It is shown that the problem of finding an optimal schedule for a set of jobs is NP-complete even in the following two restricted cases, tantamount to showing that the scheduling problems mentioned are intractable.
Journal ArticleDOI
Scheduling with Deadlines and Loss Functions
TL;DR: The problem of this paper is that of scheduling several one-stage tasks on several processors, which are capable of handling the tasks with varying degrees of efficiency, to minimize the total loss, which is a sum of losses associated with the individual tasks.
Journal ArticleDOI
An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
TL;DR: In this paper, an algorithm was proposed for sequencing n jobs through a single facility to minimize the number of late jobs, where each job is associated with a continuous, monotone non-decreasing deferral cost function.