Two-machine flow shop scheduling problem under linear constraints

DOI10.1007/978-3-030-36412-0_32zbMath1442.90083OpenAlexW2992392095MaRDI QIDQ2180171

Kameng Nip, Zhen-bo Wang

Publication date: 13 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-36412-0_32

zbMATH Keywords

computational complexitylinear programmingapproximation algorithmflow shop scheduling

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints ⋮ Related machine scheduling with machine speeds satisfying linear constraints

This page was built for publication: Two-machine flow shop scheduling problem under linear constraints