Decomposition in single-machine scheduling

DOI10.1023/A:1018916215399MaRDI QIDQ1273128zbMATH OpenOpenAlexFDO

Authors Wlodzimierz Szwarc

Publication date 6 December 1998

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018916215399

zbMATH Keywords

decomposition techniquessingle-machine schedulinggeneral earliness-tardiness model

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A decomposition scheme for single stage scheduling problems
• A new decomposition approach for the single machine total tardiness scheduling problem
• Decomposition of the single machine total tardiness problem
• Dominance and Decomposition Heuristics for Single Machine Scheduling

Cited in

(7)

• For the airplane refueling problem local precedence implies global precedence
• The local-global conjecture for scheduling with non-linear cost
• A decomposition scheme for single stage scheduling problems
• Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
• Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
• The single-machine total tardiness scheduling problem: review and extensions
• Solution of the single machine total tardiness problem

This page was built for publication: Decomposition in single-machine scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273128)