Optimal and Heuristic Models for Lot Splitting in a Flow Shop
研究了多工序流水车间中最小化平均流程时间或完工时间的批量分割策略，通过二次规划确定最优子批分割方式，并给出不同条件下管理者应采用的方案。
ABSTRACT This paper investigates optimal lot‐splitting policies in a multiprocess flow shop environment with the objective of minimizing either mean flow time or makespan. Using a quadratic programming approach to the mean flow time problem, we determine the optimal way of splitting a job into smaller sublots under various setup times to run time ratios, number of machines in the flow shop, and number of allowed sublots. Our results come from a deterministic flow shop environment, but also provide insights into the repetitive lots scheme using equal lot splits for job shop scheduling in a stochastic environment. We indicate those conditions in which managers should implement the repetitive lots scheme and where other lot‐splitting schemes should work better.