Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed.
Meral AzizogluMurat KöksalanSuna Kondakci KöksalanPublished in: J. Oper. Res. Soc. (2003)
Keyphrases
- number of tardy jobs
- completion times
- single machine scheduling problem
- single machine
- scheduling problem
- sequence dependent setup times
- flowshop
- single machine scheduling
- processing times
- release dates
- tardiness penalties
- precedence constraints
- total weighted tardiness
- bicriteria
- parallel machines
- setup times
- branch and bound algorithm
- combinatorial optimization
- lagrangian relaxation
- tardiness cost
- search procedure
- np hard
- resource consumption
- dynamic programming
- special case
- genetic algorithm
- hybrid algorithm
- minimizing makespan