A survey of the state-of-the-art of common due date assignment and scheduling research

European Journal of Operational Research

Volumn 139, Issue 1, 2002, Pages 1-25

  Gordon, Valery ^a   Proth, Jean Marie ^b   Chu, Chengbin ^c  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b INRIA   (France)

^c UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Common due date; Due date assignment; Scheduling; Sequencing

Indexed keywords

ALGORITHMS; INVENTORY CONTROL; JUST IN TIME PRODUCTION; SCHEDULING; SURVEYING;

DUE DATE ASSIGNMENT;

OPERATIONS RESEARCH;

EID: 0037118177     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00181-3     Document Type: Article

References (137)

1. Scheduling under a common due-date on parallel unrelated machines
2. Two parallel machine sequencing problems involving controllable job processing times
3. Single stage minimum absolute lateness problem with a common due date on non-identical machines
4. Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates
5. Scheduling job families about an unrestricted common due date on a single machine
6. Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
7. Minimizing mean absolute deviation of completion times about a common due date
8. Minimizing mean squared deviation of completion times about a common due date
9. On the assignment of optimal due dates
10. Sequencing with earliness and tardiness penalties: A review
11. Determination of an optimal common due date and optimal sequence in a single machine job shop
12. Single-machine scheduling with learning considerations
13. Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties
14. Multiple-machine scheduling with earliness, tardiness and completion time penalties
15. Benchmarks for scheduling on a single-machine against restrictive and unrestrictive common due dates
16. Common due date assignment for scheduling on a single machine with jointly reducible processing times
17. Total late work criteria for scheduling problems
18. Scheduling independent tasks to reduce mean finishing time
19. Minimization of agreeably weighted variance in single machine systems
20. Scheduling about a common due date with job-dependent asymmetric earliness and tardiness penalties
21. A review of machine scheduling: Complexity, algorithms and approximability
22. Single machine scheduling with common due date assignment in a group technology environment
23. Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
24. A duality approach to optimal due-date determination
25. An algorithm for the CON due-date determination and sequencing problem
26. Minimizing the maximum deviation of job completion time about a common due-date
27. Optimal common due-date with limited completion time deviation
28. An alternative proof of optimality for the common due-date assignment problem
29. A heuristic for common due-date assignment and job scheduling on parallel machines
30. A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem
31. Common due-date assignment and scheduling for a single processor to minimize the number of tardy jobs
32. Optimal constant due-date determination and sequencing of n jobs on a single machine
33. Parallel-machine scheduling problems with earliness and tardiness penalties
34. Survey of scheduling research involving due date determination decisions
35. Batch scheduling and common due-date assignment on a single machine
36. Due-date assignment and single machine scheduling with compressible processing times
37. A state-of-the-art review of parallel-machine scheduling research
38. Priority dispatching and job lateness in a job shop
39. Single-machine scheduling with early and tardy completion costs
40. A note on the minimization of mean squared deviation of completion times about a common due date
41. CON due-date determination and sequencing
42. Scheduling about a common due date with earliness and tardiness penalties
43. Optimal delivery time quotation and order sequencing
44. On the multiple-machine extension to a common due-date assignment and scheduling problem
45. On the minimization of completion time variance with a bicriteria extension
46. On the general solution for a class of early/tardy problems
47. Solving a generalized model for CON due date assignment and sequencing
48. Due-date assignment and early/tardy scheduling on identical parallel machines
49. Minimizing tardy jobs in a flowshop with common due date
50. Optimal common due date with limited completion time
51. Common due date scheduling problem with separate earliness and tardiness penalties
52. Due dates in job shop scheduling
53. Scheduling to a common due date on parallel uniform processors
54. Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems
55. Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
56. Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristc approaches
57. One-processor scheduling with symmetric earliness and tardiness penalties
58. Selecting allowance policies for improved job shop performance
59. A state-of-the-art survey of due date assignment and scheduling research: SLK, TWK, and other due date assignment models
60. Minimizing flow time variance in a single machine system using genetic algorithms
61. Single machine scheduling research
62. Optimal schedule on a single machine using various due date determination methods
63. Scheduling problems with generalized due dates
64. Single- and multiple-processor models for minimizing completion time variance
65. Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date
66. Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date
67. On the complexity of generalized due date scheduling problems
68. Common due date determination and sequencing using tabu search
69. On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
70. Sequencing and scheduling: An annotated bibliography
71. New lower and upper bounds for scheduling around a small common due date
72. Scheduling around a small common due date
73. Earliness-tardiness scheduling around almost equal due date
74. Scheduling a production line to minimize maximum tardiness
75. Using tabu search to solve the common due date early/tardy machine scheduling problem
76. Scheduling shops to minimize the weighted number of late jobs
77. Algorithms for minclique scheduling problems
78. SWEAT - A program for a scheduling problem with earliness and tardiness penalties
79. Scheduling with monotonous earliness and tardiness penalties
80. Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
81. Minimizing the average deviation of job completion times about a common due date
82. Form similarities of the CON and SLK due date determination methods
83. Optimization algorithms for a class of single machine scheduling problems using due date determination methods
84. Deterministic scheduling in computer systems: A survey
85. The total tardiness problem: Review and extensions
86. Batch scheduling and common due date assignment problem: An NP-hard case
87. A fully polynomial approximation scheme for the weighted earliness-tardiness problem
88. Common due-window scheduling
89. Completion time variance minimization on a single machine is difficult
90. New results on the completion time variance minimization
91. Equivalence of mean flow time problems and mean absolute deviation problems
92. Optimal single-machine scheduling with earliness and tardiness penalties
93. Sequencing and scheduling: Algorithms and complexity
94. A functional equation and its application to resource allocations and sequencing problems
95. Estimating flowtimes and setting due-dates in complex production systems
96. Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
97. Parallel genetic algorithms for the earliness tardiness job scheduling problem with general penalty weights
98. The parallel machine min-max weighted absolute lateness scheduling problem
99. Determination of common due window location in a single machine scheduling problem
100. Common due window size and location determination in a single machine scheduling problem
101. Variance minimization in a single machine sequencing problems
102. Single machine sequencing with controllable processing times
103. Common due date assignment to minimize total penalty for the one machine scheduling problem
104. Scheduling under the due date criterion with varying penalties for lateness
105. Cost-based due-date assignment with the use of classical and neural-network approaches
106. A generalized model of optimal due-date assignment by linear programming
107. A V-shape property of optimal schedule of jobs about a common due date
108. Scheduling problems with non-regular penalty functions - A review
109. Dynamic job shop scheduling: A survey of simulation research
110. Dynamic assignation of due-dates in an assembly shop based in simulation
111. Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
112. Optimal assignment of due-dates for a single processor scheduling problem
113. A state-of-art survey of static scheduling research involving due dates
114. Regression-based due date assignment rules for improved assembly shop performance
115. Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
116. Single-machine scheduling to minimize absolute deviation of completion times from a common due date
117. The weighted common due date single machine scheduling problem revisited
118. Integrating order release control with due-date assignment rules
119. Combining column generation and Lagrangean relaxation: An application to a single-machine common due date scheduling problem
120. An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
121. Dynamic rules for due date assignments
122. Mixing static and dynamic flowtime estimates for due-date assignment
123. A methodology for assigning minimum cost due-dates
124. The complexity of scheduling job families about a common due date
125. Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
126. Optimal common due-date completion time tolerance
127. Single-machine scheduling with a common due window