Minimizing Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine Using a Discrete Particle Swarm Optimization Algorithm
暂无分享,去创建一个
[1] Débora P. Ronconi,et al. Minimizing earliness and tardiness penalties in a single-machine problem with a common due date , 2005, Eur. J. Oper. Res..
[2] Martin Feldmann,et al. Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches , 2003 .
[3] H. G. Kahlbacher,et al. A proof for the longest‐job‐first policy in one‐machine scheduling , 1991 .
[4] Suresh P. Sethi,et al. Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..
[5] Martin Feldmann,et al. Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates , 2001, Comput. Oper. Res..
[6] Russell C. Eberhart,et al. A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.
[7] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..