A composite heuristic for the single machine early/tardy job scheduling problem.

DOI10.1016/S0305-0548(97)00097-XzbMath1042.90559OpenAlexW2055518936MaRDI QIDQ1406666

Mário Centeno, Maria Teresa Almeida

Publication date: 7 September 2003

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00097-x

zbMATH Keywords

simulated annealingtabu searchJob scheduling

Mathematics Subject Classification ID

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

Related Items (4)

Minimizing total earliness and tardiness on a single machine using a hybrid heuristic ⋮ A differential evolution approach for the common due date early/tardy job scheduling problem ⋮ Parallel machine scheduling with a common due window ⋮ Counting and enumeration complexity with application to multicriteria scheduling

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• A time indexed formulation of non-preemptive single machine scheduling problems
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
• An SA/TS mixture algorithm for the scheduling tardiness problem
• Scheduling with monotonous earliness and tardiness penalties
• A user's guide to tabu search
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Sequencing with Earliness and Tardiness Penalties: A Review
• A Generalized Model of Optimal Due-Date Assignment by Linear Programming
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Single Machine Early/Tardy Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Job Shop Scheduling by Simulated Annealing
• A Single Machine Model for Determination of Optimal Due Dates and Sequence
• Tabu Search—Part I
• Tabu Search—Part II
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Bandwidth Packing: A Tabu Search Approach
• Single-machine scheduling with early and tardy completion costs
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: A composite heuristic for the single machine early/tardy job scheduling problem.