Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration.
Na YinLiying KangPublished in: Asia Pac. J. Oper. Res. (2015)
Keyphrases
- minimizing makespan
- scheduling problem
- flowshop
- total flowtime
- maximum tardiness
- tabu search
- processing times
- inversely proportional
- single machine
- np hard
- special case
- flowshop scheduling
- setup times
- parallel machines
- bicriteria
- neural network
- higher order
- hybrid genetic algorithm
- strongly np hard
- pairwise
- objective function
- image segmentation
- probabilistic model