scispace - formally typeset
Open AccessJournal ArticleDOI

On the exact solution of the no-wait flow shop problem with due date constraints

Hamed Samarghandi, +1 more
- 01 May 2017 - 
- Vol. 81, pp 141-159
Reads0
Chats0
TLDR
Five different mathematical programming models and two constraint programming models are developed for the no-wait flow shop problem with due date constraints and an exact algorithm that takes advantage of unique characteristics of the problem is designed.
About: 
This article is published in Computers & Operations Research.The article was published on 2017-05-01 and is currently open access. It has received 35 citations till now. The article focuses on the topics: Job shop scheduling & Flow shop scheduling.

read more

Figures
Citations
More filters
Journal ArticleDOI

An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption

Damla Yüksel, +3 more
- 01 Jul 2020 - 
TL;DR: This study proposes both mixed-integer linear programming (MILP) and constraint programming (CP) model formulations for the energy-efficient bi-objective no-wait permutation flowshop scheduling problems (NWPFSPs) considering the total tardiness and the total energy consumption minimization simultaneously.

Improvements and extensions to the miller-tucker-zemlin subtour elimination constraints

Martin Desrochers, +1 more
TL;DR: This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and extended to various types of vehicle routing problems.
Journal ArticleDOI

A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem

Caio Paziani Tomazella, +1 more
- 15 Nov 2020 - 
TL;DR: The objectives of this review are to provide guidelines for future research in the application of the Branch-and-Bound algorithm for scheduling problems and also to be used as an index for authors to locate the articles for particular problems within the state-of-the-art literature.
Journal ArticleDOI

Solving the no-wait job shop scheduling problem with due date constraints: A problem transformation approach

Hamed Samarghandi
- 01 Oct 2019 - 
TL;DR: The mathematical models proposed for the transformed problem demonstrate a better performance compared to the models developed for the original problem and a genetic algorithm is developed to deal with larger instances of both the original and the transformed problems.
Journal ArticleDOI

Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times

Chen-Yang Cheng, +3 more
- 01 Apr 2019 - 
TL;DR: An effective and efficient metaheuristic, called pairwise iterated greedy (PIG) algorithm, is proposed to solve medium- and large-size problems in the mixed no-wait flowshop scheduling problem which considers sequence-dependent setup times (SDSTs).
References
More filters
Book ChapterDOI

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

Ron Graham, +3 more
- 01 Jan 1979 - 
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
Journal ArticleDOI

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Michel X. Goemans, +1 more
- 01 Nov 1995 - 
TL;DR: This algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semidefinite programming in the design of approximation algorithms.
Book

Introduction to sequencing and scheduling

A. J. Clewett
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).
Journal ArticleDOI

A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

Nicholas G. Hall, +1 more
- 01 Jun 1996 - 
TL;DR: Several well-documented applications of no-wait and blocking scheduling models are described and some ways in which the increasing use of modern manufacturing methods gives rise to other applications are illustrated.
Journal ArticleDOI

On the Job-Shop Scheduling Problem

Alan S. Manne
- 01 Apr 1960 - 
TL;DR: This formulation of discrete linear programming seems, however, to involve considerably fewer variables than two other recent proposals and on these grounds may be worth some computer experimentation.
Related Papers (5)

A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

Nicholas G. Hall, +1 more
- 01 Jun 1996 - 

A survey of scheduling problems with no-wait in process

Ali Allahverdi
- 16 Dec 2016 - 

A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints

C. Gicquel, +3 more
- 01 Mar 2012 - 

A particle swarm optimisation for the no-wait flow shop problem with due date constraints

Hamed Samarghandi
- 04 Feb 2015 - 

A heuristic for no-wait flow shop scheduling

Sagar U. Sapkal, +1 more
- 05 Apr 2013 - 
Frequently Asked Questions (9)
Q1. What contributions have the authors mentioned in the paper "On the exact solution of the no-wait flow shop problem with due date constraints" ?

This paper deals with the no-wait flow shop scheduling problem with due date constraints. This paper develops a number of distinct mathematical models for the problem based on different decision variables. To investigate the performance of the mathematical models and to compare them with the developed exact algorithm, a number of test problems are solved and the results are reported. 

As for the directions for future research efforts, developing tight lower and upper bounds for max|, |jF nwt d C is an interesting future research direction. Moreover, solving quadratic programming models using semi-definite programming techniques, if possible, is very promising. 

Five mathematical models have been developed for the problem; namely, a mixed integer programming model, two quadratic mixed integer programming formulations, and two constraint programming models. 

Ding et al. (2015) considered a no-wait flow shop problem with the objective of minimizing the total tardiness; they proposed a heuristic that is designed to speed up the search by focusing on a subset of the jobs rather than all the jobs. 

Panwalkar and Koulamas (2012) considered a twomachine flow shop problem with the objective of minimizing the total tardy jobs and finding a common due date for the jobs, and developed a heuristic algorithm with computational complexity of 2( )O n for aspecial case of the problem. 

Baker and Keller (2010) reported that for the case of single machine sequencing problems mathematical programming models can be employed to optimally solve instances with as many as 50 jobs. 

Ramezanian et al. (2010) developed a mathematical programming model to minimize the earliness and tardiness costs in a flow shop context, where processing times can be zero. 

Due date are among the most applicable constraints in scheduling and sequencing literature because real-world jobs are usually accompanied by a deadline for completion (Hunsucker and Shah 1992). 

In the classical flow shop scheduling problem there is a set of n jobs that has to be processed with a predefined order of operations on m machines, and the optimal sequence of jobs on each machine with respect to some performance measure is desired.