Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2016, Article ID 5127253, 13 pages
http://dx.doi.org/10.1155/2016/5127253
Research Article

Robust Parallel Machine Scheduling Problem with Uncertainties and Sequence-Dependent Setup Time

1Logistics Engineering College, Shanghai Maritime University, Shanghai, China
2Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Hong Kong

Received 6 September 2016; Accepted 11 October 2016

Academic Editor: Si Zhang

Copyright © 2016 Hongtao Hu et al. 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.-F. Chien and C.-H. Chen, “Using genetic algorithms (GA) and a coloured timed Petri net (CTPN) for modelling the optimization-based schedule generator of a generic production scheduling system,” International Journal of Production Research, vol. 45, no. 8, pp. 1763–1789, 2007. View at Publisher · View at Google Scholar · View at Scopus
  2. W. Kaczmarczyk, “Proportional lot-sizing and scheduling problem with identical parallel machines,” International Journal of Production Research, vol. 49, no. 9, pp. 2605–2623, 2011. View at Publisher · View at Google Scholar
  3. H. Gong and L. Tang, “Two-machine flowshop scheduling with intermediate transportation under job physical space consideration,” Computers and Operations Research, vol. 38, no. 9, pp. 1267–1274, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. X. Xie, L. X. Tang, and Y. P. Li, “Scheduling of a hub reentrant job shop to minimize makespan,” International Journal of Advanced Manufacturing Technology, vol. 56, no. 5–8, pp. 743–753, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. X. Q. Xu, W. T. Cui, J. Lin, and Y. J. Qian, “Robust makespan minimisation in identical parallel machine scheduling problem with interval data,” International Journal of Production Research, vol. 51, no. 12, pp. 3532–3548, 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. R. L. Daniels and P. Kouvelis, “Robust scheduling to hedge against processing time uncertainty in single-stage production,” Management Science, vol. 41, no. 2, pp. 363–376, 1995. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Yang and G. Yu, “On the robust single machine scheduling problem,” Journal of Combinatorial Optimization, vol. 6, no. 1, pp. 17–33, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. R. Montemanni, “A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data,” Journal of Mathematical Modelling and Algorithms, vol. 6, no. 2, pp. 287–296, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. A. Allahverdi and H. Aydilek, “Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times,” International Journal of Production Research, vol. 48, no. 21, pp. 6367–6385, 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. Q. Meng and X. Qu, “Bus dwell time estimation at bus bays: a probabilistic approach,” Transportation Research Part C: Emerging Technologies, vol. 36, pp. 61–71, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Anglani, A. Grieco, E. Guerriero, and R. Musmanno, “Robust scheduling of parallel machines with sequence-dependent set-up costs,” European Journal of Operational Research, vol. 161, no. 3, pp. 704–720, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. X. Q. Xu, J. Lin, and W. T. Cui, “Hedge against total flow time uncertainty of the uniform parallel machine scheduling problem with interval data,” International Journal of Production Research, vol. 52, no. 19, pp. 5611–5625, 2014. View at Publisher · View at Google Scholar · View at Scopus
  13. H. Aissi, C. Bazgan, and D. Vanderpooten, “Min-max and min-max regret versions of combinatorial optimization problems: a survey,” European Journal of Operational Research, vol. 197, no. 2, pp. 427–438, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. A. Kasperski and P. Zieliński, “An approximation algorithm for interval data minmax regret combinatorial optimization problems,” Information Processing Letters, vol. 97, no. 5, pp. 177–180, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. A. Kasperski and P. Zielinski, “A2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion,” Operations Research Letters, vol. 36, no. 3, pp. 343–344, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. R. Montemanni and L. M. Gambardella, “An exact algorithm for the robust shortest path problem with interval data,” Computers & Operations Research, vol. 31, no. 10, pp. 1667–1680, 2004. View at Publisher · View at Google Scholar · View at Scopus
  17. R. Montemanni and L. M. Gambardella, “The robust shortest path problem with interval data via Benders decomposition,” 4OR, vol. 3, no. 4, pp. 315–328, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. H. Aissi, C. Bazgan, and D. Vanderpooten, “Complexity of the min–max and min–max regret assignment problems,” Operations Research Letters, vol. 33, no. 6, pp. 634–640, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. R. Montemanni, “A Benders decomposition approach for the robust spanning tree problem with interval data,” European Journal of Operational Research, vol. 174, no. 3, pp. 1479–1490, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. C.-C. Lu, S.-W. Lin, and K.-C. Ying, “Robust scheduling on a single machine to minimize total flow time,” Computers and Operations Research, vol. 39, no. 7, pp. 1682–1691, 2012. View at Publisher · View at Google Scholar · View at Scopus
  21. S. Wang and Q. Meng, “Robust schedule design for liner shipping services,” Transportation Research Part E: Logistics and Transportation Review, vol. 48, no. 6, pp. 1093–1106, 2012. View at Publisher · View at Google Scholar · View at Scopus
  22. X. Wang, “Stochastic resource allocation for containerized cargo transportation networks when capacities are uncertain,” Transportation Research Part E: Logistics and Transportation Review, vol. 93, pp. 334–357, 2016. View at Publisher · View at Google Scholar
  23. Y. Yan, Q. Meng, S. Wang, and X. Guo, “Robust optimization model of schedule design for a fixed bus route,” Transportation Research Part C: Emerging Technologies, vol. 25, pp. 113–121, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. F. Meng, J. Qi, M. Zhang, J. Ang, S. Chu, and M. Sim, “A robust optimization model for managing elective admission in a public hospital,” Operations Research, vol. 63, no. 6, pp. 1452–1467, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. 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
  26. S. Wang and M. Liu, “Multi-objective optimization of parallel machine scheduling integrated with multi-resources preventive maintenance planning,” Journal of Manufacturing Systems, vol. 37, pp. 182–192, 2015. View at Publisher · View at Google Scholar · View at Scopus
  27. P. Liu, X. Y. Zhou, and L. X. Tang, “Two-agent single-machine scheduling with position-dependent processing times,” International Journal of Advanced Manufacturing Technology, vol. 48, no. 1–4, pp. 325–331, 2010. View at Publisher · View at Google Scholar · View at Scopus
  28. X. P. Wang and L. X. Tang, “A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times,” Computers and Operations Research, vol. 37, no. 9, pp. 1624–1640, 2010. View at Publisher · View at Google Scholar · View at Scopus
  29. S. Ghosh Dastidar and R. Nagi, “Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs,” Computers & Operations Research, vol. 32, no. 11, pp. 2987–3005, 2005. View at Publisher · View at Google Scholar · View at Scopus
  30. S. Wang, “Bi-objective optimisation for integrated scheduling of single machine with setup times and preventive maintenance planning,” International Journal of Production Research, vol. 51, no. 12, pp. 3719–3733, 2013. View at Publisher · View at Google Scholar · View at Scopus
  31. Y. Suppiah and M. K. Omar, “A hybrid tabu search for batching and sequencing decisions in a single machine environment,” Computers & Industrial Engineering, vol. 78, pp. 135–147, 2014. View at Publisher · View at Google Scholar · View at Scopus
  32. Ü. Bilge, F. Kiraç, M. Kurtulan, and P. Pekgün, “A tabu search algorithm for parallel machine total tardiness problem,” Computers and Operations Research, vol. 31, no. 3, pp. 397–414, 2004. View at Publisher · View at Google Scholar · View at Scopus
  33. M. Inuiguchi and M. Sakawa, “Minimax regret solution to linear programming problems with an interval objective function,” European Journal of Operational Research, vol. 86, no. 3, pp. 526–536, 1995. View at Publisher · View at Google Scholar · View at Scopus
  34. H. E. Mausser and M. Laguna, “A new mixed integer formulation for the maximum regret problem,” International Transactions in Operational Research, vol. 5, no. 5, pp. 389–403, 1998. View at Publisher · View at Google Scholar
  35. H. E. Mausser and M. Laguna, “Heuristic to minimax absolute regret for linear programs with interval objective function coefficients,” European Journal of Operational Research, vol. 117, no. 1, pp. 157–174, 1999. View at Publisher · View at Google Scholar · View at Scopus
  36. F. J. Rodriguez, C. García-Martínez, C. Blum, and M. Lozano, “An artificial bee colony algorithm for the unrelated parallel machines scheduling problem,” in Parallel Problem Solving from Nature—PPSN XII: 12th International Conference, Taormina, Italy, September 1–5, 2012, Proceedings, Part II, vol. 7492 of Lecture Notes in Computer Science, pp. 143–152, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  37. 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
  38. M. Yazdani, S. Gohari, and B. Naderi, “Multi-factory parallel machine problems: improved mathematical models and artificial bee colony algorithm,” Computers & Industrial Engineering, vol. 81, pp. 36–45, 2015. View at Publisher · View at Google Scholar · View at Scopus
  39. D. E. Goldberg, The Design of Innovation: Lessons from and for Competent Genetic Algorithms, vol. 7, Springer, 2013.