Dynamic Programming algorithms and their applications in machine scheduling: A review

[1]  Safia Kedad-Sidhoum,et al.  Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates , 2008, Eur. J. Oper. Res..

[2]  Yann Hendel-Francis Sourd.  Efficient neighborhood search for Just-in-Time scheduling problems , 2003 .

[3]  J. A. Hoogeveen,et al.  Scheduling around a small common due date , 1991 .

[4]  Socorro Rangel,et al.  A survey of case studies in production scheduling: Analysis and perspectives , 2017, J. Comput. Sci..

[5]  Ansis Ozolins,et al.  A new exact algorithm for no-wait job shop problem to minimize makespan , 2018, Oper. Res..

[6]  Abdelhakim Artiba,et al.  Scheduling of a two-machine flowshop with availability constraints on the first machine , 2006 .

[7]  Ying Zhang,et al.  Single-machine scheduling problems with machine aging effect and an optional maintenance activity , 2016 .

[8]  Suresh P. Sethi,et al.  Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..

[9]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[10]  Ik Sun Lee,et al.  Parallel machine scheduling with maintenance activities , 2016, Comput. Ind. Eng..

[11]  Philippe Baptiste,et al.  An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1999, Oper. Res. Lett..

[12]  Jacek Blazewicz,et al.  A note on the two machine job shop with the weighted late work criterion , 2007, J. Sched..

[13]  Lin Chen,et al.  Approximation schemes for two-machine flow shop scheduling with two agents , 2012, J. Comb. Optim..

[14]  Lei Shang,et al.  Exact exponential algorithms for 3-machine flowshop scheduling problems , 2017, Journal of Scheduling.

[15]  Malgorzata Sterna,et al.  A comparison of solution procedures for two-machine flow shop scheduling with late work criterion , 2005, Comput. Ind. Eng..

[16]  Suresh Chand,et al.  Single machine scheduling to minimize weighted earliness subject to no tardy jobs , 1988 .

[17]  V. Srinivasan.  A hybrid algorithm for the one machine sequencing problem to minimize total tardiness , 1971 .

[18]  Li Zhou,et al.  Scheduling resumable deteriorating jobs on a single machine with non-availability constraints , 2011, Theor. Comput. Sci..

[19]  Giovanni Righini,et al.  A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times , 2009, Math. Methods Oper. Res..

[20]  Joaquín Bautista,et al.  A dynamic programming based heuristic for the assembly line balancing problem , 2009, Eur. J. Oper. Res..

[21]  Vitaly A. Strusevich,et al.  Planning Machine Maintenance in Two-Machine Shop Scheduling , 2006, Oper. Res..

[22]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[23]  Francisco Saldanha-da-Gama,et al.  Solving the job-shop scheduling problem optimally by dynamic programming , 2012, Comput. Oper. Res..

[24]  Guoqing Wang,et al.  Parallel machine earliness and tardiness scheduling with proportional weights , 2003, Comput. Oper. Res..

[25]  Ansis Ozolins,et al.  Improved bounded dynamic programming algorithm for solving the blocking flow shop problem , 2019, Central Eur. J. Oper. Res..

[26]  Thomas L. Morin,et al.  Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming , 1992, Comput. Oper. Res..

[27]  Boris Detienne,et al.  An iterative dynamic programming approach for the temporal knapsack problem , 2019, Eur. J. Oper. Res..

[28]  Zhi-Long Chen,et al.  Simultaneous Job Scheduling and Resource Allocation on Parallel Machines , 2004, Ann. Oper. Res..

[29]  Christos Koulamas,et al.  The proportionate flow shop total tardiness problem , 2020, Eur. J. Oper. Res..

[30]  Dana Shapira,et al.  Flowshop scheduling with learning effect and job rejection , 2019, Journal of Scheduling.

[31]  Kenneth R. Baker.  Computational Experience with a Sequencing Algorithm Adapted to the Tardiness Problem , 1977 .

[32]  José M. Valério de Carvalho,et al.  A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times , 2007, Eur. J. Oper. Res..

[33]  Shao Chin Sung,et al.  Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines , 2005, J. Sched..

