@inproceedings{218181bdf9eb4328a2a6443c14c53ad2,
title = "Partially-concurrent open shop scheduling",
abstract = "The partially-concurrent open shop scheduling problem is presented. The standard open shop scheduling problem is generalized by allowing some operations to be processed concurrently. This generalization is directly motivated from a real-life timetabling project of assigning technicians to airplanes in an airplane garage. A schedule for the partially-concurrent problem is represented by a digraph. We show that the scheduling problem is equivalent to a problem of orienting a given undirected graph, called a conflict graph. The schedule digraph is then modeled by a matrix, generalizing the rank matrix representation. The problem is shown to be NP-Hard. The rank matrix representation is also used in an algorithm that heuristically constructs an open shop schedule.",
keywords = "Concurrent machines, Graph orientation, Open Shop Scheduling, Technician timetabling",
author = "Tal Grinshpoun and Hagai Ilani and Elad Shufan",
note = "Publisher Copyright: {\textcopyright} PATAT 2014 - Proceedings of the 10th International Conference on the Practice and Theory of Automated Timetabling. All rights reserved.; 10th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2014 ; Conference date: 26-08-2014 Through 29-08-2014",
year = "2014",
language = "אנגלית",
series = "PATAT 2014 - Proceedings of the 10th International Conference on the Practice and Theory of Automated Timetabling",
pages = "188--201",
editor = "Ender Ozcan and Burke, {Edmund K.} and Barry McCollum",
booktitle = "PATAT 2014 - Proceedings of the 10th International Conference on the Practice and Theory of Automated Timetabling",
}