Performance guarantees for a scheduling problem with common stepwise job payoffs.
Yasmina SeddikChristophe GonzalesSafia Kedad-SidhoumPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- scheduling problem
- flowshop
- processing times
- maximum lateness
- single machine
- job shop
- identical parallel machines
- parallel machine scheduling problem
- dispatching rule
- production scheduling
- limited capacity
- release dates
- completion times
- tabu search
- total tardiness
- setup times
- np hard
- parallel machines
- minimizing makespan
- sequence dependent setup times
- identical machines
- scheduling jobs
- incomplete information
- total weighted tardiness
- game theory
- precedence constraints
- single machine scheduling problem
- scheduling decisions
- evolutionary algorithm
- permutation flowshop
- strongly np hard
- perfect information
- information systems
- job processing times
- theoretical guarantees