A Particle Swarm Optimization Algorithm for Scheduling Against Restrictive Common Due Dates

References

• Baker , K. and Scudder , G. 1990 . Sequencing with earliness and tardiness penalties: A review . Operations Research , 38 : 22 – 36 .
   Web of Science ®Google Scholar
• S. French , Sequencing and scheduling, an introduction to the mathematics of the job-shop Ellis Horwood publication , 1990 .
   Google Scholar
• Kanet , J.J. 1981 . Minimizing the average deviation of job completion times about a common due date . Naval Research Logistics , 28 : 643 – 651 .
   Web of Science ®Google Scholar
• Hall , N. 1986 . Single and multiple processor models for minimizing completion time variance . Naval Research Logistics Quarterly , 33 : 49 – 54 .
   Google Scholar
• Bagchi , U. , Sullivan , R.S. and Chang , Y.L . 1986 . Minimizing mean absolute deviation of completion times about a common due-date . Naval Research Logistics Quarterly , 33 : 227 – 240 .
   Google Scholar
• Bagchi , U. , Sullivan , R.S. and Chang , Y.L. 1987 . Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties about a common due-date . Naval Research Logistics Quarterly , 34 : 739 – 751 .
   Google Scholar
• Hall , N. and Posner , M. 1991 . Earliness-tardiness scheduling problems I: weighted deviation of completion times about a common date . Operations Research , 39 : 836 – 846 .
   Web of Science ®Google Scholar
• De , P. , Ghosh , J.B and Wells , C.E. 1994 . Solving a generalized model for CON due date assignment and sequencing . Int. Journal of Production Economics , 34 : 179 – 185 .
   Web of Science ®Google Scholar
• Hoogeveen , J.A. and van de Velde , S.L. 1997 . Earlinesstardiness scheduling around almost equal due date . INFORMS Journal on Computing , 9 : 92 – 99 .
   Google Scholar
• Cheng , T. and Gupta , M. 1989 . Survey of scheduling research involving due date determination decision . European Journal of Operational Research , 38 : 156 – 166 .
   Web of Science ®Google Scholar
• Gordon , V. , Proth , J.-M. and Chu , C. 2002 . A survey of the state-of-the-art of common due date assignment and scheduling research . European Journal of Operational Research , 139 : 1 – 25 .
   Web of Science ®Google Scholar
• Abdul-Razaq , T. and Potts , C.N. 1988 . Dynamic programming state-space relaxation for single-machine scheduling . Journal of the Operational Research Society , 39 : 141 – 152 .
   Web of Science ®Google Scholar
• Souza , J.P. and Wolsey , L.A. 1992 . A time indexed formulation of non-preemptive single machine scheduling problems . Mathematical Programming , 54 : 353 – 367 .
   Google Scholar
• Almeida , M.-T. and Centeno , M. 1998 . A composite heuristic for the single machine early/tardy job scheduling problem . Computers and Operations Research , 25 : 625 – 635 .
   Web of Science ®Google Scholar
• Lee , C.-Y. and Kim , S.J. 1995 . Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights . Computers and Industrial Engineering , 28 : 231 – 248 .
   Web of Science ®Google Scholar
• Hao , Q. , Yang , Z. , Wang , D. and Li , Z. 1996 . Common due date determination and sequencing using tabu search . Computers and Operations Research , 23 : 409 – 417 .
   Web of Science ®Google Scholar
• James , R.J.W. 1997 . Using tabu search to solve the common due date early/tardy machine scheduling problem . Computers and Operations Research , 24 : 199 – 208 .
   Web of Science ®Google Scholar
• Feldmann , M. and Biskup , D. 2003 . Single-machine scheduling for minimizing earliness and tardiness penalties by metaheuristic approaches . Computers and Industrial Engineering , 44 : 307 – 323 .
   Web of Science ®Google Scholar
• Nearchou , A.C. and Omirou , S.L. 2006 . Differential evolution for sequencing and scheduling optimization . Journal of Heuristics , 12 : 395 – 411 .
   Web of Science ®Google Scholar
• Nearchou , A.C. 2008 . A differential evolution approach for the common due date early/tardy job scheduling problem . Computers & Operations Research , 35 : 1329 – 1343 .
   Web of Science ®Google Scholar
• Z.-J. Lee , C.-C. Chuang and K.-C. Ying , An intelligent algorithm for scheduling jobs on a single machine with a common due date , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4693 LNAI (PART 2) 2007 689 – 695 .
   Google Scholar
• Lee , Z.-J. , Lin , S.-W. and Ying , K.-C. 2008 . A dynamical ant colony optimization with heuristics for scheduling jobs on a single machine with a common due date . Studies in Computational Intelligence , 128 : 91 – 103 .
   Google Scholar
• R. M'Hallah , and A. Alhajraf , Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem , in New Frontiers in Applied Artificial Intelligence: Lecture Notes in Computer Science , N.T. Nguyen et al. . (Eds.) 5027 2008 397 – 407 .
   Google Scholar
• Reisi , M. and Moslehi , G. 2011 . Minimizing the number of tardy jobs and maximum earliness in the single machine scheduling using an artificial immune system . Int Journal of Advanced Manufacturing Technology , 54 : 749 – 756 .
   Google Scholar
• Biskup , D. and Feldmann , M. 2001 . Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates . Computers and Operations Research , 28 : 787 – 801 .
   Web of Science ®Google Scholar
• R.C. Eberhart and J. Kennedy , A new optimizer using particle swarm theory , in Proc. of the 6th Int. Symposium on Micro Machine and Human Science , 1995 39 – 43 .
   Google Scholar
