计算机科学
作业调度程序
批处理
地铁列车时刻表
调度(生产过程)
时间复杂性
作业车间调度
数学优化
批量生产
集合(抽象数据类型)
过程(计算)
并行计算
算法
数学
运营管理
工程类
操作系统
程序设计语言
云计算
作者
V. Chandru,Chung‐Yee Lee,Reha Uzsoy
标识
DOI:10.1016/0167-6377(93)90030-k
摘要
We consider the problem of minimizing the total completion time on a single batch processing machine. The set of jobs to be scheduled can be partitioned into a number of families, where all jobs in the same family have the same processing time. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the processing time of the longest job in the batch. We analyze that properties of an optimal schedule and develop a dynamic programming algorithm of polynomial time complexity when the number of job families is fixed. The research is motivated by the problem of scheduling burn-in ovens in the semiconductor industry.
科研通智能强力驱动
Strongly Powered by AbleSci AI