Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 537127, 11 pages
http://dx.doi.org/10.1155/2013/537127
Research Article

A Hybrid Genetic Algorithm to Minimize Total Tardiness for Unrelated Parallel Machine Scheduling with Precedence Constraints

School of Management, Hangzhou Dianzi University, Hangzhou 310018, China

Received 9 March 2013; Revised 7 June 2013; Accepted 19 June 2013

Academic Editor: Jyh-Horng Chou

Copyright © 2013 Chunfeng Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. G. Ramachandra and S. E. Elmaghraby, “Sequencing precedence-related jobs on two machines to minimize the weighted completion time,” International Journal of Production Economics, vol. 100, no. 1, pp. 44–58, 2006. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Queyranne and A. S. Schulz, “Approximation bounds for a general class of precedence constrained parallel machine scheduling problems,” SIAM Journal on Computing, vol. 35, no. 5, pp. 1241–1253, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. E.-S. Kim, C.-S. Sung, and I.-S. Lee, “Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints,” Computers & Operations Research, vol. 36, no. 3, pp. 698–710, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. B. Gacias, C. Artigues, and P. Lopez, “Parallel machine scheduling with precedence constraints and setup times,” Computers & Operations Research, vol. 37, no. 12, pp. 2141–2151, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. R. Driessel and L. Mönch, “Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times,” Computers & Industrial Engineering, vol. 61, no. 2, pp. 336–345, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Yuan, W. Li, and J. Yuan, “A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints,” Theoretical Computer Science, vol. 457, pp. 174–180, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. P. Brucker, J. Hurink, and W. Kubiak, “Scheduling identical jobs with chain precedence constraints on two uniform machines,” Mathematical Methods of Operations Research, vol. 49, no. 2, pp. 211–219, 1999. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. G. J. Woeginger, “A comment on scheduling on uniform machines under chain-type precedence constraints,” Operations Research Letters, vol. 26, no. 3, pp. 107–109, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. E.-S. Kim, “Scheduling of uniform parallel machines with s-precedence constraints,” Mathematical and Computer Modelling, vol. 54, no. 1-2, pp. 576–583, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. A. van Zuylen, “An improved monotone algorithm for scheduling related machines with precedence constraints,” Operations Research Letters, vol. 39, no. 6, pp. 423–427, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. J. Herrmann, J.-M. Proth, and N. Sauer, “Heuristics for unrelated machine scheduling with precedence constraints,” European Journal of Operational Research, vol. 102, no. 3, pp. 528–537, 1997. View at Google Scholar · View at Scopus
  12. V. S. A. Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan, “Scheduling on unrelated machines under tree-like precedence constraints,” Algorithmica, vol. 55, no. 1, pp. 205–226, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. M. Nouri and M. Ghodsi, “Scheduling tasks with exponential duration on unrelated parallel machines,” Discrete Applied Mathematics, vol. 160, no. 16-17, pp. 2462–2473, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. C.-L. Chen and C.-L. Chen, “Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines,” Computers & Industrial Engineering, vol. 56, no. 4, pp. 1393–1401, 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. Z. Zhang, L. Zheng, N. Li, W. Wang, S. Zhong, and K. Hu, “Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning,” Computers & Operations Research, vol. 39, no. 7, pp. 1315–1324, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. C.-F. Liaw, Y.-K. Lin, C.-Y. Cheng, and M. Chen, “Scheduling unrelated parallel machines to minimize total weighted tardiness,” Computers & Operations Research, vol. 30, no. 12, pp. 1777–1789, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. D.-W. Kim, D.-G. Na, and F. F. Chen, “Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective,” Robotics and Computer-Integrated Manufacturing, vol. 19, no. 1-2, pp. 173–181, 2003. View at Publisher · View at Google Scholar · View at Scopus
  18. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. J. Du and J. Y.-T. Leung, “Minimizing total tardiness on one machine is NP-hard,” Mathematics of Operations Research, vol. 15, no. 3, pp. 483–495, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. C. Jou, “A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines,” Computers & Industrial Engineering, vol. 48, no. 1, pp. 39–54, 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. R. Tavakkoli-Moghaddam, F. Taheri, M. Bazzazi, M. Izadi, and F. Sassani, “Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints,” Computers and Operations Research, vol. 36, no. 12, pp. 3224–3230, 2009. View at Publisher · View at Google Scholar · View at Scopus
  22. R. Tavakkoli-Moghaddam, N. Safaei, and F. Sassani, “A memetic algorithm for the flexible flow line scheduling problem with processor blocking,” Computers & Operations Research, vol. 36, no. 2, pp. 402–414, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. C. Liu and S. Yang, “A hybrid genetic algorithm for integrated project task and multi-skilled workforce scheduling,” Journal of Computational Information Systems, vol. 7, no. 6, pp. 2187–2194, 2011. View at Google Scholar · View at Scopus
  24. N. Balakrishnan, J. J. Kanet, and V. Sridharan, “Early/tardy scheduling with sequence dependent setups on uniform parallel machines,” Computers & Operations Research, vol. 26, no. 2, pp. 127–141, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. N. G. Hall and M. E. Posner, “Generating experimental data for computational testing with machine scheduling applications,” Operations Research, vol. 49, no. 6, pp. 854–865, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet