Two-machine flow shop problem with unit-time operations and conflict graph
Year of publication: |
1-15 March 2017
|
---|---|
Authors: | Tellache, Nour El Houda ; Boudhar, Mourad |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 55.2017, 5/6 (1/15.3.), p. 1664-1679
|
Subject: | scheduling | flow shop | conflict graph | mixed-integer linear programming | branch and bound | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
Some new clique inequalities in four-index hub location models
Landete, Mercedes, (2024)
-
A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
Bianchessi, Nicola, (2021)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
- More ...
-
Flow shop scheduling problem with conflict graphs
Tellache, Nour El Houda, (2018)
-
A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
Tellache, Nour El Houda, (2023)
-
Linear lexicographic optimization and preferential bidding system
Tellache, Nour El Houda, (2024)
- More ...