New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
From MaRDI portal
Publication:2901056
DOI10.1287/ijoc.1080.0287zbMath1243.90071OpenAlexW2047928292MaRDI QIDQ2901056
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1080.0287
Lagrangian relaxationearliness-tardiness schedulingcommon due datetime-indexed formulationgeneral due dates
Related Items (28)
Mixed integer formulations using natural variables for single machine scheduling around a common due date ⋮ Fast neighborhood search for the single machine earliness-tardiness scheduling problem ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Just-in-time single-batch-processing machine scheduling ⋮ Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems ⋮ Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models ⋮ An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem ⋮ Just-in-Time Scheduling with Equal-Size Jobs ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders ⋮ Scheduling with time-dependent discrepancy times ⋮ A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time ⋮ A linear programming-based method for job shop scheduling ⋮ An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems ⋮ Data analytics and stochastic modeling in a semiconductor fab ⋮ Dominance inequalities for scheduling around an unrestrictive common due date ⋮ The single machine weighted mean squared deviation problem ⋮ Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times ⋮ An exact approach for scheduling jobs with regular step cost functions on a single machine ⋮ An exact algorithm for single-machine scheduling without machine idle time ⋮ 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 ⋮ A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems ⋮ The single-processor scheduling problem with time restrictions: complexity and related problems ⋮ Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates ⋮ An exact algorithm for the precedence-constrained single-machine scheduling problem
Uses Software
This page was built for publication: New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
