Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
暂无分享,去创建一个
[1] Satoru Fujishige,et al. Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector , 1980, Math. Oper. Res..
[2] Peter Brucker,et al. Scheduling Algorithms , 1995 .
[3] Dvir Shabtay,et al. A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..
[4] Sartaj Sahni,et al. Scheduling Independent Tasks with Due Times on a Uniform Processor System , 1980, JACM.
[5] Vitaly A. Strusevich,et al. Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times , 2015, Math. Program..
[6] Teofilo F. Gonzalez,et al. Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.
[7] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .
[8] Hazel Everett,et al. An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems , 1993, SCG '93.
[9] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[10] S. Thomas McCormick. Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow , 1999, Oper. Res..
[11] Kevin I.-J. Ho. Dual Criteria Optimization Problems for Imprecise Computation Tasks , 2004, Handbook of Scheduling.
[12] W. A. Horn. Some simple scheduling algorithms , 1974 .
[13] Eugeniusz Nowicki,et al. A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..
[14] Vitaly A. Strusevich,et al. Pre-Emptive Scheduling Problems with Controllable Processing Times , 2005, J. Sched..
[15] Vitaly A. Strusevich,et al. Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines , 2016, INFORMS J. Comput..
[16] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .
[17] H. Everett,et al. AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS , 1996 .
[18] Vitaly A. Strusevich,et al. Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches , 2018, Eur. J. Oper. Res..
[19] Sartaj Sahni,et al. Preemptive Scheduling with Due Dates , 1979, Oper. Res..
[20] Klaus Jansen,et al. Parallel Machine Scheduling Problems with Controllable Processing Times , 2000, ICALP Satellite Workshops.
[21] Satoru Iwata,et al. A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.
[22] Noga Alon,et al. The number of small semispaces of a finite set of points in the plane , 1986, J. Comb. Theory, Ser. A.
[23] Dorit S. Hochbaum,et al. About strongly polynomial time algorithms for quadratic optimization over submodular constraints , 1995, Math. Program..
[24] D. Teichroew,et al. Optimal Short Term Financing Decision , 1965 .
[25] Awi Federgruen,et al. Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques , 1986 .
[26] Naoki Katoh,et al. Resource Allocation Problems , 1998 .
[27] Adam Janiak,et al. Single machine scheduling subject to deadlines and resource dependent processing times , 1996 .
[28] Joseph Y.-T. Leung,et al. Minimizing Maximum Weighted Error for Imprecise Computation Tasks , 1994, J. Algorithms.
[29] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.
[30] Robert E. Tarjan,et al. A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..
[31] Vitaly A. Strusevich,et al. A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines , 2013, SIAM J. Discret. Math..