Reoptimization of the minimum total flow-time scheduling problem.
Guy BaramTami TamirPublished in: Sustain. Comput. Informatics Syst. (2014)
Keyphrases
- scheduling problem
- single machine
- flowshop
- np hard
- tabu search
- minimizing makespan
- processing times
- parallel machines
- setup times
- precedence constraints
- earliness tardiness
- data sets
- maximum lateness
- flow patterns
- flow field
- special case
- total tardiness
- case study
- potential functions
- particle swarm optimization
- release dates
- sequence dependent setup times
- strongly np hard
- optimal solution
- social networks