Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
From MaRDI portal
Publication:1887879
DOI10.1016/j.ejor.2004.03.006zbMath1067.90043OpenAlexW1997456623MaRDI QIDQ1887879
Celso M. Hino, André B. Mendes, Débora P. Ronconi
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.03.006
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date ⋮ Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date ⋮ Minimizing total earliness and tardiness on a single machine using a hybrid heuristic ⋮ Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models ⋮ New approaches to due date assignment in job shops ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ Exponential neighborhood search for a parallel machine scheduling problem ⋮ The single machine weighted mean squared deviation problem ⋮ Order acceptance using genetic algorithms ⋮ Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Survey of scheduling research involving due date determination decisions
- An SA/TS mixture algorithm for the scheduling tardiness problem
- Genetic algorithms and tabu search: Hybrids for optimization
- Using tabu search to solve the common due date early/tardy machine scheduling problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A hybrid genetic algorithm for the job shop scheduling problem
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Genetic Algorithms-a Tool for OR?
- Heuristics from Nature for Hard Combinatorial Optimization Problems
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates