Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs.
N. MadhushiniChandrasekharan RajendranY. DeepaPublished in: J. Oper. Res. Soc. (2009)
Keyphrases
- completion times
- weighted tardiness
- scheduling problem
- single machine scheduling problem
- single machine
- flowshop
- branch and bound algorithm
- processing times
- minimize total
- sequence dependent setup times
- setup times
- release dates
- total weighted tardiness
- precedence constraints
- parallel machines
- np hard
- minimizing makespan
- tabu search
- permutation flowshop
- lower bound
- combinatorial optimization
- strongly np hard
- job shop scheduling problem
- branch and bound
- search procedure
- upper bound
- lagrangian relaxation
- resource consumption
- flowshop scheduling
- search algorithm
- cost function
- dynamic programming
- simulated annealing
- resource allocation