[34]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[35]  T. C. Edwin Cheng,et al.  Single machine scheduling with deadlines and increasing rates of processing times , 2000, Acta Informatica.

[36]  Candace Arai Yano,et al.  Algorithms for a class of single-machine weighted tardiness and earliness problems , 1991 .

[37]  Yunqiang Yin,et al.  Just-in-time scheduling with two competing agents on unrelated parallel machines ☆ , 2016 .

[38]  Salim Rostami,et al.  Precedence theorems and dynamic programming for the single-machine weighted tardiness problem , 2019, Eur. J. Oper. Res..

[39]  S. L. Velde.  Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .

[40]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[41]  Bahram Alidaee.  Schedule of n jobs on two identical machines to minimize weighted mean flow time , 1993 .

[42]  Chin-Chia Wu,et al.  Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop , 2017 .

[43]  T. C. Edwin Cheng,et al.  Single-machine scheduling with a common due window , 2001, Comput. Oper. Res..

[44]  Christos Koulamas,et al.  The no-wait flow shop with rejection , 2020, Int. J. Prod. Res..

[45]  Eun-Seok Kim,et al.  Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints , 2009, Comput. Oper. Res..

[46]  R Bellman,et al.  On the Theory of Dynamic Programming. , 1952, Proceedings of the National Academy of Sciences of the United States of America.

[47]  Warren B. Powell,et al.  Exact algorithms for scheduling multiple families of jobs on parallel machines , 2003 .

[48]  L. V. Wassenhove,et al.  Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .

[49]  Augustine O. Esogbue,et al.  Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach , 1974 .

[50]  Bertrand M. T. Lin,et al.  Scheduling step-deteriorating jobs to minimize the total completion time , 2020, Comput. Ind. Eng..

[51]  Christelle Guéret,et al.  A new lower bound for the open‐shop problem , 1999, Ann. Oper. Res..

[52]  Jose A. Ventura,et al.  Scheduling about a given common due date to minimize mean squared deviation of completion times , 1996 .

[53]  Shunji Tanaka,et al.  An exact algorithm for the precedence-constrained single-machine scheduling problem , 2013, Eur. J. Oper. Res..

[54]  Hans Kellerer,et al.  Scheduling parallel dedicated machines with the speeding‐up resource , 2003 .

[55]  T. C. Edwin Cheng,et al.  Bicriterion Single Machine Scheduling with Resource Dependent Processing Times , 1998, SIAM J. Optim..

[56]  Prabuddha De,et al.  On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..

[57]  Sushil K. Gupta,et al.  Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem , 1990 .

[58]  Jatinder N. D. Gupta,et al.  Two-machine flowshop scheduling with a secondary criterion , 2003, Comput. Oper. Res..

[59]  Chris N. Potts,et al.  Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach , 2005, Eur. J. Oper. Res..

[60]  Ansis Ozolins,et al.  Dynamic programming approach for solving the open shop problem , 2019, Central European Journal of Operations Research.

[61]  Linus Schrage,et al.  Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

[62]  Federico Della Croce,et al.  Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights , 2020, J. Comb. Optim..

[63]  Ansis Ozolins,et al.  Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times , 2020, Oper. Res..

[64]  Eugene Levner,et al.  Fast approximation algorithm for job sequencing with deadlines , 1981, Discret. Appl. Math..

[65]  Wang Yong,et al.  Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect , 2015, Appl. Math. Comput..

[66]  T.C.E. Cheng,et al.  Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work , 2016 .

[67]  Jatinder N. D. Gupta,et al.  SCHEDULING JOBS ON PARALLEL PROCESSORS WITH DYNAMIC PROGRAMMING , 1973 .

[68]  Chris N. Potts,et al.  Scheduling with Fixed Delivery Dates , 2001, Oper. Res..

[69]  Egon Balas,et al.  Job shop scheduling with setup times, deadlines and precedence constraints , 2008, J. Sched..

[70]  Ludo Gelders,et al.  Four solution techniques for a general one machine scheduling problem: A comparative study , 1978 .

