Scheduling two agents on a single machine: A parameterized analysis of NP-hard problems

• The tool of parametrized complexity is almost completely neglect when analyzing the complexity of scheduling problems. • We aim to study hard scheduling problems from parametrized point of view. • We do so by studying the parameterized complexity of nine different two-agents scheduling problems. •...

Full description

Bibliographic Details
Published in:Omega : the international journal of management science, Vol. 83 (2019), p. 275-286
Main Author: Hermelin, Danny
Other Involved Persons: Kubitza, Judith-Madeleine ; Shabtay, Dvir ; Talmon, Nimrod ; Woeginger, Gerhard J.
Format: electronic Article
Physical Description:Online-Ressource
QR Code: Show QR Code