217
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

Two-machine hybrid flowshop scheduling with identical jobs: Solution algorithms and analysis of hybrid benefits

, , &
Pages 817-826 | Received 12 Oct 2017, Accepted 23 Mar 2018, Published online: 18 Apr 2018

References

  • Ahonen, H., & Alvarenga, A. G. D. (2017). Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: formulation and solution procedures. International Journal of Advanced Manufacturing Technology, 89(1–4), 765–777.
  • Batur, G. D., Erol, S., & Karasan, O. E. (2016). Robot move sequence determining and multiple part-type scheduling in hybrid flexible flow shop robotic cells. Computers & Industrial Engineering, 100, 72–87.
  • Crama, Y., & Gultekin, H. (2010). Throughput Optimization in 2-Machine Flowshops with Flexible Operations. Journal of Scheduling, 13(3), 227–243.
  • Feng, X., Zheng, F., & Xu, Y. (2016). Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times. International Journal of Production Research, 54(12), 1–12.
  • Gultekin, H. (2012). Scheduling in flowshops with flexible operations: throughput optimization and benefits of flexibility. International Journal of Production Economics, 140(2), 900–911.
  • Gupta, J. N. D., Koulamas, C. P., Kyparisis, G. J., Potts, C. N., & Strusevich, V. A. (2004). Scheduling three-operation jobs in a two-machine flow shop to minimize makespan. Annals of Operations Research, 129, 171–185.
  • Hwang, F. J., & Lin, B. M. T. (2016). Two-stage flexible flow shop scheduling subject to fixed job sequences. Journal of the Operational Research Society, 67(3), 506–515.
  • Johnson, S. M. (1954). Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61–68.
  • Komaki, G. M., Teymourian, E., & Kayvanfar, V. (2016). Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems. International Journal of Production Research, 54(4), 1–22.
  • Nowicki, E. (1999). The permutation flow shop with buffers: A tabu search approach. European Journal of Operational Research, 116(1), 205–219.
  • Panagiotis, K., & George, V. (1998). Flowshops with processing flexibility across production stages. IIE Transactions, 30, 735–746.
  • Sawik, T. J. (1993). A scheduling algorithm for flexible flow lines with limited intermediate buffers. Applied Stochastic Models and Data Analysis, 9(2), 127–138.
  • Tan, Y., Monch, L. & Fowler, J. W. (2017). A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines. Journal of Scheduling, 21(2), 209–226.
  • Tang, L. X., & Xuan, H. (2006). Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling withfinite intermediate buffers. Journal of the Operational Research Society, 57(3), 316-324.
  • Vairaktarakis, G., & Lee, C. Y. (2004). Analysis of algorithms for two-stage flowshops with multi-processor task flexibility. Naval Research Logistics, 51, 44–59.
  • Wei, Q. & He, Y. (2005). A two-stage semi-hybrid flowshop problem in graphics processing. Applied Mathematics A Journal of Chinese Universities, 20, 393–400.
  • Wei, Q., & Jiang, Y. W. (2012). Approximation algorithms for a two-stage hybrid flow shop. Journal of Software, 23(5), 1073–1084.
  • Wei, Q., Shan, E. F., & Kang, L. Y. (2014). A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs. Theoretical Computer Science, 524, 78–89.
  • Zabihzadeh, S. S., & Rezaeian, J. (2016). Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time. Applied Soft Computing, 40, 319–330.
  • Zhong, W. Y., & Shi, Y. (2017). Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility. Journal of Combinatorial Optimization, 2017(2), 1–18.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.