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

Authors:
Rym M'Hallah
Affiliations:
Department of Statistics and Operations Research, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait
Venue:
Computers and Operations Research
Year:
2007

Citing 17
Cited 11

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
The single machine early/tardy problem

Management Science
Sequencing with earliness and tardiness penalties: a review

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
A time indexed formulation of non-preemptive single machine scheduling problems

Mathematical Programming: Series A and B
Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights

Computers and Industrial Engineering
A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights

Computers and Operations Research
The weighted common due date single machine scheduling problem revisited

Computers and Operations Research
A composite heuristic for the single machine early/tardy job scheduling problem

Computers and Operations Research
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

Computers and Operations Research
A Taxonomy of Hybrid Metaheuristics

Journal of Heuristics
Minimization of squared deviation of completion times about a common due date

Computers and Operations Research
Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
The One-Machine Problem with Earliness and Tardiness Penalties

Journal of Scheduling
Improved heuristics for the early/tardy scheduling problem with no idle time

Computers and Operations Research
Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time

Computers and Industrial Engineering
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms

Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem

IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Order acceptance using genetic algorithms

Computers and Operations Research
A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic

Expert Systems with Applications: An International Journal
A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop

Engineering Applications of Artificial Intelligence
Genetic algorithms for coordinated scheduling of production and air transportation

Expert Systems with Applications: An International Journal
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

Computers & Mathematics with Applications
A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system

Computers and Industrial Engineering
Multi-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows

Electronic Notes in Theoretical Computer Science (ENTCS)
A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups

Computers and Operations Research
A comparative analysis of meta-heuristic approaches for facility layout design problem: a case study for an elevator manufacturer

Journal of Intelligent Manufacturing
A hybrid Electromagnetism-like Mechanism/tabu search procedure for the single machine scheduling problem with a maximum lateness objective

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper focuses on scheduling jobs with different processing times and distinct due dates on a single machine with no inserted idle time as to minimize the sum of total earliness and tardiness. This scheduling problem is a very important and frequent industrial problem that is common to most just-in-time production environments. This NP hard scheduling problem is herein solved using a hybrid heuristic which combines local search heuristics (dispatching rules, hill climbing and simulated annealing) and an evolutionary algorithm based on genetic algorithms. The heuristic involves low and high, relay and teamwork hybridization. Computational results reflect the sizeable solution quality improvement induced by hybridization, and assess the impact of each type of hybridization on the efficiency of the hybrid heuristic.