Flexible job-shop scheduling problem with job precedence constraints and interval grey processing time.
Zhenwei ZhuXionghui ZhouPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- precedence constraints
- maximum lateness
- scheduling problem
- single machine scheduling problem
- release dates
- flowshop
- job shop scheduling
- grey relation
- job shop scheduling problem
- branch and bound algorithm
- processing times
- identical machines
- sequence dependent setup times
- single machine
- precedence relations
- release times
- parallel machines
- approximation algorithms
- setup times
- vertex cover
- parallel processors
- multi objective
- np hard
- partial order
- series parallel
- scheduling jobs
- global constraints
- partially ordered
- completion times
- multiple attribute decision making
- lower bound
- neural network
- tabu search
- upper bound
- branch and bound
- optimization problems