Preemptable Malleable Task Scheduling Problem.
Jacek BlazewiczMikhail Y. KovalyovMaciej MachowiakDenis TrystramJan WeglarzPublished in: IEEE Trans. Computers (2006)
Keyphrases
- scheduling problem
- processing times
- single machine
- flowshop
- np hard
- setup times
- tabu search
- earliness tardiness
- permutation flowshop
- release dates
- job scheduling
- total tardiness
- precedence constraints
- minimizing makespan
- single machine scheduling problem
- sequence dependent setup times
- maximum lateness
- job shop scheduling problem
- identical machines
- parallel machines
- unrelated parallel machines
- list scheduling
- database
- limited capacity
- multi agent
- learning algorithm
- neural network