Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown.
Faicel HnaienTaha ArbaouiPublished in: Ann. Oper. Res. (2023)
Keyphrases
- scheduling problem
- np hard
- single machine
- processing times
- setup times
- flowshop
- tabu search
- precedence constraints
- permutation flowshop
- parallel machines
- earliness tardiness
- unrelated parallel machines
- neural network
- total tardiness
- job shop scheduling problem
- data sets
- upper bound
- bayesian networks
- preventive maintenance
- minimizing makespan
- databases