|
|||||
|
|
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 |
| Institution: | 1. Unité de recherche LOgistique Gestion Industrielle et de la Qualité (LOGIQ), Université de Sfax, Institut Supérieur de Gestion Industrielle de Sfax, Route el Mharza km 1.5, 3018, Sfax, Tunisie 2. Service de Mathématique et de Recherche Opérationnelle (MathRO), Université de Mons /Faculté Polytechnique de Mons, 21, Place du Parc, 7000, Mons, Belgique |
| 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |