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

Authors: Xueping Li, Jiao Wang, Rapinder Sawhney

Addresses: Department of Industrial and Information Engineering, University of Tennessee, 416 East Stadium Hall, Knoxville, TN 37996-0700, USA. ' Department of Industrial and Information Engineering, University of Tennessee, 416 East Stadium Hall, Knoxville, TN 37996-0700, USA. ' Department of Industrial and Information Engineering, University of Tennessee, 416 East Stadium Hall, Knoxville, TN 37996-0700, USA

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).

Keywords: scheduling; make-to-order assembly lines; precedence constraints; optimisation; heuristic algorithm; minimising makespan; mathematical modelling.

DOI: 10.1504/IJAOM.2009.031248

International Journal of Advanced Operations Management, 2009 Vol.1 No.4, pp.331 - 351

Available online: 27 Jan 2010 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article