Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted

DOI10.1002/NAV.10039zbMath1037.90026OpenAlexW1981344322MaRDI QIDQ4805640

Jaw-Yeh Chen, Sheng-Fuu Lin

Publication date: 8 May 2003

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.10039

zbMATH Keywords

branch-and-boundscheduling theorydominance ruleidle timeearliness/tardiness

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

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

This page was built for publication: Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted