کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7540981 | 1489044 | 2018 | 33 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Minimizing total completion time in the assembly scheduling problem
ترجمه فارسی عنوان
به حداقل رساندن زمان تکمیل کل در برنامه زمانبندی مونتاژ
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
برنامه ریزی، سیستم مونتاژ شعبه و مرز، زمان اتمام کامل
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
چکیده انگلیسی
This paper studies a two-stage assembly problem to minimize the total completion time. The two-stage assembly system consists of multiple machines in the first stage, and an assembly machine in the second stage. Each job consists of multiple components. In the first stage each component is processed on the dedicated machine. In the second stage, the processed components of each job are shipped and assembled into a product on the assembly machine. This system is a generalization of flowshop, which has practical applications in assembly-driven manufacturing. The objective is to establish an efficient schedule minimizing the total completion time. Six lower bounds are proposed and evaluated in a branch-and-bound algorithm. Also, four efficient heuristic algorithms are developed to generate near-optimal schedules. The computational results show that the derived B&B and heuristic algorithms perform very well within reasonable time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 122, August 2018, Pages 211-218
Journal: Computers & Industrial Engineering - Volume 122, August 2018, Pages 211-218
نویسندگان
Ik Sun Lee,