Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint.
Ehsan MolaeeGhasem MoslehiMohammad ReisiPublished in: Comput. Math. Appl. (2011)
Keyphrases
- number of tardy jobs
- single machine scheduling problem
- single machine scheduling
- single machine
- processing times
- sequence dependent setup times
- release dates
- branch and bound algorithm
- combinatorial optimization
- scheduling problem
- lagrangian relaxation
- setup times
- precedence constraints
- resource consumption
- search procedure
- completion times
- cost function
- genetic algorithm
- optimization problems
- dynamic programming