"On the NP-hardness of scheduling with time restrictions."

An Zhang et al. (2018)

Details and statistics

DOI: 10.1016/J.DISOPT.2017.12.001

access: closed

type: Journal Article

metadata version: 2022-08-25

a service of  Schloss Dagstuhl - Leibniz Center for Informatics