Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial Information.
Yong HeYiwei JiangPublished in: ISAAC (2005)
Keyphrases
- parallel machines
- partial information
- scheduling problem
- unrelated parallel machines
- incomplete information
- single machine
- precedence constraints
- total tardiness
- minimize total
- sequence dependent setup times
- weighted tardiness
- flowshop
- release dates
- scheduling jobs
- setup times
- processing times
- parallel computing
- single server
- np hard
- job shop
- scheduling algorithm
- job shop scheduling problem
- identical parallel machines
- orders of magnitude
- online algorithms
- shared memory
- special case