Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment.
Richard L. DanielsStella Y. HuaScott WebsterPublished in: Comput. Oper. Res. (1999)
Keyphrases
- scheduling problem
- list scheduling
- parallel machines
- flowshop
- processing times
- maximum lateness
- greedy heuristics
- release dates
- earliness tardiness
- scheduling jobs
- parallel machine scheduling problem
- single machine
- job shop
- total tardiness
- sequence dependent setup times
- identical parallel machines
- makespan minimization
- precedence constraints
- setup times
- single machine scheduling problem
- unrelated parallel machines
- np hard
- total weighted tardiness
- identical machines
- resource consumption
- minimize total
- minimizing makespan
- completion times
- job shop scheduling
- tabu search
- search algorithm
- job shop scheduling problem
- resource allocation
- single server
- special case