Bi-criteria two-machine flow shop scheduling problem involving sequence-dependent setup times and pieces multiplicity.
Djedjiga OuiddirMourad BoudharKarima Bouibede-HocinePublished in: Int. J. Math. Oper. Res. (2023)
Keyphrases
- scheduling problem
- flowshop
- bicriteria
- sequence dependent setup times
- processing times
- single machine
- total weighted tardiness
- setup times
- maximum lateness
- parallel machines
- precedence constraints
- np hard
- tabu search
- completion times
- release dates
- upper bound
- single machine scheduling problem
- integer linear programming