Scheduling around a small common due date
From MaRDI portal
Publication:1183621
DOI10.1016/0377-2217(91)90228-NzbMath0755.90044MaRDI QIDQ1183621
Hoogeveen, J. A., Steef L. van de Velde
Publication date: 28 June 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
due datesingle machine schedulingNP-hardnesspseudo-polynomial algorithmdeadlineprohibited interruptionsweighted sum of deviations
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
Mixed integer formulations using natural variables for single machine scheduling around a common due date, A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date, Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics, An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date, Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties, The weighted common due date single machine scheduling problem revisited, The determination of the optimal component input numbers for the completion of a single manufacturing order, The symmetric quadratic knapsack problem: approximation and scheduling applications, Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models, Just-in-Time Scheduling with Equal-Size Jobs, Scheduling with controllable release dates and processing times: total completion time minimization, A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios, Scheduling jobs with a V-shaped time-dependent processing time, Exponential neighborhood search for a parallel machine scheduling problem, Scheduling to minimize weighted earliness and tardiness about a common due-date, Dominance inequalities for scheduling around an unrestrictive common due date, MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK, On the general solution for a class of early/tardy problems, On scheduling around large restrictive common due windows, Stochastic single machine scheduling with an exponentially distributed due date, Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates, \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees, On the complexity of the single machine scheduling problem minimizing total weighted delay penalty, Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval, Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem, Single-machine common due date total earliness/tardiness scheduling with machine unavailability, A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems, A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date, Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties, Non-approximability of just-in-time scheduling, Multicriteria scheduling, Punctuality and idleness in just-in-time scheduling, Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment, A survey of the state-of-the-art of common due date assignment and scheduling research, Parallel machine earliness and tardiness scheduling with proportional weights
Cites Work
- Unnamed Item
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
