کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
475824 699381 2012 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 6, June 2012, Pages 1236–1244
نویسندگان
, , , , ,