A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
Year of publication: |
2023
|
---|---|
Authors: | Nip, Kameng ; Wang, Zhenbo |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 26.2023, 6, p. 543-558
|
Subject: | Computational complexity | Flow shop scheduling | Job shop scheduling | Linear programming | Open shop scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Produktionssteuerung | Production control |
-
Shioura, Akiyoshi, (2016)
-
Parallel machine scheduling with speed-up resources
Chen, Lin, (2018)
-
A note on scheduling on uniform parallel machines with unavailability constraints
Xu, Dehua, (2021)
- More ...
-
Assortment Optimization under a Single Transition Choice Model
Nip, Kameng, (2021)
-
Resource loading with time windows
Talla Nobibon, Fabrice, (2015)
-
Assortment Optimization Under a Single Transition Model
Nip, Kameng, (2020)
- More ...