A hybrid heuristic algorithm for flowshop inverse scheduling problem under a dynamic environment.
Jianhui MouLiang GaoQianjian GuoJiancai MuPublished in: Clust. Comput. (2017)
Keyphrases
- dynamic environments
- flowshop
- scheduling problem
- single machine
- minimizing makespan
- processing times
- mobile robot
- flowshop scheduling
- sequence dependent setup times
- minimizing total tardiness
- special case
- setup times
- total tardiness
- maximum lateness
- tabu search
- total flowtime
- makespan minimization
- total weighted tardiness
- parallel machines
- flowshop scheduling problems
- np hard
- permutation flowshop
- path planning
- bicriteria
- precedence constraints
- maximum tardiness
- preventive maintenance
- dynamic programming
- release dates
- real environment
- unrelated parallel machines
- job shop scheduling problem
- job processing times
- neural network