On the complexity of open shop scheduling with time lags
Year of publication: |
2023
|
---|---|
Authors: | Kubiak, Wieslaw |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 26.2023, 3, p. 331-334
|
Subject: | Complexity | Open shop | Time lags | Total completion time | Scheduling-Verfahren | Scheduling problem | Lag-Modell | Lag model | Theorie | Theory | Durchlaufzeit | Lead time | Terminplanung | Time scheduling |
-
Hamdi, Imen, (2019)
-
Minimizing total completion time on a single machine with step improving jobs
Kim, Eun-Seok, (2015)
-
Total completion time with markespan constraint in no-wait flowshops with setup times
Allahverdi, Ali, (2014)
- More ...
-
Efficient algorithms for flexible job shop scheduling with parallel machines
Kubiak, Wieslaw, (2020)
-
Mathematical programming modeling of the Response Time Variability Problem
Corominas, Albert, (2010)
-
A coordinating contract for transshipment in a two-company supply chain
Hezarkhani, Behzad, (2010)
- More ...