The job shop scheduling problem with convex costs.
Reinhard BürgyKerem BülbülPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- job shop scheduling problem
- job shop scheduling
- critical path
- benchmark problems
- scheduling problem
- tabu search
- simulated annealing
- genetic algorithm
- production scheduling
- memetic algorithm
- combinatorial optimization problems
- job shop
- graph model
- total weighted tardiness
- convex hull
- benchmark instances
- total cost
- tabu search algorithm
- test problems
- solution quality
- combinatorial optimization
- optimization problems
- cost function