集合(抽象数据类型)
阶段(地层学)
计算机科学
采购
调度(生产过程)
流量(数学)
运筹学
运营管理
数学
工程类
地质学
几何学
古生物学
程序设计语言
标识
DOI:10.1057/jors.1994.221
摘要
AbstractAbstractThis paper considers the job (lot) scheduling problem for two-stage flow shops in which the movement of transfer batches (sublots) from the first stage to the next are allowed. Set-up, processing and removal times are considered as separable and independent of the order in which jobs are processed at any of two stages. An optimal transfer batch sizing and scheduling algorithm which has an objective of minimizing the maximum flow time (makespan) is developed and demonstrated by a numerical example.Keywords: changeover timesflow shopslot streamingschedulingtransfer batches
科研通智能强力驱动
Strongly Powered by AbleSci AI