调度(生产过程)
流水车间调度
作业调度程序
算法
拖延
多处理器调度
单调速率调度
动态优先级调度
公平份额计划
作者
Wieslaw Kubiak,Yanling Feng,Guo Li,Suresh Sethi,Chelliah Sriskandarajah
摘要
Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two‐center job shop. The first center consists of one machine and the second has k parallel machines. An easy‐to‐perform approximate algorithm for minimizing the makespan with one‐unit‐time operations in the first center and k‐unit‐time operations in the second center is proposed. The algorithm has the absolute worst‐case error bound of k − 1, and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2.
科研通智能强力驱动
Strongly Powered by AbleSci AI