Real-time part allocation in FMS under finite storage capacity
by H.P. Hillion, J.M. Proth
International Journal of Computer Applications in Technology (IJCAT), Vol. 2, No. 1, 1989

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.

Online publication date: Wed, 11-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com