The car sequencing problem: an overview of formulations and Exact and Heuristic Algorithms
Publish Year: 1388
نوع سند: مقاله کنفرانسی
زبان: English
View: 233
متن کامل این Paper منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل Paper (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دریافت نمایند.
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICIORS03_434
تاریخ نمایه سازی: 17 آبان 1396
Abstract:
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. The ROADEF challenge is organized every two years by the French Society ofOperations Research and Decision Making Aid. The goal is to allow industrial partners to witness recent developments in the field of Operations Research and Decision Analysis, and researchers to faceup a decisional problem, often complex, occurred in industry. In 2005, the subject of this challenge has been proposed by the car manufacturer RENAULT and concerned a car sequencing problem. We review the exact and heuristic methods of the literature proposed to solve the standard problem and we present the industrial context and the specificities of the challenge problem. We describe the process ofthe ROADEF 2005 challenge and the methods proposed by the competing teams.
Keywords:
Authors
A. Motewassel
Birjand Univ. Department of Applied Mathematics -
M. Aman
Birjand Univ. Department of Applied Mathematics