This is the authors' abstract. We don't add key points for this paper.
We address a singlebatch lot streaming problem for a twostage 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 polynomialtime algorithm to obtain an optimal solution.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Sarin et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: