Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop.
Davide ZorzenonNataliia ZaietsJörg RaischPublished in: CoRR (2022)
Keyphrases
- case study
- makespan minimization
- processing times
- linear inequalities
- scheduling problem
- single machine
- metaheuristic
- job shop scheduling problem
- special case
- parallel machines
- total weighted tardiness
- flowshop
- polynomial time approximation
- search algorithm
- theoretical analysis
- knapsack problem
- polynomially solvable
- neural network