Effective precedence constrained scheduling in a make-to-order environment

Xueping Li, University of Tennessee - Knoxville
Jiao Wang
Rapinder Sawhney

Abstract

The make-to-order assembly lines have gradually replaced the traditional mass production assembly lines. These assembly lines follow a 'make-to-order' production policy, which are featured with a short production lead time, small number of working stations and highly skilled workers. In order to maximise the throughput under the resource (machine, labour and time) constraints, the problem of minimising makespan with general precedence constraints is addressed in this paper. A mathematical model of the problem is presented and a new heuristic, genetic job-oriented list scheduling (GJLS) is developed. Computational experiments indicate that the proposed algorithm outperforms the existing Graham's list scheduling (GLS).