Openshop and flowshop scheduling to minimize sum of completion times.
Igal AdiriNeta AmitPublished in: Comput. Oper. Res. (1984)
Keyphrases
- flowshop scheduling
- sum of completion times
- scheduling problem
- flowshop
- completion times
- lower bound
- flowshop scheduling problems
- single machine
- processing times
- np hard
- tabu search
- minimizing makespan
- upper bound
- precedence constraints
- special case
- permutation flowshop
- weighted sum
- parallel machines
- neural network
- linear programming
- genetic algorithm