Scheduling of workflow jobs based on twostep clustering and lowest job weight.
Hazem M. Al-NajjarS. S. N. AlhadyJunita Mohamad-SalehNadia Al-RousanPublished in: Concurr. Comput. Pract. Exp. (2021)
Keyphrases
- identical parallel machines
- identical machines
- processing times
- job scheduling
- scheduling problem
- release dates
- release times
- scheduling jobs
- single machine
- deteriorating jobs
- batch processing
- maximum lateness
- single machine scheduling problem
- fixed number
- parallel machines
- minimize total
- completion times
- batch processing machines
- sequence dependent setup times
- k means
- flowshop
- clustering algorithm
- setup times
- scheduling decisions
- limited capacity
- strongly np hard
- precedence constraints
- unrelated parallel machines
- competitive ratio
- parallel machine scheduling problem
- scheduling strategy
- scheduling algorithm
- number of tardy jobs
- job processing times
- single server
- weighted number of tardy jobs
- web services
- shortest processing time
- job shop
- clustering method
- precedence relations
- asymptotic optimality
- resource consumption
- job shop scheduling problem
- np hard
- total weighted tardiness
- weighted tardiness
- optimal scheduling
- minimizing makespan
- resource constraints
- resource allocation
- tardiness cost
- tardiness penalties