@inproceedings{e5e621f3b258478290d4ffb4168a5888,
title = "Partially concurrent open shop scheduling and graph colourings",
abstract = "Partially-concurrent open shop scheduling (PCOSS) was recently introduced as a common generalization of the well-known open shop scheduling model and the concurrent open shop scheduling model. PCOSS was shown to be NP-hard even when there is only one machine and all operations have unit processing time. In the present paper we take a step further in the study of PCOSS by investigating the connection between PCOSS and graph colouring problems. This connection enables us to extract insights and solutions from the well-studied field of graph colouring and apply them to the recently introduced PCOSS model. We focus on specific PCOSS instances, such as uniform PCOSS, and PCOSS with preemption, which correlate to a real-life timetabling project of assigning technicians to a fleet of airplanes.",
keywords = "Concurrent machines, Graph colouring, Open shop scheduling, Technician timetabling",
author = "Hagai Ilani and Elad Shufan and Tal Grinshpoun",
note = "Publisher Copyright: {\textcopyright} PATAT 2016.All rights reserved.; 11th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2016 ; Conference date: 23-08-2016 Through 26-08-2016",
year = "2016",
language = "אנגלית",
series = "PATAT 2016 - Proceedings of the 11th International Conference on the Practice and Theory of Automated Timetabling",
pages = "195--205",
editor = "Burke, \{Edmund K.\} and \{Di Gaspero\}, Luca and Ender Ozcan and Barry McCollum and Andrea Schaerf",
booktitle = "PATAT 2016 - Proceedings of the 11th International Conference on the Practice and Theory of Automated Timetabling",
}