[71]  Shisheng Li,et al.  Scheduling Proportionally deteriorating Jobs in Two-Machine Open shop with a Non-Bottleneck Machine , 2011, Asia Pac. J. Oper. Res..

[72]  Jean-Charles Billaut,et al.  A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines , 2010, Eur. J. Oper. Res..

[73]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[74]  Wieslaw Kubiak,et al.  Scheduling shops to minimize the weighted number of late jobs , 1994, Oper. Res. Lett..

[75]  Richard Bellman,et al.  Functional equations in dynamic programming , 1978 .

[76]  Daniel Grosu,et al.  Scheduling parallel identical machines to minimize makespan: A parallel approximation algorithm , 2019, J. Parallel Distributed Comput..

[77]  Jinjiang Yuan,et al.  Parallel-machine scheduling with deteriorating jobs and rejection , 2010, Theor. Comput. Sci..

[78]  Lixin Tang,et al.  A new ILS algorithm for parallel machine scheduling problems , 2006, J. Intell. Manuf..

[79]  Gur Mosheiov,et al.  Single machine scheduling to minimize the number of early and tardy jobs , 1996, Comput. Oper. Res..

[80]  Shijie Sun,et al.  Scheduling linear deteriorating jobs with rejection on a single machine , 2009, Eur. J. Oper. Res..

[81]  Lucio Bianco,et al.  Minimizing total completion time subject to release dates and sequence‐dependentprocessing times , 1999, Ann. Oper. Res..

[82]  Chung-Lun Li,et al.  A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs , 1995, Comput. Oper. Res..

[83]  Scott Webster,et al.  A note on “Schedule of n jobs on two identical machines to minimize weighted mean flow time” , 1994 .

[84]  Jose A. Ventura,et al.  Single machine earliness-tardiness scheduling with resource-dependent release dates , 2002, Eur. J. Oper. Res..

[85]  Vitaly A. Strusevich,et al.  An open shop scheduling problem with a non-bottleneck machine , 1997, Oper. Res. Lett..

[86]  J. Wesley Barnes,et al.  Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs , 1981, Oper. Res..

[87]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[88]  Chung-Yee Lee,et al.  Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..

[89]  Radosław Rudek,et al.  Parallel machine scheduling with general sum of processing time based models , 2017, J. Glob. Optim..

[90]  Wieslaw Kubiak,et al.  Scheduling deteriorating jobs to minimize makespan , 1998 .

[91]  Xin Chen,et al.  Scheduling on parallel identical machines with late work criterion: Offline and online cases , 2016, J. Sched..

[92]  Yunqiang Yin,et al.  Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria , 2018, J. Sched..

[93]  V. Reddy Dondeti,et al.  Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs , 1998, Eur. J. Oper. Res..

[94]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[95]  Daniel Oron,et al.  A note on scheduling a rate modifying activity to minimize total late work , 2021, Comput. Ind. Eng..

[96]  Klaus Jansen,et al.  Parallel Machine Scheduling Problems with Controllable Processing Times , 2000, ICALP Satellite Workshops.

[97]  Patrick De Causmaecker,et al.  Minimizing makespan on a single machine with release dates and inventory constraints , 2020, Eur. J. Oper. Res..

[98]  Adil Baykasoğlu,et al.  A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates , 1998 .

[99]  N. Alon,et al.  Approximation schemes for scheduling on parallel machines , 1998 .

[100]  Xiwen Lu,et al.  Approximation schemes for two-agent scheduling on parallel machines , 2013, Theor. Comput. Sci..

[101]  Toshihide Ibaraki,et al.  A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..

[102]  A. M. A. Hariri,et al.  Single machine scheduling with deadlines to minimize the weighted number of tardy jobs , 1994 .

[103]  Surya D. Liman,et al.  Earliness-tardiness scheduling problems with a common delivery window , 1994, Oper. Res. Lett..

[104]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[105]  P. De,et al.  Due‐date assignment and early/tardy scheduling on identical parallel machines , 1994 .

[106]  Chengbin Chu,et al.  Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times , 2009, Eur. J. Oper. Res..

