An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs.
Chung-Lun LiGur MosheiovUri YovelPublished in: Comput. Oper. Res. (2008)
Keyphrases
- equal sized
- earliness tardiness
- worst case
- cost function
- dynamic programming
- single machine scheduling problem
- hybrid algorithm
- np hard
- computational complexity
- particle swarm optimization
- markov random field
- distributed systems
- optimization algorithm
- combinatorial optimization
- convex hull
- processing times
- parallel machines
- scheduling problem
- special case
- search space