Scheduling unit length jobs on parallel machines with lookahead information
暂无分享,去创建一个
[1] Kangbok Lee,et al. Parallel machine scheduling under a grade of service provision , 2004, Comput. Oper. Res..
[2] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[3] Peter Schuur,et al. On-line scheduling of multi-server batch operations , 2001 .
[4] Kirk Pruhs,et al. Online scheduling , 2003 .
[5] Ramaswamy Chandrasekaran,et al. Improved Bounds for the Online Scheduling Problem , 2003, SIAM J. Comput..
[6] Peter Brucker,et al. Scheduling Algorithms , 1995 .
[7] Nodari Vakhania,et al. An optimal rounding gives a better approximation for scheduling unrelated machines , 2005, Oper. Res. Lett..
[8] He Yong,et al. Optimal online algorithms for scheduling on two identical machines under a grade of service , 2006 .
[9] Durk-Jouke van der Zee. Dynamic scheduling II: look-ahead strategies for controlling batch operations in industry — an overview , 2003, WSC '03.
[10] D.-J. van der Zee. Look-ahead strategies for controlling batch operations in industry - an overview , 2003, Proceedings of the 2003 Winter Simulation Conference, 2003..
[11] Kangbok Lee,et al. Online and semi-online scheduling of two machines under a grade of service provision , 2006, Oper. Res. Lett..
[12] László Lovász,et al. Semi-matchings for bipartite graphs and load balancing , 2006, J. Algorithms.
[13] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.
[14] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[15] Zhiyi Tan,et al. New upper and lower bounds for online scheduling with machine cost , 2010, Discret. Optim..
[16] Celia A. Glass,et al. Scheduling unit length jobs with parallel nested machine processing set restrictions , 2006, Comput. Oper. Res..
[17] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[18] Wang Youyi,et al. Lookahead control policies and decision rules for dynamic scheduling of an FMS , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.
[19] Chung-Lun Li,et al. Scheduling with processing set restrictions: A survey , 2008 .
[20] Gerhard J. Woeginger,et al. An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling , 1993, SIAM J. Comput..
[21] Ben Coleman. Quality vs. Performance in Lookahead Scheduling , 2006, JCIS.
[22] Celia A. Glass,et al. Parallel machine scheduling with job assignment restrictions , 2007 .
[23] Joseph Naor,et al. On-Line Load Balancing in a Hierarchical Server Topology , 2002, SIAM J. Comput..
[24] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[25] Soo Y. Chang,et al. A posterior Competitiveness for List Scheduling Algorithm on Machines with Eligibility Constraints , 2004, Asia Pac. J. Oper. Res..
[26] S.J. Beaty. Lookahead Scheduling , 1992, [1992] Proceedings the 25th Annual International Symposium on Microarchitecture MICRO 25.
[27] Jiri Sgall,et al. On-line scheduling --- a survey , 1997 .
[28] Benjamin J. Coleman,et al. Lookahead scheduling in a real-time context: Models, algorithms, and analysis , 2004 .
[29] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[30] Joseph Y.-T. Leung,et al. Parallel machine scheduling with nested processing set restrictions , 2010, Eur. J. Oper. Res..
[31] Chung-Lun Li,et al. Scheduling parallel machines with inclusive processing set restrictions , 2008 .
[32] Susanne Albers,et al. Online algorithms: a survey , 2003, Math. Program..
[33] Joseph Y.-T. Leung,et al. Scheduling jobs with equal processing times subject to machine eligibility constraints , 2010, J. Sched..
[34] Susanne Albers,et al. On the Influence of Lookahead in Competitive Paging Algorithms , 1997, Algorithmica.
[35] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[36] George L. Vairaktarakis,et al. The Value of Processing Flexibility in Multipurpose Machines , 2003 .
[37] D. G. KAFURA,et al. Task Scheduling on a Multiprocessor System with Independent Memories , 1977, SIAM J. Comput..
[38] Edward F. Grove. Online bin packing with lookahead , 1995, SODA '95.
[39] Gerhard J. Woeginger,et al. New lower and upper bounds for on-line scheduling , 1994, Oper. Res. Lett..
[40] Michael Pinedo. Offline Deterministic Scheduling, Stochastic Scheduling, and Online Deterministic Scheduling , 2004, Handbook of Scheduling.
[41] Wenhua Li,et al. Parallel machine scheduling of machine-dependent jobs with unit-length , 2004, Eur. J. Oper. Res..
[42] David R. Karger,et al. A better algorithm for an ancient scheduling problem , 1994, SODA '94.
[43] Zhou Ping,et al. Parallel machine scheduling problem with two GoS levels , 2007 .
[44] Susanne Albers,et al. On‐Line Algorithms , 2013 .