Single machine scheduling to minimize weighted earliness subject to maximum tardiness.
Tsiushuang ChenXiangtong QiFengsheng TuPublished in: Comput. Oper. Res. (1997)
Keyphrases
- single machine scheduling problem
- single machine scheduling
- maximum tardiness
- completion times
- bicriteria
- branch and bound algorithm
- single machine
- processing times
- precedence constraints
- combinatorial optimization
- search procedure
- hybrid algorithm
- scheduling problem
- resource consumption
- branch and bound
- optimal solution
- lagrangian relaxation
- particle swarm optimization
- np hard