Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem.
Ehsan MolaeeGhasem MoslehiMohammad ReisiPublished in: Comput. Math. Appl. (2010)
Keyphrases
- number of tardy jobs
- single machine scheduling problem
- single machine scheduling
- single machine
- processing times
- branch and bound algorithm
- sequence dependent setup times
- release dates
- setup times
- combinatorial optimization
- scheduling problem
- resource consumption
- hybrid algorithm
- search procedure
- precedence constraints
- completion times
- genetic algorithm
- upper bound
- lower bound
- branch and bound
- response time
- dynamic programming
- search algorithm