Mixed graph model and algorithms for parallel-machine job-shop scheduling problems
Year of publication: |
1-15 March 2017
|
---|---|
Authors: | Sotskov, Jurij Nazarovič ; Gholami, Omid |
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. 1549-1564
|
Subject: | flexible job-shop | makespan | mean flow time | mixed graph | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Produktionssteuerung | Production control |
-
Udaiyakumar, Kuppuswamy Chockalingam, (2015)
-
Fekih, Asma, (2020)
-
Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
Flores-Gómez, Mario, (2023)
- More ...
-
Solving parallel machines job-shop scheduling problems by an adaptive algorithm
Gholami, Omid, (2014)
-
Fuzzy stochastic Data Envelopment Analysis with application to NATO enlargement problem
Ebrahimnejad, Ali, (2019)
-
On the calculation of the stability radius of an optimal or an approximate schedule
Sotskov, Jurij Nazarovič, (1997)
- More ...