Job shop scheduling with the option of jobs outsourcing
Year of publication: |
2019
|
---|---|
Authors: | Safarzadeh, Hamid ; Kianfar, Farhad |
Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 57.2019, 10, p. 3255-3272
|
Subject: | constraint programming | job shop scheduling | lower bounds | mathematical programming | outsourcing | relaxation | subcontracting | Outsourcing | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research | Theorie | Theory |
-
An exact algorithm for the Blocks Relocation Problem with new lower bounds
Quispe, Kent E. Yucra, (2018)
-
Improved lower bounds for the online bin stretching problem
Gabay, Michaƫl, (2017)
-
Lower bounds for a bin packing problem with linear usage cost
Braune, Roland, (2019)
- More ...
-
Ramyar, Sepehr, (2019)
-
Baraki, Roohollah Ramezanzadeh, (2017)
-
Dynamic shortest path in stochastic dynamic networks: Ship routing problem
Azaron, Amir, (2003)
- More ...