An FPTAS for just-in-time scheduling of a flow shop manufacturing process with different service quality levels

DOI10.1051/RO/2020006MaRDI QIDQ5002255zbMATH OpenOpenAlexFDO

Authors Amir Elalouf

Publication date 27 July 2021

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2020006

zbMATH Keywords

combinatorial optimizationdynamic programmingFPTASflow shop scheduling

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Discrete mathematics in relation to computer science (68Rxx) Algebraic combinatorics (05Exx)

Cited in

(1)

• Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan

This page was built for publication: An FPTAS for just-in-time scheduling of a flow shop manufacturing process with different service quality levels

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