Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements
暂无分享,去创建一个
[1] Feng-Cheng Lin,et al. Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications , 2012, J. Sched..
[2] Feng-Cheng Lin,et al. Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries , 2008, Data Knowl. Eng..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Peter Brucker,et al. Complex Scheduling , 2006 .
[5] Bertrand M. T. Lin,et al. A two-machine flowshop problem with processing time-dependent buffer constraints - An application in multimedia presentations , 2009, Comput. Oper. Res..
[6] Yakov Zinder,et al. Permutation schedules for a two-machine flow shop with storage , 2016, Oper. Res. Lett..
[7] Andreas Witt,et al. Simple heuristics for scheduling with limited intermediate storage , 2007, Comput. Oper. Res..
[8] I. Hamilton Emmons,et al. Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications , 2012 .
[9] Feng‐Cheng Lin,et al. Heuristic algorithms for ordering media objects to reduce presentation lags in auto-assembled multimedia presentations from digital libraries , 2009, Electron. Libr..
[10] Marshall L. Fisher,et al. The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..
[11] Bertrand M. T. Lin,et al. Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries , 2013, Inf. Syst..