On Solving Non-preemptive Mixed-criticality Match-up Scheduling Problem with Two and Three Criticality Levels.
Antonín NovákPremysl SuchaZdenek HanzálekPublished in: CoRR (2016)
Keyphrases
- scheduling problem
- single machine
- processing times
- np hard
- flowshop
- setup times
- precedence constraints
- minimizing makespan
- strongly np hard
- tabu search
- earliness tardiness
- permutation flowshop
- high levels
- solving problems
- search algorithm for solving
- sequence dependent setup times
- parallel machines
- levels of abstraction
- computational complexity
- neural network
- preventive maintenance
- maximum lateness
- total tardiness
- lower bound
- case study