• Anghinolfi and M. Paolucci , A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times , European Journal of Operational Research 193 2009 73 – 85 .
   Web of Science ®Google Scholar
• Low , C. , Hsu , C.-J. and Su , C.-T. 2010 . A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance . Expert Systems with Applications , 37 : 6429 – 6434 .
   Web of Science ®Google Scholar
• Q.-K. Pan , M.F. Tasgetiren and Y.-C. Liang , A discrete particle swarm optimization algorithm for single machine total earliness and tardiness problem with a common due date . In: Proc. of the World Congress on Evolutionary Computation CEC'06, Vancouver, Canada 2006 3281 – 3288 .
   Google Scholar
• Cheng , T.C.E. and Kahlbacher , H.G. 1991 . A proof for the longest/job/first policy in one/machine scheduling . Naval Research Logistics , 38 : 715 – 720 .
   Web of Science ®Google Scholar
• Ting , T.-On , Rao , M.V.C. , Loo , C.K. and Ngu , S.S. 2003 . Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization . Journal of Heuristics , 9 : 507 – 520 .
   Web of Science ®Google Scholar
• Clerc , M. 2004 . “ Discrete particle swarm optimization, illustrated by the traveling salesman problem ” . In New Optimization Techniques in Engineering , 219 – 239 . Heidelberg , , Germany : Springer .
   Google Scholar
• Salman , Ahmad , I. and Al-Madani , S. 2003 . Particle swarm optimization for task assignment problem . Microprocessors and Microsystems , 26 : 363 – 371 .
   Web of Science ®Google Scholar
• Onwubolu , G.C. and Clerc , M. 2004 . Optimal operational path for automated drilling operations by a new heuristic approach using particle swarm optimization . Int. Journal of Production Research , 42 : 473 – 491 .
   Web of Science ®Google Scholar
• Liu , S. , Tang , J. and Song , J. 2006 . Order-planning model and algorithm for manufacturing steel sheets . Int Journal of Production Economics , 100 : 30 – 43 .
   Web of Science ®Google Scholar
• Mohemmed , A.W. , Sahoo , N. C. and Geok , T. K. 2008 . Solving shortest path problem using particle swarm optimization . Applied Soft Computing , 8 : 1643 – 1653 .
   Web of Science ®Google Scholar
• K. Rameshkumar , R.K. Suresh , and K.M. Mohanasundaram , Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan , in Proc. ICNC 2005 , L. Wang , K. Chen , and Y.S. Ong (Eds.), Springer-Verlag , Berlin 2005 572 – 581 .
   Google Scholar
• Liao , C.–J. , Tseng , C.-T. and Luarn , P. 2007 . A discrete version of particle swarm optimization for flowshop scheduling problems . Computers & Operations Research , 34 : 3099 – 3111 .
   Web of Science ®Google Scholar
• Lian , Z. , Gu , X. and Jiao , B. 2008 . A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan . Chaos, Solitons & Fractals , 5 : 851 – 861 .
   Google Scholar
• Tseng , C.-T. and Liao , C.-J. 2008 . A discrete particle swarm optimization for lot-streaming flowshop scheduling problem . European Journal of Operational Research , 191 : 360 – 373 .
   Web of Science ®Google Scholar
• Zhang , A. , Sun , J. , Zhu , X. and Yang , Q. 2008 . An improved particle swarm optimization algorithm for flowshop scheduling problem . Information Processing Letters , 108 : 204 – 209 .
   Google Scholar
• Tasgetiren , M.F. , Liang , Y.-C. , Sevkli , M. and Gencyilmaz , G. 2006 . Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem . Int. Journal of Production Research , 44 : 4737 – 4754 .
   Web of Science ®Google Scholar
• Allahverdi and Al-Anzi , F.S. 2006 . Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times . Int. Journal of Production Research , 44 : 4713 – 4735 .
   Web of Science ®Google Scholar
• Lei , A Pareto archive particle swarm optimization for multi-objective job shop scheduling , Computers & Industrial Engineering 54 2008 960 – 971
   Web of Science ®Google Scholar
• Lin , T.-L. , Horng , S.-J. , Kao , T.-W. , Chen , Y.-H. , Run , R.-S. , Chen , R.-J. , Lai , J.-L. and Kuo , I-H. 2010 . An efficient job-shop scheduling algorithm based on particle swarm optimization . Expert Systems with Applications , 37 : 2629 – 2636 .
   Web of Science ®Google Scholar
• J. Kennedy , The behavior of particles , In: Porto V.W. , Saravanan N , Waagen D. and Eiben A.E. (eds) Evolutionary Programming VII Springer 1998 581 – 590 .
   Google Scholar
• Parsopoulos , K.E. and Vrahatis , M.N. 2002 . Recent approaches to global optimization problems through particle swarm optimization . Natural Computing , 1 : 235 – 306 .
   Google Scholar
• Carlisle and G. Dozier , An Off-The-Shelf PSO , in Proc. of the Particle Swarm Optimization Workshop 2001 , pp. 1 – 6
   Google Scholar
• Michalewicz , Z. and Fogel , D.B . 2000 . How to solve it: Modern heuristics , Berlin : Springer-Verlag .
   Google Scholar
• Eiben , A.E. and Smith , J.E. 2003 . Introduction to evolutionary computing , Springer : Berlin .
   Google Scholar
• Metropolis , N. , Rosenbluth , A. , Rosenbluth , M. , Teller , A. and Teller , E. 1953 . Equation of state calculations for fast computing machines . Journal of Chemical Physics , 21 : 1087 – 1092 .
   Google Scholar