共 35 条
[1]
Berlińska J(2020)Heuristics for scheduling data gathering with limited base station memory Ann Oper Res 285 149-159
[2]
Blazewicz J(1983)Scheduling subject to resource constraints: classification and complexity Discret Appl Math 5 11-24
[3]
Lenstra JK(2015)Capacity planning in supply chains of mineral resources Inform Sci 316 397-418
[4]
Rinnooy Kan AHG(2016)Permutation schedules for a two-machine flow shop with storage Oper Res Lett 44 153-157
[5]
Fung J(2018)Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements J Discrete Algorithms 52–53 143-155
[6]
Singh G(1935)On representatives of subsets J London Math Soc 10 26-30
[7]
Zinder Y(2008)Multigraph realizations of degree sequences: maximization is easy, minimization is hard Oper Res Lett 36 594-596
[8]
Fung J(1954)Optimal two-and three-stage production schedules with setup times included Naval Res Logist Q 1 61-68
[9]
Zinder Y(2012)Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications J Sched 15 487-497
[10]
Hanyu G(2012)A complete 4-parametric complexity classification of short shop scheduling problems J Sched 15 427-446