Single machine scheduling with controllable processing times to minimize total tardiness and earliness
暂无分享,去创建一个
[1] Candace Arai Yano,et al. Algorithms for a class of single-machine weighted tardiness and earliness problems , 1991 .
[2] Enric Crespo,et al. Minimizing weighted earliness–tardiness on a single machine with a common due date using quadratic models , 2012 .
[3] George Z. Li. Single machine earliness and tardiness scheduling , 1997 .
[4] Thomas E. Morton,et al. The single machine early/tardy problem , 1989 .
[5] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[6] John M. Wilson,et al. A genetic algorithm for flow shop scheduling problems , 2004, J. Oper. Res. Soc..
[7] Maria Teresa Almeida,et al. A composite heuristic for the single machine early/tardy job scheduling problem , 1998, Comput. Oper. Res..
[8] Mohamed Ben-Daya,et al. A simulated annealing approach for the one-machine mean tardiness scheduling problem , 1996 .
[9] Safia Kedad-Sidhoum,et al. The One-Machine Problem with Earliness and Tardiness Penalties , 2003, J. Sched..
[10] Subhash C. Sarin,et al. A heuristic to minimize total flow time in permutation flow shop , 2009 .
[11] T. S. Abdul-Razaq,et al. Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .
[12] S. S. Panwalkar,et al. Single-machine sequencing with controllable processing times , 1992 .
[13] Frederick S. Hillier,et al. Introduction of Operations Research , 1967 .
[14] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[15] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[16] Jorge M. S. Valente,et al. Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties , 2008, Comput. Oper. Res..
[17] Safia Kedad-Sidhoum,et al. A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem , 2008, J. Sched..
[18] Ji-Bo Wang. Single machine scheduling with common due date and controllable processing times , 2006, Appl. Math. Comput..
[19] Stanislaw Zdrzalka. Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis , 1991, Oper. Res. Lett..
[20] Jorge M. S. Valente. Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time , 2008, Comput. Ind. Eng..
[21] Mesbah U. Ahmed,et al. Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .
[22] Frederick S. Hillier,et al. Introduction of Operations Research , 1967 .
[23] Han Hoogeveen,et al. Multicriteria scheduling , 2005, Eur. J. Oper. Res..
[24] Russell J. Hemley,et al. A pressing matter , 2006 .
[25] Zhi-Long Chen,et al. Single machine scheduling with discretely controllable processing times , 1997, Oper. Res. Lett..
[26] Krishnendu Ghosh,et al. Application of robotics to steady state enzyme kinetics: analysis of tight-binding inhibitors of dipeptidyl peptidase IV. , 2003, Analytical biochemistry.
[27] Francis Sourd,et al. Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem , 2006, Eur. J. Oper. Res..
[28] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[29] John J. Kanet,et al. Single-machine scheduling with early and tardy completion costs , 1993 .
[30] Jorge M. S. Valente,et al. Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties , 2009 .
[31] T.C.E. Cheng,et al. SINGLE-MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND EARLINESS, TARDINESS AND COMPLETION TIME PENALTIES , 1999 .
[32] Eugeniusz Nowicki,et al. A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..
[33] J. Delcour,et al. Potential role of glycosidase inhibitors in industrial biotechnological applications. , 2004, Biochimica et biophysica acta.
[34] Bahram Alidaee,et al. Two parallel machine sequencing problems involving controllable job processing times , 1993 .
[35] Sinan Gürel,et al. Scheduling parallel CNC machines with time/cost trade-off considerations , 2007, Comput. Oper. Res..
[36] Stephen F. Smith,et al. Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics , 2005, J. Heuristics.
[37] Jorge M. S. Valente,et al. Improved heuristics for the early/tardy scheduling problem with no idle time , 2005, Comput. Oper. Res..
[38] Gq Huang,et al. Computers & Industrial Engineering , 2015 .
[39] Joanna Józefowska,et al. Just-in-Time Scheduling : Models and Algorithms for Computer and Manufacturing Systems , 2007 .
[40] Mehmet O. Atan,et al. Single CNC machine scheduling with controllable processing times and multiple due dates , 2008 .
[41] Chao-Tang Tseng,et al. Minimizing total tardiness on a single machine with controllable processing times , 2009, Comput. Oper. Res..
[42] Kerem Bülbül,et al. Preemption in single machine earliness/tardiness scheduling , 2007 .
[43] M. Selim Akturk,et al. A new bounding mechanism for the CNC machine scheduling problems with controllable processing times , 2005, Eur. J. Oper. Res..
[44] Jorge M. S. Valente,et al. An exact approach to early/tardy scheduling with release dates , 2005, Comput. Oper. Res..
[45] Raymond G. Vickson,et al. Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .
[46] Zuren Feng,et al. A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates , 2010, Comput. Oper. Res..
[47] Dvir Shabtay,et al. A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..