Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times.
Jianfa CaoJinjiang YuanWenjie LiHailin BuPublished in: Int. J. Syst. Sci. (2011)
Keyphrases
- precedence constraints
- processing times
- scheduling problem
- identical machines
- release dates
- identical parallel machines
- flowshop
- parallel machines
- single machine
- parallel machine scheduling problem
- scheduling jobs
- maximum lateness
- precedence relations
- setup times
- sequence dependent setup times
- single machine scheduling problem
- parallel processors
- total weighted tardiness
- makespan minimization
- np hard
- branch and bound algorithm
- release times
- approximation algorithms
- number of tardy jobs
- worst case performance ratio
- tabu search
- job processing times
- scheduling decisions
- polynomially solvable
- completion times
- strongly np hard
- job shop
- global constraints
- resource consumption
- partially ordered
- job shop scheduling problem
- special case
- optimal solution
- manufacturing cell
- partial order
- parallel algorithm
- worst case
- search algorithm