[107]  Peter B. Luh,et al.  An optimization-based algorithm for job shop scheduling , 1997 .

[108]  Weiming Shen,et al.  A desired load distribution model for scheduling of unrelated parallel machines , 2005 .

[109]  Milind Dawande,et al.  Scheduling a two-stage flowshop under makespan constraint , 2006, Math. Comput. Model..

[110]  Ceyda Oguz,et al.  Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs , 2009 .

[111]  Jinjiang Yuan,et al.  Two-machine open-shop scheduling with rejection to minimize the makespan , 2016, OR Spectr..

[112]  Klaus Jansen,et al.  Improved Approximation Schemes for Scheduling Unrelated Parallel Machines , 2001, Math. Oper. Res..

[113]  Heng-Yong Tang,et al.  Single Machine Scheduling with Linear deteriorating Jobs under Predictive Disruption , 2011, Asia Pac. J. Oper. Res..

[114]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[115]  Gerhard J. Woeginger,et al.  When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? , 2000, INFORMS J. Comput..

[116]  Peter B. Luh,et al.  Job shop scheduling with group-dependent setups, finite buffers, and long time horizon , 1998, Ann. Oper. Res..

[117]  Lixin Tang,et al.  A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates , 2011, Int. J. Syst. Sci..

[118]  T.C.E. Cheng,et al.  Four single-machine scheduling problems involving due date determination decisions , 2013, Inf. Sci..

[119]  Chung-Lun Li,et al.  Scheduling parallel machines with inclusive processing set restrictions and job release times , 2010, Eur. J. Oper. Res..

[120]  Philippe Baptiste,et al.  Lagrangian bounds for just-in-time job-shop scheduling , 2008, Comput. Oper. Res..

[121]  Han Hoogeveen,et al.  Parallel Machine Scheduling by Column Generation , 1999, Oper. Res..

[122]  Chin-Chia Wu,et al.  Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs , 2014, Appl. Math. Comput..

[123]  Kenneth R. Baker,et al.  Scheduling with parallel processors and linear delay costs , 1973 .

[124]  Kut C. So,et al.  Some heuristics for scheduling jobs on parallel machines with setups , 1990 .

[125]  Maher Rebai,et al.  Scheduling jobs and maintenance activities on parallel machines , 2013, Oper. Res..

[126]  Jean-Charles Billaut,et al.  Two-machine flow shop scheduling problems with no-wait jobs , 2005, Oper. Res. Lett..

[127]  Vitaly A. Strusevich,et al.  The open shop scheduling problem with a given sequence of jobs on one machine , 1998 .

[128]  Philippe Baptiste,et al.  Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times , 1999 .

[129]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

[130]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Weighted Late Work , 1995, INFORMS J. Comput..

[131]  Dujuan Wang,et al.  A two-agent single-machine scheduling problem with late work criteria , 2017, Soft Comput..

[132]  Malgorzata Sterna,et al.  The two-machine flow-shop problem with weighted late work criterion and common due date , 2005, Eur. J. Oper. Res..

[133]  T.C.E. Cheng,et al.  Scheduling two job classes on parallel machines , 1995 .

[134]  Suresh Chand,et al.  A SINGLE‐MACHINE SCHEDULING MODEL WITH FIXED‐INTERVAL DELIVERIES , 2009 .

[135]  Lingfa Lu,et al.  Parallel-machine scheduling with release dates and rejection , 2016, 4OR.

[136]  Ameur Soukhal,et al.  Scheduling on parallel machines with preemption and transportation delays , 2012, Comput. Oper. Res..

[137]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[138]  Baoqiang Fan,et al.  Single-Machine Scheduling with Proportionally deteriorating Jobs subject to Availability Constraints , 2012, Asia Pac. J. Oper. Res..

[139]  Chengbin Chu,et al.  Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times , 2008, Comput. Oper. Res..

[140]  Chung-Yee Lee,et al.  Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times , 1993, Discret. Appl. Math..

[141]  Safia Kedad-Sidhoum,et al.  Single-machine common due date total earliness/tardiness scheduling with machine unavailability , 2018, Journal of Scheduling.

