Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date

DOI10.1016/j.endm.2010.05.060zbMath1237.90080OpenAlexW2059017785MaRDI QIDQ2883598

Ibrahim Osmane, Hemmak Allaoua

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.060

zbMATH Keywords

dynamic programminggenetic algorithmcommon due dateearliness-tardiness penaltiessingle scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms

Cites Work

• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
• A note: Common due date assignment for a single machine scheduling with the rate-modifying activity
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
• The one machine scheduling problem: insertion of a job under the real-time constraint
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

This page was built for publication: Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date