Distributionally robust single machine scheduling with the total tardiness criterion
暂无分享,去创建一个
Raymond Chiong | Yuli Zhang | Shiji Song | Jianya Ding | Shengsheng Niu | Shiji Song | Yuli Zhang | R. Chiong | Jianya Ding | Shengsheng Niu
[1] Jinwei Gu,et al. A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem , 2010, Comput. Oper. Res..
[2] Herbert E. Scarf,et al. A Min-Max Solution of an Inventory Problem , 1957 .
[3] Rubén Ruiz,et al. Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics , 2005, Eur. J. Oper. Res..
[4] Wlodzimierz Szwarc,et al. Algorithmic paradoxes of the single‐machine total tardiness problem , 2001 .
[5] Ming Zhao,et al. A family of inequalities valid for the robust single machine scheduling polyhedron , 2010, Comput. Oper. Res..
[6] Jiawei Zhang,et al. Sequencing Appointments for Service Systems Using Inventory Approximations , 2013 .
[7] Xuesong Zhou,et al. Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach , 2011 .
[8] Massimo Paolucci,et al. Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach , 2007, Comput. Oper. Res..
[9] Adam Kurpisz,et al. Approximating a two-machine flow shop scheduling under discrete scenario uncertainty , 2012, Eur. J. Oper. Res..
[10] Chunfu Jia. Stochastic single machine scheduling with an exponentially distributed due date , 2001, Oper. Res. Lett..
[11] Peter Brucker,et al. A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..
[12] Li Chen,et al. Tight Bounds for Some Risk Measures, with Applications to Robust Portfolio Selection , 2011, Oper. Res..
[13] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[14] George L. Vairaktarakis,et al. Robust scheduling of a two-machine flow shop with uncertain processing times , 2000 .
[15] Raymond Chiong,et al. An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..
[16] Zuo-Jun Max Shen,et al. Distributionally Robust Optimization of Two‐Stage Lot‐Sizing Problems , 2016 .
[17] Kuo-Ching Ying,et al. Scheduling the two-machine flowshop to hedge against processing time uncertainty , 2015, J. Oper. Res. Soc..
[18] Jorge M. S. Valente. Beam search heuristics for quadratic earliness and tardiness scheduling , 2010, J. Oper. Res. Soc..
[19] Xiaoqing Xu,et al. Robust makespan minimisation in identical parallel machine scheduling problem with interval data , 2013 .
[20] Panagiotis Kouvelis,et al. Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .
[21] Ceyda Oguz,et al. A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine , 2012, Comput. Oper. Res..
[22] Ghasem Moslehi,et al. A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties , 2012, Comput. Oper. Res..
[23] K. K. H. Ng,et al. Robust Parallel Machine Scheduling Problem with Uncertainties and Sequence-Dependent Setup Time , 2016, Sci. Program..
[24] Christodoulos A. Floudas,et al. A new robust optimization approach for scheduling under uncertainty: II. Uncertainty with known probability distribution , 2007, Comput. Chem. Eng..
[25] Christodoulos A. Floudas,et al. A new robust optimization approach for scheduling under uncertainty: : I. Bounded uncertainty , 2004, Comput. Chem. Eng..
[26] Jun Lin,et al. Hedge against total flow time uncertainty of the uniform parallel machine scheduling problem with interval data , 2014 .
[27] Jonathan Cole Smith,et al. Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems , 2015, J. Sched..
[28] John A. Muckstadt,et al. An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems , 1977, Oper. Res..
[29] Zuo-Jun Max Shen,et al. Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times , 2018, INFORMS J. Comput..
[30] Chung-Cheng Lu,et al. Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times , 2014, Appl. Soft Comput..
[31] John J. Kanet. New Precedence Theorems for One-Machine Weighted Tardiness , 2007, Math. Oper. Res..
[32] Jordi Pereira,et al. The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective , 2016, Comput. Oper. Res..
[33] Rym M'Hallah,et al. Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem , 2016, J. Sched..
[34] Chung-Cheng Lu,et al. Robust scheduling on a single machine to minimize total flow time , 2012, Comput. Oper. Res..
[35] Jian Yang,et al. On the Robust Single Machine Scheduling Problem , 2002, J. Comb. Optim..
[36] Roberto Montemanni,et al. A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data , 2007, J. Math. Model. Algorithms.
[37] J Figueira,et al. Stochastic Programming , 1998, J. Oper. Res. Soc..
[38] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..
[39] Roberto Tadei,et al. A new decomposition approach for the single machine total tardiness scheduling problem , 1998, J. Oper. Res. Soc..
[40] S. L. Velde. Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .
[41] Raymond Chiong,et al. Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption , 2016 .
[42] A. Shapiro. ON DUALITY THEORY OF CONIC LINEAR PROBLEMS , 2001 .
[43] Jiawei Zhang,et al. Appointment Scheduling with Limited Distributional Information , 2013, Manag. Sci..
[44] Chung-Cheng Lu,et al. Robust single machine scheduling for minimizing total flow time in the presence of uncertain processing times , 2014, Comput. Ind. Eng..
[45] Igor Averbakh,et al. Complexity of minimizing the total flow time with interval data and minmax regret criterion , 2006, Discret. Appl. Math..
[46] Shiji Song,et al. Accelerated methods for total tardiness minimisation in no-wait flowshops , 2015 .
[47] H. M. Soroush,et al. Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem , 2007, Eur. J. Oper. Res..
[48] Ihsan Sabuncuoglu,et al. An Efficient Algorithm for the Single Machine Total Tardiness Problem , 2001 .
[49] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[50] Shih-Wei Lin,et al. Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics , 2007 .
[51] Cerry M. Klein,et al. Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models , 2005, Comput. Ind. Eng..
[52] Hossein Soroush,et al. The stochastic single machine scheduling problem with earliness and tardiness costs , 1994 .
[53] Diego Klabjan,et al. Robust Stochastic Lot-Sizing by Means of Histograms , 2013 .
[54] Kenneth R. Baker,et al. Minimizing the number of tardy jobs with stochastically-ordered processing times , 2008, J. Sched..
[55] Tapan Sen,et al. A state-of-art survey of static scheduling research involving due dates , 1984 .
[56] Adam Kasperski. Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion , 2005, Oper. Res. Lett..
[57] Hamilton Emmons,et al. One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..
[58] Jean-François Cordeau,et al. A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times , 2008, Comput. Oper. Res..
[59] Christos Koulamas. A faster fully polynomial approximation scheme for the single-machine total tardiness problem , 2009, Eur. J. Oper. Res..
[60] Oliver Herr,et al. Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints , 2016, Eur. J. Oper. Res..
[61] Cheng Wu,et al. Robust Shortest Path Problem With Distributional Uncertainty , 2018, IEEE Transactions on Intelligent Transportation Systems.
[62] John R. Birge,et al. Introduction to Stochastic Programming , 1997 .
[63] Federico Della Croce,et al. Complexity of single machine scheduling problems under scenario-based uncertainty , 2008, Oper. Res. Lett..
[64] Raymond Chiong,et al. Distributionally robust single machine scheduling with risk aversion , 2017, Eur. J. Oper. Res..
[65] Z. Shen,et al. Lagrangian relaxation for the reliable shortest path problem with correlated link travel times , 2017 .