A two-machine flowshop problem with processing time-dependent buffer constraints - An application in multimedia presentations.
Feng-Cheng LinJen-Shin HongBertrand M. T. LinPublished in: Comput. Oper. Res. (2009)
Keyphrases
- flowshop
- scheduling problem
- multimedia presentations
- minimizing makespan
- special case
- bicriteria
- flowshop scheduling
- minimizing total tardiness
- precedence constraints
- tabu search
- processing times
- setup times
- maximum lateness
- sequence dependent setup times
- multimedia databases
- robotic cell
- flowshop scheduling problems
- multimedia
- multimedia objects
- parallel machines
- multimedia data
- preventive maintenance
- strongly np hard
- data processing
- computational complexity
- database
- efficient retrieval
- simulated annealing
- knn