Minimizing makespan on a three-machine flowshop batch scheduling problem with transportation using genetic algorithm.
Javad BehnamianS. M. T. Fatemi GhomiFariborz JolaiO. AmirtaheriPublished in: Appl. Soft Comput. (2012)
Keyphrases
- minimizing makespan
- flowshop
- scheduling problem
- genetic algorithm
- minimizing total tardiness
- tabu search
- job shop scheduling problem
- total flowtime
- setup times
- single machine
- maximum tardiness
- sequence dependent setup times
- processing times
- maximum lateness
- bicriteria
- dispatching rule
- total tardiness
- special case
- makespan minimization
- flowshop scheduling
- np hard
- parallel machines
- robotic cell
- flowshop scheduling problems
- strongly np hard
- neural network
- total weighted tardiness
- precedence constraints
- multi objective
- permutation flowshop
- search procedure
- unrelated parallel machines
- feasible solution
- preventive maintenance
- job shop
- release dates
- hybrid algorithm
- metaheuristic
- optimization problems
- cost function