Minimizing total earliness and tardiness on a single machine using a hybrid heuristic

DOI10.1016/j.cor.2005.11.021zbMath1185.90088OpenAlexW2105938641MaRDI QIDQ878591

Rym M'Hallah

Publication date: 26 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.021

zbMATH Keywords

schedulingcombinatorial optimizationearlinesssingle machinetardinesshybrid heuristics

Mathematics Subject Classification ID

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

Related Items

RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect ⋮ Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint ⋮ Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness ⋮ A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups ⋮ Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs ⋮ Order acceptance using genetic algorithms ⋮ An uncertain programming model for single machine scheduling problem with batch delivery ⋮ An uncertain parallel machine problem with deterioration and learning effect ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs ⋮ Bi-objective single machine scheduling problem with stochastic processing times ⋮ Minimizing earliness and tardiness costs in stochastic scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• A time indexed formulation of non-preemptive single machine scheduling problems
• Scheduling about a given common due date to minimize mean squared deviation of completion times
• Single machine earliness and tardiness scheduling
• A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• A composite heuristic for the single machine early/tardy job scheduling problem.
• Optimal timing of a sequence of tasks with general completion costs
• Single machine scheduling with symmetric earliness and tardiness penalties
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
• The weighted common due date single machine scheduling problem revisited
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• The one-machine problem with earliness and tardiness penalties
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
• A Dynamic Programming Approach to Sequencing Problems
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Single Machine Early/Tardy Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Single-machine scheduling with early and tardy completion costs
• Improved lower bounds for the early/tardy scheduling problem with no idle time
• Single machine weighted earliness-tardiness penalty problem with a common due date

This page was built for publication: Minimizing total earliness and tardiness on a single machine using a hybrid heuristic