A branch and bound algorithm to minimize the sum of maximum earliness and tardiness in single machine
Publish place: 6th International Industrial Engineering Conference
Publish Year: 1387
نوع سند: مقاله کنفرانسی
زبان: English
View: 2,667
This Paper With 18 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IIEC06_071
تاریخ نمایه سازی: 8 مهر 1387
Abstract:
In this paper, we consider the problem of scheduling n jobs on a single machine to minimize the sum of maximum earliness and tardiness. Each job has a processing time and a due date. Since this problem is trying to minimize and diminish the values of earliness, the results and new dominance rules based on pairwise interchanges and a novel property called "Neutrality", a baranch-and bound scheme with beckward approach is proposed. the proposed algorithm is then tested on a set of randomly generated problems of different sizes, varying from 5 to 1000 jobs. Using these approaches, we are able to solve all problems in a reasonable time. Computational results demonstrate the efficiency of our branch and bound algorithm over the existing methods reported in the literature.
Keywords:
Authors
Mehdi Mahnam
Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran
Ghasem Moslehi
Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :