A Particle Swarm Optimization Algorithm for Scheduling Against Restrictive Common Due Dates
- DOI
- 10.1080/18756891.2013.802874How to use a DOI?
- Keywords
- Meta-heuristics, swarm intelligence, combinatorial optimization, job scheduling, just-in-time
- Abstract
Focusing on the just-in-time (JIT) operations management, earliness as well as, tardiness of jobs’ production and delivery should be discouraged. In accordance to this philosophy, scheduling problems involving earliness and tardiness penalties are very critical for the operations manager. In this paper, a new population heuristic based on the particle swarm optimization (PSO) technique is presented to solve the single machine early/tardy scheduling problem against a restrictive common due date. This type of scheduling sets costs depending on whether a job finished before (earliness), or after (tardiness) the specified due date. The objective is to minimize a summation of earliness and tardiness penalty costs, thus pushing the completion time of each job as close as possible to the due date. The problem is known to be -hard, and therefore large size instances cannot be addressed by traditional mathematical programming techniques. The performance of the proposed PSO heuristic is measured over benchmarks problems with up to 1000 jobs taken from the open literature, and found quite high and promising in respect to the quality of the solutions obtained. Particularly, PSO was found able to improve the 82% of the existing best known solutions of the examined benchmarks test problems.
- Copyright
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - JOUR AU - Andreas C. Nearchou AU - Sotiris L. Omirou PY - 2013 DA - 2013/07/01 TI - A Particle Swarm Optimization Algorithm for Scheduling Against Restrictive Common Due Dates JO - International Journal of Computational Intelligence Systems SP - 684 EP - 699 VL - 6 IS - 4 SN - 1875-6883 UR - https://doi.org/10.1080/18756891.2013.802874 DO - 10.1080/18756891.2013.802874 ID - Nearchou2013 ER -