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

DOI10.1016/S0305-0548(98)00081-1zbMath0957.90061OpenAlexW1987468199WikidataQ126643388 ScholiaQ126643388MaRDI QIDQ1302719

Ching-Fang Liaw

Publication date: 2 April 2001

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00081-1

zbMATH Keywords

Lagrangian relaxationschedulingbranch-and-bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (22)

Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem ⋮ A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time ⋮ A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ⋮ Improved heuristics for the early/tardy scheduling problem with no idle time ⋮ A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties ⋮ A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties ⋮ Minimizing total earliness and tardiness on a single machine using a hybrid heuristic ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ EA/G-GA for single machine scheduling problems with earliness/tardiness costs ⋮ Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders ⋮ Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness ⋮ Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties ⋮ Heuristic dispatching rule to maximize TDD and IDD performance ⋮ An exact algorithm for single-machine scheduling without machine idle time ⋮ Scheduling just-in-time part supply for mixed-model assembly lines ⋮ An exact approach to early/tardy scheduling with release dates ⋮ Modeling single machine preemptive scheduling problems for computational efficiency ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM ⋮ Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties ⋮ Bi-objective single machine scheduling problem with stochastic processing times ⋮ Minimizing earliness and tardiness costs in stochastic scheduling

This page was built for publication: A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem