Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
From MaRDI portal
Publication:3988910
DOI10.1287/opre.39.5.836zbMath0749.90041OpenAlexW2107205433MaRDI QIDQ3988910
Nicholas G. Hall, Marc E. Posner
Publication date: 28 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.5.836
optimality conditionssingle machinecommon due datefully polynomial approximationpseudo-polynomial dynamic programming algorithmcost penaltiessum of weighted earliness and tardiness
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Due-window assignment scheduling problems with position-dependent weights on a single machine, A heuristic for single machine common due date assignment problem with different earliness/tardiness weights, Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost, Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem, Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders, Scheduling and due‐date quotation in a make‐to‐order supply chain, Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties, Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date, Minmax earliness-tardiness costs with unit processing time jobs, Stochastic single machine scheduling with an exponentially distributed due date, Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates, Parallel machine scheduling with a common due window, Algorithms for minclique scheduling problems, STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM, Two-machine flow shop scheduling with two criteria: maximum earliness and makespan, Simultaneous minimization of total completion time and total deviation of job completion times, Mixed integer formulations using natural variables for single machine scheduling around a common due date, The stochastic single machine scheduling problem with earliness and tardiness costs, A single machine scheduling with generalized and periodic due dates to minimize total deviation, A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time, Effective on-line algorithms for reliable due date quotation and large-scale scheduling, Machine scheduling with earliness, tardiness and non-execution penalties, Due window scheduling for parallel machines, Earliness-tardiness scheduling problems with a common delivery window, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, Single machine \(\text{MAD}/T_{\max}\) problem with a common due date, Optimal restricted due date assignment in scheduling, Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint, Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date, Optimal common due-date with completion time tolerance, Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach, A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date, Scheduling problems with two competing agents to minimized weighted earliness-tardiness, 0-1 Quadratic programming approach for optimum solutions of two scheduling problems, Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties, Two due date assignment problems in scheduling a single machine, Using tabu search to solve the common due date early/tardy machine scheduling problem, Single machine scheduling to minimize weighted earliness subject to maximum tardiness, Common due-date determination and sequencing using tabu search, The complexity of scheduling job families about a common due date, The weighted common due date single machine scheduling problem revisited, Maximizing set function formulation of two scheduling problems, Mimimization of agreeably weighted variance in single machine systems, Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date, Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work, 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, New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives, Just-in-Time Scheduling with Equal-Size Jobs, Due-date assignment and maintenance activity scheduling problem, Due-window assignment problems with unit-time jobs, A composite heuristic for the single machine early/tardy job scheduling problem., CON due-date determination and sequencing, Competitive analysis for make-to-order scheduling with reliable lead time quotation, A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios, A branch and bound approach for single machine scheduling with earliness and tardiness penalties, Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard, Online Scheduling with Increasing Subsequence Serving Constraint, Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties, Multicriteria models for just-in-time scheduling, Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date, Group sequencing around a common due date, Exponential neighborhood search for a parallel machine scheduling problem, Scheduling around a small common due date, The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times, A differential evolution approach for the common due date early/tardy job scheduling problem, Scheduling to minimize weighted earliness and tardiness about a common due-date, Dominance inequalities for scheduling around an unrestrictive common due date, An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach, MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK, Common due date scheduling problem with separate earliness and tardiness penalties, Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs, Minimization of ordered, symmetric half-products, On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties, Minimizing weighted mean absolute deviation of job completion times from their weighted mean, A recovering beam search algorithm for the single machine just-in-time scheduling problem, On scheduling around large restrictive common due windows, Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs, Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem, Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times, A Meta-RaPS for the early/tardy single machine scheduling problem, Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs, Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem, Strong NP-hardness of minimizing total deviation with generalized and periodic due dates, Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty, Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration, A functional equation that arises in problems of scheduling with priorities and lateness/earliness penalties, Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs, Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights, BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS, \(V\)-shape property for job sequences that minimize the expected completion time variance, A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems, Scheduling with batch setup times and earliness-tardiness penalties, 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, Estimating the probability of meeting a deadline in schedules and plans, Non-approximability of just-in-time scheduling, Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method, A branch and bound procedure to minimize mean absolute lateness on a single processor, Multicriteria scheduling, Single machine earliness-tardiness scheduling with resource-dependent release dates, Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment, On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, A survey of the state-of-the-art of common due date assignment and scheduling research, Scheduling with generalized and periodic due dates under single- and two-machine environments, Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product, Scheduling problems with a common due window assignment: A survey, A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem, Due-window assignment with identical jobs on parallel uniform machines, An exact algorithm to minimize mean squared deviation of job completion times about a common due date, Minimizing earliness and tardiness costs in stochastic scheduling, Parallel machine earliness and tardiness scheduling with proportional weights
