Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations
暂无分享,去创建一个
[1] J. Berlińska. Scheduling for data gathering networks with data compression , 2015, Eur. J. Oper. Res..
[2] Hanyu Gu,et al. Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements , 2018, J. Discrete Algorithms.
[3] Haldun Süral,et al. Scheduling unit-time tasks in renewable resource constrained flowshops , 1992, ZOR Methods Model. Oper. Res..
[4] Yao Xu,et al. Algorithms for Communication Scheduling in Data Gathering Network with Data Compression , 2017, Algorithmica.
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] J. Błażewicz,et al. Scheduling unit — time tasks on flow — shops under resource constraints , 1988 .
[7] Joanna Berlińska. Heuristics for scheduling data gathering with limited base station memory , 2020, Ann. Oper. Res..
[8] Jan Karel Lenstra,et al. Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..
[9] Yakov Zinder,et al. Permutation schedules for a two-machine flow shop with storage , 2016, Oper. Res. Lett..
[10] Joanna Berlinska. Scheduling Data Gathering with Maximum Lateness Objective , 2017, PPAM.
[11] G. S. Lueker,et al. Bin packing can be solved within 1 + ε in linear time , 1981 .