Authors: H.P. Hillion, J.M. Proth
Addresses: INRIA-LORRAINE, Technopole de Nancy-Brabois, Campus Scientifique, Bd des Aiguillettes, BP 239, 54506 Vandoeuvre les Nancy Cedex, France. ' INRIA-LORRAINE, Technopole de Nancy-Brabois, Campus Scientifique, Bd des Aiguillettes, BP 239, 54506 Vandoeuvre les Nancy Cedex, France
Abstract: In this paper, we consider a manufacturing system composed of some sets of identical machines, each of these sets being associated with a finite input buffer. Each buffer can store the parts whose next operations have to be performed on one of the machines of the corresponding set. A part is launched in the system as soon as it is available. The goal consists of finding a schedule which minimises the completion time of the part, without changing the schedules of the parts that arrived earlier in the system. We propose a polynomial algorithm to solve this problem.
Keywords: flexible manufacturing systems; FMS; scheduling; real time; work-in-process; WIP; completion time; heuristic algorithms; artificial intelligence; artificial memory; expert systems; part allocation; finite storage capacity.
International Journal of Computer Applications in Technology, 1989 Vol.2 No.1, pp.38 - 43
Available online: 11 Jun 2014 *Full-text access for editors Access for subscribers Purchase this article Comment on this article