Journal ArticleDOI
A heuristic approach for single-machine scheduling with due dates and class setups
TLDR
This paper considers a single-machine scheduling problem in which jobs are classified into classes and a setup is required between jobs of different classes, called a sequence-independent class setup problem, which is NP-complete.About:
This article is published in Computers & Operations Research.The article was published on 2001-09-01. It has received 11 citations till now. The article focuses on the topics: Job shop scheduling & Multiprocessor scheduling.read more
Citations
More filters
Journal ArticleDOI
A survey of scheduling problems with setup times or costs
TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.
Journal ArticleDOI
Integrated scheduling of production and distribution operations: A review
TL;DR: In this paper, the authors present a review of the state-of-the-art articles and suggest the corresponding further research directions for the above two categories of integrated scheduling problems.
Journal ArticleDOI
A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups
Xiuli Wang,T.C.E. Cheng +1 more
TL;DR: This paper studies the two-machine flowshop scheduling problem with class setups in a no-wait processing environment to minimize the maximum lateness and proposes a heuristic that can produce near-optimal solutions quickly for realistic-sized problems.
Journal ArticleDOI
Analysis of mixed integer programming formulations for single machine scheduling problems with sequence dependent setup times and release dates
Thiago Henrique Nogueira,Carlos Roberto Venâncio de Carvalho,Martín Gómez Ravetti,Mauricio C. de Souza +3 more
TL;DR: In this article, six different mixed integer programming (MIP) formulations are proposed and analyzed, based on the knowledge of four different paradigms for single machine scheduling problems (SMSP) with sequence dependent setup times and release dates.
Journal ArticleDOI
The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times
TL;DR: This work addresses the three-machine flowshop scheduling problem to minimise maximum lateness, where setup times are considered separate from processing times and proposes three heuristics: Earliest Due Date (EDD), an Enhanced Earliest due date (EEDD) and a Polynomial Genetic-based Algorithm (PGA).
References
More filters
Book
Introduction to sequencing and scheduling
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Book
Theory of scheduling
TL;DR: Reading theory of scheduling as one of the reading material to finish quickly to increase the knowledge and happiness in your lonely time.
Book
Machine Scheduling Problems: Classification, complexity and computations
TL;DR: In this paper, a branch-and-bound algorithm is proposed to solve the problem of n|m|P|Cmax problem with time lags, where p is the number of nodes in the n|1|seq dep|Ci problem.
Journal ArticleDOI
Scheduling groups of jobs on a single machine
Scott Webster,Kenneth R. Baker +1 more
TL;DR: This paper reviews the rapidly growing literature on single-machine scheduling models that incorporate benefits from job grouping and focuses on three basic models known as family scheduling with item availability, family scheduling for batch availability, and batch processing.