Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2018, Article ID 6024631, 12 pages
https://doi.org/10.1155/2018/6024631
Research Article

Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints

Donlinks School of Economics and Management, University of Science and Technology Beijing, Beijing 100083, China

Correspondence should be addressed to Bailin Wang; nc.ude.btsu@lbgnaw

Received 27 October 2017; Revised 19 January 2018; Accepted 6 February 2018; Published 7 March 2018

Academic Editor: Eusebio Valero

Copyright © 2018 Bailin Wang and Haifeng Wang. 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. C. M. Joo and B. S. Kim, “Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability,” Computers & Industrial Engineering, vol. 85, article no. 3974, pp. 102–109, 2015. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Afzalirad and J. Rezaeian, “Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions,” Computers & Industrial Engineering, vol. 98, pp. 40–52, 2016. View at Publisher · View at Google Scholar · View at Scopus
  3. E. Caniyilmaz, B. Benli, and M. S. Ilkay, “An artificial bee colony algorithm approach for unrelated parallel machine scheduling with processing set restrictions, job sequence-dependent setup times, and due date,” The International Journal of Advanced Manufacturing Technology, vol. 77, no. 9-12, pp. 2105–2115, 2015. View at Publisher · View at Google Scholar · View at Scopus
  4. S. A. Slotnick, “Order acceptance and scheduling: a taxonomy and review,” European Journal of Operational Research, vol. 212, no. 1, pp. 1–11, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. X. Wang, G. Huang, X. Hu, and T. C. Edwin Cheng, “Order acceptance and scheduling on two identical parallel machines,” Journal of the Operational Research Society, vol. 66, no. 10, pp. 1755–1767, 2015. View at Publisher · View at Google Scholar · View at Scopus
  6. S. Emami, M. Sabbagh, and G. Moslehi, “A Lagrangian relaxation algorithm for order acceptance and scheduling problem: A globalised robust optimisation approach,” International Journal of Computer Integrated Manufacturing, vol. 29, no. 5, pp. 535–560, 2016. View at Publisher · View at Google Scholar · View at Scopus
  7. D. Shabtay, N. Gaspar, and M. Kaspi, “A survey on offline scheduling with rejection,” Journal of Scheduling, vol. 16, no. 1, pp. 3–28, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. C.-J. Hsu and C.-W. Chang, “Unrelated parallel-machine scheduling with deteriorating jobs and rejection,” Applied Mechanics and Materials, vol. 263-266, no. 1, pp. 655–659, 2013. View at Publisher · View at Google Scholar · View at Scopus
  9. F. Lin, X. Zhang, and Z. Cai, “Approximation algorithms for scheduling with rejection on two unrelated parallel machines,” International Journal of Advanced Computer Science and Applications, vol. 6, no. 11, 2015. View at Publisher · View at Google Scholar
  10. D. Jiang and J. Tan, “Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines,” Theoretical Computer Science, vol. 616, pp. 94–99, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. H. Tian, K. Li, and W. Liu, “A pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time,” Mathematical Problems in Engineering, vol. 2016, Article ID 1257060, 2016. View at Publisher · View at Google Scholar · View at Scopus
  12. Y.-K. Lin, J. W. Fowler, and M. E. Pfund, “Multiple-objective heuristics for scheduling unrelated parallel machines,” European Journal of Operational Research, vol. 227, no. 2, pp. 239–253, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. S.-W. Lin and K.-C. Ying, “A multi-point simulated annealing heuristic for solving multiple objective unrelated parallel machine scheduling problems,” International Journal of Production Research, vol. 53, no. 4, pp. 1065–1076, 2015. View at Publisher · View at Google Scholar · View at Scopus
  14. S.-W. Lin, K.-C. Ying, W.-J. Wu, and Y.-I. Chiang, “Multi-objective unrelated parallel machine scheduling: A Tabu-enhanced iterated Pareto greedy algorithm,” International Journal of Production Research, vol. 54, no. 4, pp. 1110–1121, 2016. View at Publisher · View at Google Scholar · View at Scopus
  15. M. Afzalirad and J. Rezaeian, “A realistic variant of bi-objective unrelated parallel machine scheduling problem: NSGA-II and MOACO approaches,” Applied Soft Computing, vol. 50, pp. 109–123, 2017. View at Publisher · View at Google Scholar · View at Scopus
  16. L.-W. Liao and G.-J. Sheen, “Parallel machine scheduling with machine availability and eligibility constraints,” European Journal of Operational Research, vol. 184, no. 2, pp. 458–467, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. J. Hurink and S. Knust, “List scheduling in a parallel machine environment with precedence constraints and setup times,” Operations Research Letters, vol. 29, no. 5, pp. 231–239, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. B. Wang, H. Wang, and T. Li, “Gene exchange operators of partheno-genetic algorithm for permutation flowshop scheduling with maximum and minimum time lag constraints,” in Proceedings of the International Conference on Materials Engineering and Information Technology Applications (MEITA 2015), pp. 596–600, Guilin, China, August 2015. View at Publisher · View at Google Scholar
  19. M. J. Li and T. S. Tong, “A partheno-genetic algorithm and analysis of its global convergence,” Zidonghua Xuebao/Acta Automatica Sinica, vol. 25, no. 1, pp. 68–72, 1999. View at Google Scholar · View at MathSciNet
  20. J. Wang, W. Huang, G. Ma, and S. Chen, “An improved partheno genetic algorithm for multi-objective economic dispatch in cascaded hydropower systems,” International Journal of Electrical Power & Energy Systems, vol. 67, pp. 591–597, 2015. View at Publisher · View at Google Scholar · View at Scopus
  21. S. Reza Hejazi and S. Saghafian, “Flowshop-scheduling problems with makespan criterion: a review,” International Journal of Production Research, vol. 43, no. 14, pp. 2895–2929, 2005. View at Publisher · View at Google Scholar · View at Scopus
  22. P. Ramezani, M. Rabiee, and F. Jolai, “No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach,” Journal of Intelligent Manufacturing, vol. 26, no. 4, pp. 731–744, 2015. View at Publisher · View at Google Scholar · View at Scopus
  23. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002. View at Publisher · View at Google Scholar · View at Scopus
  24. A. Konak, D. W. Coit, and A. E. Smith, “Multi-objective optimization using genetic algorithms: a tutorial,” Reliability Engineering & System Safety, vol. 91, no. 9, pp. 992–1007, 2006. View at Publisher · View at Google Scholar · View at Scopus
  25. M. Pinedo, Scheduling: Theory, Algorithms and Systems, Prentice-Hall, New York, NY, USA, 1995. View at MathSciNet