Scheduling equal length jobs with eligibility restrictions
暂无分享,去创建一个
[1] Shi Li,et al. Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[2] Shi Li,et al. Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform Distributions , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[3] Frank Werner,et al. Parallel machine problems with equal processing times: a survey , 2011, J. Sched..
[4] Joseph Y.-T. Leung,et al. Scheduling jobs with equal processing times subject to machine eligibility constraints , 2010, J. Sched..
[5] Chung-Lun Li,et al. Scheduling with processing set restrictions: A survey , 2008 .
[6] Peter Brucker,et al. Scheduling jobs with equal processing times and time windows on identical parallel machines , 2008, J. Sched..
[7] Chung-Lun Li,et al. Scheduling unit-length jobs with machine eligibility restrictions , 2006, Eur. J. Oper. Res..
[8] Celia A. Glass,et al. Scheduling unit length jobs with parallel nested machine processing set restrictions , 2006, Comput. Oper. Res..
[9] Kangbok Lee,et al. Parallel machine scheduling under a grade of service provision , 2004, Comput. Oper. Res..
[10] Philippe Baptiste,et al. Ten notes on equal-processing-time scheduling , 2004, 4OR.
[11] Martin Skutella,et al. Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.
[12] Evripidis Bampis,et al. Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[13] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[14] Peter Brucker,et al. Complexity of scheduling problems with multi-purpose machines , 1997, Ann. Oper. Res..
[15] Michael Pinedo. Scheduling: Theory, Algorithms, and Systems , 1994 .
[16] Barbara B. Simons,et al. Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines , 1983, SIAM J. Comput..
[17] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.
[18] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .