On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan

DOI10.1007/978-981-19-8152-4_17zbMath1541.90173MaRDI QIDQ6535285

Ruiqing Sun

Publication date: 2 December 2023

zbMATH Keywords

fixed-parameter tractabilityparameterized complexityscheduling with rejectionweighted makespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan