Scheduling on uniform machines with a conflict graph : complexity and resolution
Year of publication: |
2024
|
---|---|
Authors: | Mallek, Amin ; Boudhar, Mourad |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 31.2024, 2, p. 863-888
|
Subject: | complexity | conflict graph | incompatible jobs | scheduling | uniform machines | unit-time jobs | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Durchlaufzeit | Lead time |
-
Scheduling identical jobs on uniform machines with a conflict graph
Mallek, Amin, (2019)
-
Scheduling with agreements : new results
Bendraouche, Mohamed, (2016)
-
A strong integer programming formulation for hybrid flowshop scheduling
Ünal, A. Tamer, (2020)
- More ...
-
Scheduling identical jobs on uniform machines with a conflict graph
Mallek, Amin, (2019)
-
Scheduling a batch processing machine with bipartite compatibility graphs
Boudhar, Mourad, (2003)
-
Scheduling: Agreement graph vs resource constraints
Bendraouche, Mohamed, (2015)
- More ...