A general scheme for solving a large set of scheduling problems with rejection in FPT time

DOI10.1007/s10951-022-00731-zzbMath1489.90027MaRDI QIDQ2142679

Dvir Shabtay, Danny Hermelin, Michael L. Pinedo, Chen Zelig

Publication date: 27 May 2022

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-022-00731-z

zbMATH Keywords

parallel machines; single machine; scheduling with rejection; fixed parameter tractable; flow-shop; \( \mathcal{NP} \)-hard

Mathematics Subject Classification ID

90C25: Convex programming

90C10: Integer programming

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems