Approximability of scheduling problems with resource consuming jobs.
Péter GyörgyiTamás KisPublished in: Ann. Oper. Res. (2015)
Keyphrases
- scheduling problem
- processing times
- flowshop
- permutation flowshop
- setup times
- parallel machines
- precedence constraints
- single machine
- earliness tardiness
- total tardiness
- unrelated parallel machines
- identical parallel machines
- high multiplicity
- parallel machine scheduling problem
- release dates
- sequence dependent setup times
- identical machines
- np hard
- minimizing makespan
- strongly np hard
- approximation algorithms
- limited capacity
- total weighted tardiness
- maximum lateness
- optimal scheduling
- job shop scheduling
- single machine scheduling problem
- weighted tardiness
- completion times
- list scheduling
- release times
- polynomial time approximation
- job shop scheduling problem
- job shop
- tardiness penalties
- tabu search
- minimize total
- deteriorating jobs
- randomly generated test problems
- greedy heuristics
- special case
- greedy algorithm
- error bounds
- objective function