首页 | 本学科首页   官方微博 | 高级检索  
     


Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
Authors:Jacques Lamothe  Francois Marmier  Paul Gaborit
Affiliation:a Pierre Fabre Médicament Production, Parc Industriel de la Chartreuse, 81106 Castres Cedex, France
b Université Toulouse, Mines Albi, Centre Génie Industriel, Campus Jarlard—Route de Teillet, 81013 Albi CT Cedex 09, France
Abstract:Quality control lead times are one of most significant causes of loss of time in the pharmaceutical and cosmetics industries. This is partly due to the organization of laboratories that feature parallel multipurpose machines for chromatographic analyses. The testing process requires long setup times and operators are needed to launch the process. The various controls are non-preemptive and are characterized by a release date, a due date and available routings. These quality processes lead to significant delays, and we therefore evaluate the total tardiness criterion. Previous heuristics were defined for the total tardiness criterion, parallel machines, and setup such as apparent tardiness cost (ATC) and ATC with setups (ATCS). We propose new rules and a simulated annealing procedure in order to minimize total tardiness.
Keywords:Scheduling   Parallel machine   Heuristics   Simulated annealing
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号