Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation

DOI10.1016/J.EJOR.2019.07.047zbMath1487.90301OpenAlexW2964481445WikidataQ127434924 ScholiaQ127434924MaRDI QIDQ2029277

Mikhail Y. Kovalyov, Erwin Pesch, Alain Quilliot

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.07.047

zbMATH Keywords

schedulinghealthcareresource allocationknapsack problemFPTAS

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Improving the complexities of approximation algorithms for optimization problems
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
• Optimal Provision-After-Wait in Healthcare
• Parameterized Algorithms

This page was built for publication: Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation