Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line |
| |
| Institution: | 1. Department of Chemistry, Shahid Bahonar University of Kerman, Kerman, Iran;2. Young Researchers Society, Shahid Bahonar University of Kerman, Kerman, Iran;1. Graduate School of Information Science, Nagoya University, Japan;2. Graduate School of System Informatics, Kobe University, Japan;1. School of Quantitative Sciences, Universiti Utara Malaysia, 06010 Kedah, Malaysia;2. School of Computing, University of Portsmouth, PO13HE, United Kingdom;3. Department of Mathematics and Statistics, Universiti Teknologi MARA (Perlis), 02600 Arau, Perlis, Malaysia;1. Department of Mechanical Engineering, Indian Institute of Technology, Chennai 600036, India;2. Department of Industrial and Systems Engineering, Wayne State University, MI 48202, United States |
| |
| Abstract: | A monolithic and a hierarchical approach are presented for balancing and scheduling of a flexible assembly line (FAL). The system is made up of a set of assembly stations in series, each with limited work space and is capable of simultaneously producing a mix of product types. The objective is to determine an assignment of assembly tasks to stations and an assembly schedule for all products so as to complete the products in minimum time. In the monolithic approach balancing and scheduling decisions are made simultaneously. In the hierarchical approach, however, first the station workloads are balanced, and then detailed assembly schedule is determined for prefixed task assignments and assembly routes by solving a permutation flowshop problem. Mixed integer programming formulations are presented for the two approaches. Numerical examples are included to illustrate and compare the approaches and some computational results are reported. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
