Minimizing tardiness and maintenance costs in flow shop scheduling by a lower-bound-based GA.
Andrew Junfang YuJavad SeifPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- maintenance cost
- lower bound
- hybrid genetic algorithm
- scheduling problem
- genetic algorithm ga
- quadratic assignment problem
- flowshop
- upper bound
- storage space
- np hard
- genetic algorithm
- single machine
- processing times
- branch and bound algorithm
- single machine scheduling problem
- preventive maintenance
- branch and bound
- competitive ratio
- completion times
- hybrid algorithm
- response time
- lower and upper bounds
- materialized views
- job shop scheduling problem
- optimal solution
- tabu search
- fitness function
- ant colony optimization
- artificial neural networks
- simulated annealing
- objective function
- parallel machines
- evolutionary algorithm
- query processing
- precedence constraints
- case study
- data sets
- sufficiently accurate
- technological change