[142]  Marcelo Seido Nagano,et al.  A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem , 2020, Expert Syst. Appl..

[143]  Sylvie Gélinas,et al.  A dynamic programming algorithm for single machine scheduling with ready times , 1997, Ann. Oper. Res..

[144]  Dvir Shabtay,et al.  Just-in-time scheduling with controllable processing times on parallel machines , 2010, J. Comb. Optim..

[145]  Celia A. Glass,et al.  Parallel machine scheduling with job assignment restrictions , 2007 .

[146]  Jose A. Ventura,et al.  An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date , 1995, Oper. Res. Lett..

[147]  Heng-Yong Tang,et al.  Two-parallel machines scheduling with rate-modifying activities to minimize total completion time , 2009, Eur. J. Oper. Res..

[148]  Alessandro Agnetis,et al.  Assessing the quality of heuristic solutions to parallel machines min-max scheduling problems , 2009 .

[149]  Peter Brucker,et al.  Open shop problems with unit time operations , 1993, ZOR Methods Model. Oper. Res..

[150]  Chuanli Zhao,et al.  Parallel machines scheduling with deteriorating jobs and availability constraints , 2014 .

[151]  T. Ibaraki,et al.  A dynamic programming method for single machine scheduling , 1994 .

[152]  Malgorzata Sterna,et al.  Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date , 2020, Eur. J. Oper. Res..

[153]  Shi-Sheng Li,et al.  Single-machine scheduling with multi-agents to minimize total weighted late work , 2020, J. Sched..

[154]  John Stachurski,et al.  Dynamic Programming Deconstructed: Transformations of the Bellman Equation and Computational Efficiency , 2018 .

[155]  Jose A. Ventura,et al.  Single-machine earliness-tardiness scheduling about a common due date with tolerances , 1996 .

[156]  Peter Brucker,et al.  Scheduling unit time open shops to minimize the weighted number of late jobs , 1993, Oper. Res. Lett..

[157]  Feng Chu,et al.  Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs , 2018, Int. J. Prod. Res..

[158]  T. C. Edwin Cheng,et al.  Two-stage flowshop earliness and tardiness machine scheduling involving a common due window , 2004 .

[159]  Tatsushi Nishi,et al.  Lagrangian relaxation and cut generation for sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness , 2013 .

[160]  Warren B. Powell,et al.  A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem , 1999, Eur. J. Oper. Res..

[161]  Hua Xuan,et al.  Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling , 2007, Comput. Oper. Res..

[162]  Warren B. Powell,et al.  Solving Parallel Machine Scheduling Problems by Column Generation , 1999, INFORMS J. Comput..

[163]  Federico Della Croce,et al.  Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria , 2007, INFORMS J. Comput..

[164]  Chris N. Potts,et al.  Approximation algorithms for scheduling a single machine to minimize total late work , 1992, Oper. Res. Lett..

[165]  Malgorzata Sterna,et al.  Open shop scheduling problems with late work criteria , 2004, Discret. Appl. Math..

[166]  Mikhail Y. Kovalyov,et al.  A polynomial approximation scheme for problem F2/rj/Cmax , 1997, Oper. Res. Lett..

[167]  Jonathan F. Bard,et al.  Single machine scheduling with flow time and earliness penalties , 1993, J. Glob. Optim..

[168]  Chris N. Potts,et al.  Dynamic programming and decomposition approaches for the single machine total tardiness problem , 1987 .

[169]  Marcus Poggi de Aragão,et al.  Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems , 2010, Math. Program. Comput..

[170]  R. Bellman.  The theory of dynamic programming , 1954 .

[171]  Philippe Baptiste,et al.  Scheduling equal-length jobs on identical parallel machines , 2000, Discret. Appl. Math..

[172]  Gerhard J. Woeginger,et al.  Minimizing the total completion time in a unit-time open shop with release times , 1997, Oper. Res. Lett..

[173]  Sergey Kovalev,et al.  Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion , 2019, Int. J. Prod. Res..

