Lot streaming for a two-stage assembly system in the presence of handling costs

Niloy J. Mukherjee, Subhash C. Sarin () and Daniel A. Neira
Additional contact information
Niloy J. Mukherjee: Virginia Tech
Subhash C. Sarin: Virginia Tech
Daniel A. Neira: Virginia Tech

Journal of Scheduling, 2023, vol. 26, issue 4, No 1, 335-351

Abstract: Abstract Lot streaming is a strategy of splitting a production lot into several sublots so that completed sublots can be transferred to a downstream machine before the entire lot has been completely processed at a current machine. Such a strategy increases the velocity of material flow through a system. However, an increase in the number of transfers between stages also increases material handling cost. In this paper, we address the problem of minimizing a weighted sum of the makespan and handling costs when multiple lots are produced in an assembly system consisting of s suppliers in the first stage and a single assembly machine in the second stage. We exploit a relationship between an optimal solution for this problem and that for a related single-lot, two-machine makespan minimization problem in developing a polynomial-time algorithm to obtain the optimal number and sizes of sublots for each lot when a sequence for processing the lots on the assembly machine is given. We also provide novel integer programming formulations to simultaneously determine an optimal production sequence for the lots and the number of sublots and sublot sizes for each lot, and present a polynomial-time method to obtain valid inequalities for this problem. Experimental results are presented to demonstrate the effectiveness of this formulation over the traditional linear-ordering-based formulations.

Keywords: Lot streaming; Scheduling; Two-stage assembly shop; Multiple lot; Handling cost; Makespan (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-023-00777-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:26:y:2023:i:4:d:10.1007_s10951-023-00777-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-023-00777-7

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().