Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time.
N. NekoiemehrGhasem MoslehiPublished in: J. Oper. Res. Soc. (2011)
Keyphrases
- single machine scheduling problem
- maximum tardiness
- completion times
- single machine scheduling
- branch and bound algorithm
- bicriteria
- release dates
- scheduling problem
- processing times
- single machine
- sequence dependent setup times
- precedence constraints
- resource consumption
- flowshop
- search procedure
- combinatorial optimization
- np hard
- branch and bound
- upper bound
- evolutionary algorithm