[174]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[175]  Bertrand M. T. Lin,et al.  Makespan minimization in single-machine scheduling with step-deterioration of processing times , 2004, J. Oper. Res. Soc..

[176]  Ellis Horowitz,et al.  Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

[177]  Dana Shapira,et al.  Scheduling with regular performance measures and optional job rejection on a single machine , 2017, J. Oper. Res. Soc..

[178]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[179]  Simon Emde,et al.  Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines , 2020, OR Spectrum.

[180]  Marcelo Seido Nagano,et al.  Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review , 2020, Comput. Ind. Eng..

[181]  Chung-Yee Lee.  Two-machine flowshop scheduling with availability constraints , 1999, Eur. J. Oper. Res..

[182]  Ming Dong,et al.  Parallel machine scheduling with limited controllable machine availability , 2013 .

[183]  Chung-Lun Li,et al.  Single-machine scheduling with trade-off between number of tardy jobs and resource allocation , 1996, Oper. Res. Lett..

[184]  Christian Artigues,et al.  A branch and bound method for the job-shop problem with sequence-dependent setup times , 2008, Ann. Oper. Res..

[185]  Prabuddha De,et al.  Scheduling to minimize weighted earliness and tardiness about a common due-date , 1991, Comput. Oper. Res..

[186]  B. J. Lageweg,et al.  Scheduling identical jobs on uniform parallel machines , 1989 .

[187]  Salah E. Elmaghraby,et al.  Sequencing precedence-related jobs on two machines to minimize the weighted completion time , 2006 .

[188]  Shunji Tanaka,et al.  An exact algorithm for single-machine scheduling without machine idle time , 2009, J. Sched..

[189]  Shunji Tanaka,et al.  A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time , 2011, Journal of Scheduling.

[190]  E. L. Lawler,et al.  A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1991 .

[191]  T. S. Abdul-Razaq,et al.  Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[192]  Gur Mosheiov,et al.  A single machine scheduling problem to minimize total early work , 2016, Comput. Oper. Res..

[193]  Chung Yee Lee,et al.  Due window scheduling for parallel machines , 1994 .

[194]  T. C. Edwin Cheng,et al.  Scheduling linear deteriorating jobs with an availability constraint on a single machine , 2006, Theor. Comput. Sci..

[195]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[196]  Han Hoogeveen,et al.  The three-machine proportionate flow shop problem with unequal machine speeds , 2003, Oper. Res. Lett..

[197]  Sujit K. Dutta,et al.  Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage , 1975 .

[198]  Malgorzata Sterna,et al.  Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work , 2017, Journal of Optimization Theory and Applications.

[199]  Dvir Shabtay,et al.  Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems , 2010, Journal of Scheduling.

[200]  Gur Mosheiov,et al.  A note: flowshop scheduling with linear deterioration and job-rejection , 2020, 4OR.

[201]  Jinjiang Yuan,et al.  Single-machine scheduling under the job rejection constraint , 2010, Theor. Comput. Sci..

[202]  Tapan Sen,et al.  On the Single-machine Scheduling Problem with Tardiness Penalties , 1991 .

[203]  T. C. Edwin Cheng,et al.  Two-agent scheduling in a flowshop , 2016, Eur. J. Oper. Res..

[204]  Meral Azizoglu,et al.  Dynamic programming algorithms for scheduling parallel machines with family setup times , 2001, Comput. Oper. Res..

[205]  Jinjiang Yuan,et al.  Single machine scheduling with release dates and rejection , 2009, Eur. J. Oper. Res..

[206]  Joaquín Bautista,et al.  Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming , 2012, Eng. Appl. Artif. Intell..

[207]  T. C. Edwin Cheng,et al.  Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty , 2001, Ann. Oper. Res..

[208]  Zhi-Long Chen,et al.  Scheduling jobs and maintenance activities on parallel machines , 2000 .

[209]  Yasmin A. Rios-Solis,et al.  Exponential neighborhood search for a parallel machine scheduling problem , 2008, Comput. Oper. Res..

[210]  R. Bellman.  Dynamic Programming , 1957, Science.

[211]  Danyu Bai,et al.  An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times , 2014, Appl. Math. Comput..