Bounded colouring motivated by the limited resource partially concurrent open shop problem
Year of publication: |
2021
|
---|---|
Authors: | Ilani, Hagai ; Grinshpoun, Tal ; Shufan, Elad |
Published in: |
The practice and theory of automated timetabling (2018). - New York, NY, USA : Springer. - 2021, p. 461-476
|
Subject: | Graph colouring | Bounded colouring | Open shop scheduling | Concurrent machines | Limited resources | Technician timetabling | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory |
-
Adaptive linear combination of heuristic orderings in constructing examination timetables
Rahman, Syariza Abdul, (2014)
-
Creating seating plans : a practical application
Lewis, Rhyd, (2016)
-
The maximum happy induced subgraph problem : bounds and algorithms
Lewis, Rhyd, (2021)
- More ...
-
Reentrant flow shop with identical jobs and makespan criterion
Shufan, Elad, (2023)
-
Graph representation of the fixed route dial-a-ride problem
Grinshpoun, Tal, (2023)
-
A reduction approach to the two-campus transport problem
Ilani, Hagai, (2014)
- More ...