An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop.
Dipak LahaSagar U. SapkalPublished in: Comput. Ind. Eng. (2014)
Keyphrases
- minimize total
- parallel machines
- single machine
- weighted tardiness
- release dates
- total cost
- sequence dependent setup times
- scheduling problem
- flowshop
- optimal solution
- tabu search
- dynamic programming
- search procedure
- single machine scheduling problem
- precedence constraints
- combinatorial optimization
- processing times
- simulated annealing
- parallel computing
- job shop scheduling problem
- solution quality
- np hard
- response time
- evolutionary algorithm