Online citations, reference lists, and bibliographies.
← Back to Search

A Branch And Bound Algorithm To Minimize The Number Of Late Jobs In A Permutation Flow-shop

A. Hariri, C. Potts
Published 1989 · Mathematics

Save to my Library
Download PDF
Analyze on Scholarcy Visualize in Litmaps
Share
Reduce the time it takes to create your bibliography by a factor of 10 by using the world’s favourite reference manager
Time to take this seriously.
Get Citationsy
Abstract The problem of scheduling n jobs in an m-machine permutation flow-shop is considered. Each job requires processing on machines 1,..., m in that order. The processing order of jobs is to be the same for each machine. A due date for each job is specified that represents the time by which it should ideally be completed. The objective is to schedule the jobs so that the number completed after their due dates is minimized. A lower bound, which is obtained by solving a single machine subproblem, is derived. Also, two improvement procedures which consider all subproblems together are developed. A branch and bound algorithm that uses these lower bounds is described. Computational experience with the algorithm is reported.
This paper references



This paper is referenced by
10.1016/j.ejor.2019.10.014
Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling
B. Naderi (2020)
10.1016/j.eswa.2020.113556
A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem
C. P. Tomazella (2020)
10.1016/j.cor.2020.105006
An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
Alper Hamzadayi (2020)
Robust dynamic and stochastic scheduling in permutation flow shops
Al Behadili (2018)
10.1201/9781315152394-4
Complexity and Algorithms
M. Schaefer (2018)
10.1007/s10479-018-2775-5
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
Emna Dhouib (2018)
10.3934/NACO.2017029
A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
M. A. Ardakan (2017)
10.3934/JIMO.2016.12.1465
Minimizing the weighted number of tardy jobs on multiple machines: A review
M. O. Adamu (2016)
10.1007/s10951-013-0336-y
Two-machine interval shop scheduling with time lags
X. Zhang (2015)
10.1007/s11590-014-0761-7
Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
Imen Hamdi (2015)
10.1109/IEOM.2015.7093721
Minimizing the number of tardy jobs in a dynamic flexible flow shop
A. Jafari (2015)
10.1016/j.cie.2014.06.011
Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP
R. M'Hallah (2014)
10.1080/0951192X.2013.820349
A branch-and-bound algorithm for minimising the number of tardy jobs in a two-machine flow-shop problem with release dates
M. A. Ardakan (2014)
A study on flexible flow shop and job shop scheduling using meta-heuristic approaches
M. R. Singh (2014)
10.1109/ICMSAO.2013.6552689
Logic-based Benders decomposition to solve the permutation flowshop scheduling problem with time lags
Imen Hamdi (2013)
10.1002/9781118731598.CH4
A Comparison of Local Search Metaheuristics for a Hierarchical Flow Shop Optimization Problem with Time Lags
Emna Dhouib (2013)
MINIMIZING THE NUMBER OF TARDY JOBS IN A TWO-MACHINE FLOWSHOP PROBLEM WITH NON-SIMULTANEOUS JOB ENTRANCE
Moslehi Ghasem (2013)
10.1111/j.1475-3995.2012.00876.x
Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
Emna Dhouib (2013)
10.2139/ssrn.1829138
The Cost-Cutting Potential of Supply Chain Scheduling
Christian Ullrich (2013)
10.1007/978-1-4614-5152-5_4
The m-Machine Flow Shop
H. Emmons (2013)
10.1007/S00170-012-4328-4
Stochastic flow-shop scheduling with minimizing the expected number of tardy jobs
Ali Elyasi (2013)
10.1007/s10852-012-9180-x
Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints
Emna Dhouib (2013)
10.1109/CODIT.2013.6689654
Permutation flowshop problem with time lags scheduling by logic-based Benders decomposition
Imen Hamdi (2013)
10.1016/J.APM.2012.10.001
A Branch and Bound Algorithm to Minimize the Total Weighed Number of Tardy Jobs and Delivery Costs
M. Rasti-Barzoki (2013)
10.1007/S00170-011-3659-X
No-wait flowshop scheduling problem to minimize the number of tardy jobs
Tariq A. Aldowaisan (2012)
10.1080/00207543.2011.632385
Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs
M. Varmazyar (2012)
10.3846/13923730.2012.719837
Applying metaheuristic strategies in construction projects management
W. Bozejko (2012)
Minimizing the Expected Number of Tardy Jobs in Dynamic Flow Shop with Stochastic Due Dates
Ali Elyasi (2012)
10.4028/www.scientific.net/AMM.110-116.4063
Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem
M. Varmazyar (2011)
10.1016/j.cor.2009.04.018
Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
A. Ruiz-Torres (2010)
Flowshop scheduling problems with due date related objectives: a review of the literature
Paz Pérez González (2009)
10.1016/j.cor.2006.07.013
Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
A. Ruiz-Torres (2008)
See more
Semantic Scholar Logo Some data provided by SemanticScholar