Premium
Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
Author(s) -
Dhouib E.,
Teghem J.,
Loukil T.
Publication year - 2013
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2012.00876.x
Subject(s) - job shop scheduling , lexicographical order , mathematical optimization , permutation (music) , subroutine , flow shop scheduling , computer science , simulated annealing , scheduling (production processes) , minification , integer programming , mathematics , algorithm , schedule , combinatorics , physics , acoustics , operating system
This paper considers the permutation flow shop scheduling problem with minimal and maximal time lags. Time lags are defined as intervals of time that must exist between every pair of consecutive operations of a job. The objective is to hierarchically minimize two criteria, the primary criterion is the minimization of the number of tardy jobs and the secondary one minimizes the makespan. We propose a mixed integer mathematical programming formulation which can be solved with the subroutine CPLEX. We also propose several versions of simulated annealing algorithm to heuristically solve the problem. Computational experiments to compare the proposed procedures are presented and discussed.