ON THE USE OF DECOMPOSITION APPROACHES IN A SINGLE MACHINE SCHDULING PROBLEM

DOI10.15807/jorsj.25.29zbMath0479.90050OpenAlexW2165738218MaRDI QIDQ3938827

J. George Shanthikumar, John A. Buzacott

Publication date: 1982

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.25.29

zbMATH Keywords

decompositionsingle machine scheduling problembranch and bound algorithmminimization of weighted flow timezero maximum tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Single machine scheduling to minimize weighted earliness subject to no tardy jobs ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems ⋮ Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine ⋮ Scheduling unit processing time jobs on a single machine with multiple criteria

This page was built for publication: ON THE USE OF DECOMPOSITION APPROACHES IN A SINGLE MACHINE SCHDULING PROBLEM