A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
暂无分享,去创建一个
We address a batch scheduling problem of n identical processing time jobs on an m-machine flow-shop and a 2-machine job-shop. The objective is makespan minimization. Both problems are shown to be solved in O(n).
[1] Chris N. Potts,et al. Scheduling with batching: A review , 2000, Eur. J. Oper. Res..
[2] J. K. Lenstra,et al. Computational complexity of discrete optimization problems , 1977 .
[3] Bertrand M. T. Lin,et al. Makespan minimization in the two‐machine flowshop batch scheduling problem , 2000 .
[4] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .