Multipurpose machine scheduling with rejection and identical job processing times
暂无分享,去创建一个
[1] David J. Evans,et al. Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories , 1985 .
[2] Joseph Y.-T. Leung,et al. Parallel machine scheduling with nested processing set restrictions , 2010, Eur. J. Oper. Res..
[3] Paolo Serafini,et al. Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems , 1987 .
[4] Jean-Charles Billaut,et al. Multicriteria scheduling , 2005, Eur. J. Oper. Res..
[5] Dvir Shabtay,et al. A survey on offline scheduling with rejection , 2013, J. Sched..
[6] A. Volgenant,et al. A branch-and-bound algorithm for the singly constrained assignment problem , 2007, Eur. J. Oper. Res..
[7] László Lovász,et al. Semi-matchings for bipartite graphs and load balancing , 2006, J. Algorithms.
[8] Peter Brucker,et al. Scheduling Algorithms , 1995 .
[9] Peter Brucker,et al. Complexity of scheduling problems with multi-purpose machines , 1997, Ann. Oper. Res..
[10] Joseph Y.-T. Leung,et al. Scheduling jobs with equal processing times subject to machine eligibility constraints , 2010, J. Sched..
[11] Sudipta Sengupta,et al. Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection , 2003, WADS.
[12] Vijay Aggarwal,et al. A Lagrangean-relaxation method for the constrained assignment problem , 1985, Comput. Oper. Res..
[13] Zhigang Cao,et al. A PTAS for parallel batch scheduling with rejection and dynamic job arrivals , 2009, Theor. Comput. Sci..
[14] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[15] Dvir Shabtay,et al. A bicriteria approach to scheduling a single machine with job rejection and positional penalties , 2012, J. Comb. Optim..
[16] Chung-Lun Li,et al. Scheduling with processing set restrictions: A survey , 2008 .
[17] Chung-Lun Li,et al. Scheduling parallel machines with inclusive processing set restrictions , 2008 .
[18] Klaus Jansen,et al. Improved Approximation Schemes for Scheduling Unrelated Parallel Machines , 2001, Math. Oper. Res..
[19] Paul G. Spirakis,et al. Approximation schemes for scheduling and covering on unrelated machines , 2006, Theor. Comput. Sci..
[20] T. C. Edwin Cheng,et al. An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan , 2008, Inf. Process. Lett..
[21] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.
[22] Celia A. Glass,et al. Parallel machine scheduling with job assignment restrictions , 2007 .
[23] Zhigang Cao,et al. Scheduling with Rejection to Minimize the Total Weighted Completion Time , 2009 .
[24] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[25] Chung-Lun Li,et al. Scheduling unit-length jobs with machine eligibility restrictions , 2006, Eur. J. Oper. Res..
[26] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[27] Celia A. Glass,et al. Scheduling unit length jobs with parallel nested machine processing set restrictions , 2006, Comput. Oper. Res..
[28] Han Hoogeveen,et al. Preemptive scheduling with rejection , 2000, Math. Program..
[29] Jinjiang Yuan,et al. Parallel-machine scheduling with deteriorating jobs and rejection , 2010, Theor. Comput. Sci..
[30] Yuzhong Zhang,et al. On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times , 2006, TAMC.
[31] Yuzhong Zhang,et al. Scheduling with Rejection to Minimize the Makespan , 2009, COCOA.
[32] Chor Ping Low,et al. An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique , 2002, Inf. Process. Lett..
[33] Joseph B. Mazzola,et al. Resource-Constrained Assignment Scheduling , 1986, Oper. Res..
[34] D. G. KAFURA,et al. Task Scheduling on a Multiprocessor System with Independent Memories , 1977, SIAM J. Comput..
[35] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[36] Ellis Horowitz,et al. Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.
[37] Jaydev Sharma,et al. Tree search method for optimal core management of pressurised water reactors , 1981, Comput. Oper. Res..
[38] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[39] Chung-Lun Li,et al. Scheduling parallel machines with inclusive processing set restrictions and job release times , 2010, Eur. J. Oper. Res..
[40] Grisselle Centeno,et al. Parallel machine scheduling with release time and machine eligibility restrictions , 1997 .
[41] David R. Karger,et al. Techniques for scheduling with rejection , 1998, J. Algorithms.
[42] Nodari Vakhania,et al. An optimal rounding gives a better approximation for scheduling unrelated machines , 2005, Oper. Res. Lett..
[43] W. A. Horn. Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..
[44] Wenhua Li,et al. Parallel machine scheduling of machine-dependent jobs with unit-length , 2004, Eur. J. Oper. Res..
[45] LeeKangbok,et al. Scheduling jobs with equal processing times subject to machine eligibility constraints , 2011 .