A note on a fully polynomial-time approximation scheme for minimizing makespan of deteriorating jobs

From MaRDI portal

Publication:474321

Jump to:navigation, search

zbMath1299.90164MaRDI QIDQ474321

Publication date: 24 November 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

This page was built for publication: A note on a fully polynomial-time approximation scheme for minimizing makespan of deteriorating jobs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:474321&oldid=12354539"