Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times.
Chung-Yee LeeSurya Danusaputro LimanPublished in: Discret. Appl. Math. (1993)
Keyphrases
- completion times
- parallel machines
- scheduling problem
- unrelated parallel machines
- np hard
- flowshop
- single machine
- processing times
- precedence constraints
- single machine scheduling problem
- minimize total
- release times
- open shop
- absolute deviation
- sequence dependent setup times
- release dates
- scheduling jobs
- lot sizing
- weighted sum
- identical parallel machines
- setup times
- job shop
- special case
- job shop scheduling
- tabu search
- single server
- optimal solution
- integer programming
- branch and bound algorithm
- resource consumption
- lower bound
- queue length