Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times.
Lars MönchHari BalasubramanianJohn W. FowlerMichele E. PfundPublished in: Comput. Oper. Res. (2005)
Keyphrases
- identical machines
- parallel machines
- processing times
- scheduling jobs
- unrelated parallel machines
- scheduling problem
- single machine
- worst case performance ratio
- job scheduling
- list scheduling
- wafer fabrication
- parallel machine scheduling problem
- precedence constraints
- identical parallel machines
- minimize total
- sequence dependent setup times
- release dates
- tabu search
- flowshop
- setup times
- optimal solution
- shared memory
- combinatorial optimization
- polynomial time approximation
- strongly np hard
- search algorithm
- release times
- total weighted tardiness
- branch and bound algorithm
- scheduling decisions
- scheduling algorithm
- job shop scheduling problem
- batch size
- branch and bound
- precedence relations
- parallel processors
- dynamic programming
- batch mode