کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1138474 1489216 2006 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Scheduling a two-stage flowshop under makespan constraint
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
Scheduling a two-stage flowshop under makespan constraint
چکیده انگلیسی

We consider selecting and sequencing jobs in a two stage flowshop so that the selected jobs are completed before a specified time limit (such as the end of a shift). The objective is to maximize the weighted (reward) sum of the selected jobs. We show that the problem is NP-hard, and present two procedures to find an optimum solution. The first procedure uses dynamic programming, and the second uses mixed integer programming. The integer programming formulation exploits special properties of the problem and solves large instances of the problem. We also develop heuristics and provide worst case performance guarantees. An improvement procedure is also developed. Extensive computational testing shows that our heuristics, when used jointly with the improvement procedure, yield excellent results (providing solutions within 3% of the optimum in an average sense) for both balanced and unbalanced shops.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Mathematical and Computer Modelling - Volume 44, Issues 1–2, July 2006, Pages 73–84
نویسندگان
, , ,