Single-batch lot streaming in a two-stage assembly system
by Subhash C. Sarin; Liming Yao; Dan Trietsch
International Journal of Planning and Scheduling (IJPS), Vol. 1, No. 1/2, 2011

Abstract: We address a single-batch lot streaming problem for a two-stage assembly system. The first stage consists of m parallel subassembly machines, each devoted to a component type. A single assembly machine at the second stage assembles a unit of a product after all m components (one each from the subassembly machines) are ready. The batch consists of U units. Detached or attached setups are necessary before the start of the first item on each machine. Given a fixed maximal number of sublots, the problem is to determine integer sublot sizes to minimise the makespan. We present a polynomial-time algorithm to obtain an optimal solution.

Online publication date: Sat, 31-Dec-2011

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 Planning and Scheduling (IJPS):
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