Partially concurrent open shop scheduling and graph colourings

Hagai Ilani, Elad Shufan, Tal Grinshpoun

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationPATAT 2016 - Proceedings of the 11th International Conference on the Practice and Theory of Automated Timetabling
EditorsEdmund K. Burke, Luca Di Gaspero, Ender Ozcan, Barry McCollum, Andrea Schaerf
Pages195-205
Number of pages11
ISBN (Electronic)9780992998417
StatePublished - 2016
Event11th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2016 - Udine, Italy
Duration: 23 Aug 201626 Aug 2016

Publication series

NamePATAT 2016 - Proceedings of the 11th International Conference on the Practice and Theory of Automated Timetabling

Conference

Conference11th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2016
Country/TerritoryItaly
CityUdine
Period23/08/1626/08/16

Keywords

  • Concurrent machines
  • Graph colouring
  • Open shop scheduling
  • Technician timetabling

All Science Journal Classification (ASJC) codes

  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Partially concurrent open shop scheduling and graph colourings'. Together they form a unique fingerprint.

Cite this