Equivalent time-dependent scheduling problems.
Stanislaw GawiejnowiczWieslaw KurcLidia PankowskaPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- scheduling problem
- single machine
- processing times
- tabu search
- precedence constraints
- np hard
- flowshop
- greedy heuristics
- job shop scheduling
- job shop
- sequencing problems
- job shop scheduling problem
- travel time
- special case
- real time
- memetic algorithm
- moving objects
- single machine scheduling problem
- information systems
- setup times
- data sets
- database