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

DOI10.1016/J.COR.2005.11.021zbMATH Open1185.90088OpenAlexW2105938641MaRDI QIDQ878591FDOQ878591

Authors: 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

Recommendations

• A heuristic for single machine scheduling with early and tardy costs
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates

zbMATH Keywords

combinatorial optimizationschedulingsingle machinehybrid heuristicstardinessearliness

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (25)

• Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
• STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM
• An uncertain parallel machine problem with deterioration and learning effect
• Minimizing earliness and tardiness costs in stochastic scheduling
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
• Self-adaptive biased differential evolution for scheduling against common due dates
• Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
• 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
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
• Order acceptance using genetic algorithms
• An uncertain programming model for single machine scheduling problem with batch delivery
• A note on the equivalence of two heuristics to minimize total tardiness
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
• New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• A meta-raps for the early/tardy single machine scheduling problem
• Minimizing the earliness--tardiness costs on a single machine
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
• A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
• A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
• Bi-objective single machine scheduling problem with stochastic processing times
• Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
• Minimizing the sum of job earliness and tardiness in a multimachine system

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878591)