Simultaneous Versus Sequential Balancing and Scheduling of a Flexible Assembly Line

Abstract

Mixed integer programming formulations are presented for simultaneous or sequential balancing and scheduling of a flexible assembly line. The line is made up of a set of assembly stations in series, 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. Balancing and scheduling decisions can be made simultaneously or sequentially. In the latter approach first the station workloads are balanced, and then detailed assembly schedule is determined for prefixed task assignments and assembly routes by solving a standard job-shop problem. Balancing and scheduling with alternative or with single task assignments are considered. Numerical examples are provided and some computational results are reported to compare the two approaches.