The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

DOI10.1590/S1807-03022010000200002zbMath1201.90085OpenAlexW2027120502MaRDI QIDQ5962398

Débora P. Ronconi, Márcio S. Kawamura

Publication date: 22 September 2010

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1590/s1807-03022010000200002

zbMATH Keywords

branch-and-boundsingle machinelower boundcommon due dateearliness and tardiness

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A study on the enhanced best performance algorithm for the just-in-time scheduling problem ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

This page was built for publication: The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm