Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption.
Danial KhorasanianGhasem MoslehiPublished in: Comput. Oper. Res. (2017)
Keyphrases
- scheduling problem
- multi task
- parallel machines
- flowshop
- multi task learning
- processing times
- learning tasks
- single machine
- completion times
- minimizing makespan
- batch processing
- multiple tasks
- multitask learning
- tabu search
- np hard
- multi class
- sparse learning
- feature selection
- gaussian processes
- learning problems
- transfer learning
- data sets
- high order
- graph cuts
- prior knowledge
- learning algorithm
- machine learning