MINIMIZING MAXIMUM COMPLETION TIME IN A TWO-BATCH-PROCESSING-MACHINE FLOWSHOP WITH DYNAMIC ARRIVALS ALLOWED
暂无分享,去创建一个
[1] Reha Uzsoy,et al. Minimizing total completion time on a batch processing machine with job families , 1993, Oper. Res. Lett..
[2] Kenneth R. Baker,et al. Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..
[3] Yoshiro Ikura,et al. Efficient scheduling algorithms for a single batch processing machine , 1986 .
[4] Uday S. Karmarkar,et al. Batching to minimize flow times on one machine , 1987 .
[5] R. Uzsoy. Scheduling a single batch processing machine with non-identical job sizes , 1994 .
[6] Reha Uzsoy,et al. Minimizing total completion time on batch processing machines , 1993 .
[7] Uday S. Karmarkar,et al. Batching to minimize flow times on parallel heterogeneous machines , 1989 .
[8] Reza H. Ahmadi,et al. Batching and Scheduling Jobs on Batch and Discrete Processors , 1992, Oper. Res..
[9] C. R. Glassey,et al. Dynamic batching heuristic for simultaneous processing , 1991 .
[10] C. S. Sung,et al. Batching to minimize weighted mean flow time on a single machine with batch size restrictions , 1997 .
[11] Reha Uzsoy,et al. Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..
[12] Michael J. Magazine,et al. Batching in single operation manufacturing systems , 1985 .