Article ID: | iaor20012263 |
Country: | United Kingdom |
Volume: | 38 |
Issue: | 14 |
Start Page Number: | 3267 |
End Page Number: | 3282 |
Publication Date: | Jan 2000 |
Journal: | International Journal of Production Research |
Authors: | Sawik Tadeusz |
Keywords: | programming: integer, scheduling |
A monolithic and a hierarchical approach is presented for loading and scheduling in a general flexible assembly system and a flexible assembly line. The system is made up of a set of assembly stations of various types each with limited working 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 a minimum time. In the monolithic approach loading and scheduling decisions are made simultaneously. In the hierarchical approach, however, first the station workloads are balanced by solving the loading problem, and then detailed assembly schedule is determined for prefixed task assignments and assembly routes by solving a standard job-shop problem. Mixed integer programming formulations are presented for simultaneous and for sequential loading and scheduling. Loading and scheduling with alternative or with single task assignments are considered. Numerical examples are included to illustrate and compare the two approaches proposed.