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

An Zhang et al. (2017)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-08-25

a service of  Schloss Dagstuhl - Leibniz Center for Informatics