A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
暂无分享,去创建一个
Ran Ma | Sainan Guo | Cuixia Miao | Cuixia Miao | Ran Ma | Sainan Guo
[1] Maxim Sviridenko,et al. Tight Bounds for Permutation Flow Shop Scheduling , 2009, Math. Oper. Res..
[2] Yugeng Xi,et al. A SEMI-ONLINE ALGORITHM AND ITS COMPETITIVE ANALYSIS FOR A SINGLE MACHINE SCHEDULING PROBLEM WITH BOUNDED PROCESSING TIMES , 2010 .
[3] Michael Pinedo,et al. On the parameterized tractability of single machine scheduling with rejection , 2019, Eur. J. Oper. Res..
[4] Mario Vanhoucke,et al. An exact composite lower bound strategy for the resource-constrained project scheduling problem , 2018, Comput. Oper. Res..
[5] Jinjiang Yuan,et al. Online scheduling to minimize the total weighted completion time plus the rejection cost , 2017, J. Comb. Optim..
[6] David Simchi-Levi,et al. Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates , 2001, Oper. Res. Lett..
[7] Gerhard J. Woeginger,et al. Competitive Analysis of Algorithms , 1996, Online Algorithms.
[8] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[9] Roberto Cordone,et al. A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization , 2019, Comput. Oper. Res..
[10] José R. Correa,et al. LP-based online scheduling: from single to parallel machines , 2005, Math. Program..
[11] Jinjiang Yuan,et al. Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost , 2013, Inf. Process. Lett..
[12] Jinjiang Yuan,et al. Single machine scheduling with release dates and rejection , 2009, Eur. J. Oper. Res..
[13] Jinjiang Yuan,et al. Online Scheduling with Rejection to Minimize the Total Weighted Completion Time Plus the Total Rejection Cost on Parallel Machines , 2016 .
[14] Yong He,et al. Semi-online scheduling jobs with tightly-grouped processing times on three identical machines , 2005, Discret. Appl. Math..
[15] Dailun Shi,et al. Flow Shop Scheduling with Partial Resource Flexibility , 2004, Manag. Sci..
[16] Minjiao Zhang,et al. Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval , 2013, Appl. Math. Comput..
[17] Steven S. Seiden. Preemptive multiprocessor scheduling with rejection , 2001, Theor. Comput. Sci..
[18] Han Hoogeveen,et al. Optimal On-Line Algorithms for Single-Machine Scheduling , 1996, IPCO.
[19] Rajeev Motwani,et al. Approximation techniques for average completion time scheduling , 1997, SODA '97.
[20] C. T. Ng,et al. Optimal algorithms for single-machine scheduling with rejection to minimize the makespan , 2011 .
[21] Leen Stougie,et al. Multiprocessor scheduling with rejection , 1996, SODA '96.
[22] Leen Stougie,et al. A class of on-line scheduling algorithms to minimize total completion time , 2003, Oper. Res. Lett..
[23] Ye Tao,et al. An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time , 2010, Inf. Process. Lett..
[24] David Simchi-Levi,et al. The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates , 2001, Math. Program..
[25] Cheng-Feng Mabel Chou. Asymptotic performance ratio of an online algorithm for the single machine scheduling with release dates , 2004, IEEE Transactions on Automatic Control.
[26] Gerhard J. Woeginger,et al. On-line scheduling of unit time jobs with rejection: minimizing the total completion time , 2002, Oper. Res. Lett..
[27] Xiwen Lu,et al. On-line scheduling of parallel machines to minimize total completion times , 2009, Comput. Oper. Res..
[28] Cynthia A. Phillips,et al. Minimizing average completion time in the presence of release dates , 1998, Math. Program..