The job shop scheduling problem with convex costs
Year of publication: |
1 July 2018
|
---|---|
Authors: | Bürgy, Reinhard ; Bülbül, Kerem |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 268.2018, 1 (1.7.), p. 82-100
|
Subject: | Scheduling | Job shop | Non-regular objective | Convex costs | Tabu search | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
-
Karimi-Nasab, M., (2013)
-
Aircraft landing planning under uncertain conditions
Vié, Marie-Sklaerder, (2022)
-
A stochastic tabu search algorithm to align physician schedule with patient flow
Niroumandrad, Nazgol, (2018)
- More ...
-
The flexible blocking job shop with transfer and set-up times
Gröflin, Heinz, (2011)
-
Fischer, Vera, (2021)
-
Optimal job insertion in the no-wait job shop
Bürgy, Reinhard, (2013)
- More ...