Scheduling parallel machines to minimize weighted flowtime with family set-up times
暂无分享,去创建一个
[1] S. T. Webster,et al. The complexity of scheduling job families about a common due date , 1997, Oper. Res. Lett..
[2] Byong-Hun Ahn,et al. Single facility multi-class job scheduling , 1990, Comput. Oper. Res..
[3] Chris N. Potts,et al. Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .
[4] Meral Azizoglu,et al. Dynamic programming algorithms for scheduling parallel machines with family setup times , 2001, Comput. Oper. Res..
[5] Chris N. Potts,et al. Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time , 1998, Ann. Oper. Res..
[6] Kenneth R. Baker,et al. Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..
[7] Chris N. Potts,et al. Scheduling with batching: A review , 2000, Eur. J. Oper. Res..
[8] J. M. J. Schutten,et al. List scheduling revisited , 1996, Oper. Res. Lett..
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Kenneth R. Baker,et al. Lower bounds and algorithms for flowtime minimization on a single machine with set-up times , 2000 .
[11] Jatinder N. D. Gupta,et al. A review of scheduling research involving setup considerations , 1999 .
[12] David Niranjan Williams. Machine scheduling problems with setup times , 1993 .
[13] Edward Anderson,et al. Minimizing flow time on a single machine with job classes and setup times , 1991 .
[14] John L. Bruno,et al. Task Sequencing in a Batch Environment with Setup Times , 1976, Performance.
[15] Scott Webster,et al. Weighted flow time bounds for scheduling identical processors , 1995 .
[16] Clyde L. Monma,et al. On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..