Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints

Authors:
Emna Dhouib;Jacques Teghem;Taïcir Loukil
Affiliations:
Unité de recherche LOgistique Gestion Industrielle et de la Qualité (LOGIQ), Université de Sfax, Institut Supérieur de Gestion Industrielle de Sfax, Sfax, Tunisie 3018;Service de Mathématique et de Recherche Opérationnelle (MathRO), Université de Mons /Faculté Polytechnique de Mons, Mons, Belgique 7000;Unité de recherche LOgistique Gestion Industrielle et de la Qualité (LOGIQ), Université de Sfax, Institut Supérieur de Gestion Industrielle de Sfax, Sfax, Tunisie 3018
Venue:
Journal of Mathematical Modelling and Algorithms
Year:
2013

Citing 6
Cited 0

A two-machine flowshop sequencing problem with limited waiting time constraints

Computers and Industrial Engineering
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups

Computers and Operations Research
Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW Applications

Computers and Operations Research
Minimizing the weighted number of tardy jobs on a two-machine flow shop

Computers and Operations Research
Polynomial time algorithms for the UET permutation flowshop problem with time delays

Computers and Operations Research
Permutation flowshop scheduling problems with maximal and minimal time lags

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.