Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
暂无分享,去创建一个
[1] Lionel Dupont,et al. Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes , 1998 .
[2] Scott J. Mason,et al. Forming and scheduling jobs from multiple orders with different attributes: A computational study of special cases , 2004 .
[3] Young Hwan Kim,et al. A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines , 2000, Eur. J. Oper. Res..
[4] Chris N. Potts,et al. Flow shop scheduling with lot streaming , 1989 .
[5] Huan Neng Chiu,et al. A comprehensive review of lot streaming , 2005 .
[6] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[7] Reza H. Ahmadi,et al. Batching and Scheduling Jobs on Batch and Discrete Processors , 1992, Oper. Res..
[8] R. Uzsoy. Scheduling a single batch processing machine with non-identical job sizes , 1994 .
[9] Chris N. Potts,et al. Scheduling with batching: A review , 2000, Eur. J. Oper. Res..
[10] T.C.E. Cheng,et al. Single machine batch scheduling with sequential job processing , 2001 .
[11] John W. Fowler,et al. The single machine multiple orders per job scheduling problem , 2004 .
[12] Gregory Dobson,et al. The Batch Loading and Scheduling Problem , 2001, Oper. Res..