Pages that link to "Item:Q1183621"
From MaRDI portal
The following pages link to Scheduling around a small common due date (Q1183621):
Displayed 37 items.
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process (Q299834) (← links)
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
- On scheduling around large restrictive common due windows (Q704121) (← links)
- Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
- A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
- Non-approximability of just-in-time scheduling (Q1041346) (← links)
- Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924) (← links)
- On the general solution for a class of early/tardy problems (Q1207204) (← links)
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
- A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date (Q1278532) (← links)
- Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties (Q1278719) (← links)
- Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties (Q1368414) (← links)
- The determination of the optimal component input numbers for the completion of a single manufacturing order (Q1390265) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249) (← links)
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
- Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem (Q1793464) (← links)
- Parallel machine earliness and tardiness scheduling with proportional weights (Q1870834) (← links)
- An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date (Q1905077) (← links)
- The weighted common due date single machine scheduling problem revisited (Q1919202) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios (Q1956478) (← links)
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
- Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
- Dominance inequalities for scheduling around an unrestrictive common due date (Q2242293) (← links)
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
- Scheduling with controllable release dates and processing times: total completion time minimization (Q2433441) (← links)
- Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
- Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment (Q3430238) (← links)
- MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK (Q3569281) (← links)
- Stochastic single machine scheduling with an exponentially distributed due date (Q5945390) (← links)
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates (Q5953167) (← links)