On an on-line scheduling problem for parallel jobs.
Edwin NaroskaUwe SchwiegelshohnPublished in: Inf. Process. Lett. (2002)
Keyphrases
- scheduling problem
- identical machines
- parallel machines
- flowshop
- processing times
- single machine
- total tardiness
- setup times
- earliness tardiness
- permutation flowshop
- minimizing makespan
- precedence constraints
- maximum lateness
- identical parallel machines
- unrelated parallel machines
- job scheduling
- release dates
- parallel machine scheduling problem
- sequence dependent setup times
- total weighted tardiness
- limited capacity
- batch processing machines
- minimize total
- weighted tardiness
- scheduling jobs
- tabu search
- np hard
- completion times
- strongly np hard
- optimal scheduling
- single machine scheduling problem
- scheduling decisions
- job shop
- list scheduling
- randomly generated test problems
- sum of completion times
- open shop
- distributed memory
- parallel computing
- evolutionary algorithm
- production scheduling
- multi item
- single server
- job processing times
- job shop scheduling problem
- steady state
- special case