@inproceedings{81e3d247ef0f4462b8d862d7652971c6,
title = "Partially concurrent open shop scheduling with preemption and limited resources",
abstract = "Partially Concurrent Open Shop Scheduling (PCOSS) is a relaxation of the well-known Open Shop Scheduling (OSS) problem, where some of the operations that refer to the same job may be processed concurrently. Here we extend the study of the PCOSS model by considering the addition of limited resources. We deal with the case of preemption PCOSS, where a few polynomial algorithms are known for its OSS counterpart. The scheduling problem is equivalent to the problem of conflict graph colouring. The restriction on the number of resources bounds the size of colour classes.We thus study the problem of bounded vertex colouring and focus on bounds. In particular, we introduce a new bound for this problem, propose a colouring procedure that is inspired by this new bound, and show that for perfect graphs with two resources the procedure attains the bound, and hence is optimal. The model correlates to a real-life timetabling project of assigning technicians to vehicles in a garage, with additional resources, such as vehicle lifts.",
keywords = "Concurrent machines, Graph colouring, Limited resources, Open shop scheduling, Technician timetabling",
author = "Hagai Ilani and Tal Grinshpoun and Elad Shufan",
note = "Publisher Copyright: {\textcopyright} PATAT 2018 Organizing Committee.; 12th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2018 ; Conference date: 28-08-2018 Through 31-08-2018",
year = "2018",
language = "الإنجليزيّة",
series = "PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling",
pages = "299--311",
editor = "Burke, {Edmund K.} and {Di Gaspero}, Luca and Barry McCollum and Nysret Musliu and Ender Ozcan",
booktitle = "PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling",
}