Minimizing the Range of Lateness on a Single Machine

DOI10.2307/2582635zbMath0542.90053OpenAlexW4243989384MaRDI QIDQ3330959

Sushil K. Gupta, Tapan Sen

Publication date: 1984

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582635

zbMATH Keywords

branch-and-boundsingle-machine sequencinglateness range minimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Minimum dispersion problems ⋮ On weighting two criteria with a parameter in combinatorial optimization problems ⋮ The balanced traveling salesman problem ⋮ Lexicographic balanced optimization problems ⋮ A new lower bound approach for single-machine multicriteria scheduling ⋮ Minimizing maximum earliness on parallel identical machines ⋮ The quadratic balanced optimization problem

This page was built for publication: Minimizing the Range of Lateness on a Single Machine