A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties

DOI10.1016/J.APM.2008.01.006zbMath1167.90503OpenAlexW2048716671MaRDI QIDQ838299

N. E. Zubov

Publication date: 24 August 2009

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2008.01.006

zbMATH Keywords

genetic algorithmsingle machine schedulingoptimal scheduledominance propertiesearliness/tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect ⋮ Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates ⋮ Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems ⋮ Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness ⋮ A self-guided genetic algorithm for permutation flowshop scheduling problems ⋮ Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems ⋮ A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Scheduling with release dates on a single machine to minimize total weighted completion time
• One-machine rescheduling heuristics with efficiency and stability as criteria
• Single machine earliness and tardiness scheduling
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• The one-machine problem with earliness and tardiness penalties
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Single Machine Early/Tardy Problem
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates

This page was built for publication: A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties