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

Minimizing The Number Of Tardy Jobs In A Permutation Flowshop Scheduling Problem With Setup Times And Time Lags Constraints

Emna Dhouib, J. Teghem, T. Loukil
Published 2013 · Mathematics, Computer Science

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
This paper studies the permutation flowshop scheduling problem with sequence dependent setup times and time lags constraints minimizing the number of tardy jobs. Dependent setup times are defined as the work to prepare the machines between two successive jobs. Time lags are defined as intervals of time that must exist between every couple of successive operations of the same job. Two mathematical programming formulations are proposed for the considered problem. A simulated annealing algorithm is also developed to solve the problem. Computational experiments are presented and discussed.
This paper references
10.1002/NAV.3800010110
Optimal two- and three-stage production schedules with setup times included
S. Johnson (1954)
10.1287/MNSC.15.1.102
An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
J. M. Moore (1968)
10.1287/MNSC.16.1.77
A Functional Equation and its Application to Resource Allocation and Sequencing Problems
E. Lawler (1969)
Optimisation by simulated annealing
S. Kirkpatrick (1983)
10.1007/BF01920918
Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions
K. Khurana (1984)
10.1007/BF01919496
The flow shop problem with time lags and separated setup times
W. Szwarc (1986)
10.1016/0377-2217(89)90108-2
A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
A. Hariri (1989)
10.1016/0377-2217(89)90107-0
Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave
G. Laporte (1989)
10.1016/0360-8352(94)00026-J
A two-machine flowshop sequencing problem with limited waiting time constraints
D. Yang (1995)
10.1016/0925-5273(95)00168-9
Using metaheuristics for solving a production scheduling problem in a chemical firm. A case study
P. Fortemps (1996)
10.1016/S0925-5273(97)00017-0
An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs
S. Parthasarathy (1997)
10.1016/S0377-2217(98)00323-3
On the complexity of two-machine flowshop problems with due date related objectives
Christos Koulamas (1998)
10.1016/S0305-0548(97)00079-8
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups
R. Z. Ríos-Mercado (1998)
10.1016/S0305-0483(98)00042-5
A review of scheduling research involving setup considerations
A. Allahverdi (1999)
10.1016/S0377-2217(99)00164-2
Minimizing tardy jobs in a flowshop with common due date
F. Croce (2000)
10.1016/S0377-2217(01)00320-4
Two models for a family of flowshop sequencing problems
E. Stafford (2002)
10.1016/S0305-0548(00)00097-6
Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
A. Allahverdi (2002)
Optimisation Approchée en Recherche Opérationnelle
J. Teghem (2002)
10.1016/S0305-0548(02)00114-4
Minimizing the weighted number of tardy jobs on a two-machine flow shop
R. L. Bulfin (2003)
10.1023/B:ANOR.0000030683.64615.c8
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays
P. Brucker (2004)
10.1016/j.ejor.2004.01.022
Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
R. Ruiz (2005)
10.1016/j.cor.2004.11.006
Permutation flowshop scheduling problems with maximal and minimal time lags
Julien Fondrevelle (2006)
10.1016/j.cor.2006.03.018
Polynomial time algorithms for the UET permutation flowshop problem with time delays
A. Kordon (2008)
10.1016/j.ejor.2006.06.060
A survey of scheduling problems with setup times or costs
A. Allahverdi (2008)
10.1016/J.IJPE.2006.08.018
Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times
Julien Fondrevelle (2008)



This paper is referenced by
10.1016/j.engappai.2020.104016
Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times
J. Huang (2021)
10.1016/j.swevo.2019.100575
A discrete multi-objective fireworks algorithm for flowshop scheduling with sequence-dependent setup times
Lijun He (2019)
10.3390/a11040043
Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling
Helio Yochihiro Fuchigami (2018)
10.1016/j.ejor.2017.06.027
Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
Aymen Sioud (2018)
10.1016/j.cie.2018.04.021
Permutation flowshop scheduling with time lag constraints and makespan criterion
Bailin Wang (2018)
10.1109/TSM.2017.2662231
Minimization of Waiting Time Variation in a Generalized Two-Machine Flowshop With Waiting Time Constraints and Skipping Jobs
Tae-Sun Yu (2017)
10.1080/21681015.2016.1151466
Minimizing the number of tardy jobs on a two-stage assembly flowshop
A. Allahverdi (2016)
Complex Job-Shop Scheduling with Batching in Semiconductor Manufacturing
Sebastian Knopp (2016)
10.3934/JIMO.2016.12.1465
Minimizing the weighted number of tardy jobs on multiple machines: A review
M. O. Adamu (2016)
10.1051/ro/2015015
Two machines flow shop with reentrance and exact time lag
Karim Amrouche (2016)
10.1016/j.ejor.2015.04.004
The third comprehensive survey on scheduling problems with setup times/costs
A. Allahverdi (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.2991/ESAC-15.2015.52
Gene Shift Operators of Partheno-Genetic Algorithm for Permutation Flowshop Scheduling with Limited Waiting Times
Bailin Wang (2015)
10.1016/j.ejor.2014.04.031
Total completion time with makespan constraint in no-wait flowshops with setup times
A. Allahverdi (2014)
10.1002/9781118731598.CH4
A Comparison of Local Search Metaheuristics for a Hierarchical Flow Shop Optimization Problem with Time Lags
Emna Dhouib (2013)
Semantic Scholar Logo Some data provided by SemanticScholar