Advanced search
Publication Cover
International Journal of Management Science and Engineering Management Volume 15, 2020 - Issue 2
Submit an article Journal homepage
129
Views
4
CrossRef citations to date
0
Altmetric
Articles

A branch and bound algorithm to solve a two-machine no-wait flowshop scheduling problem with truncated learning function

Vahid AziziDepartment of Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, IA, USA
&
Guiping HuDepartment of Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, IA, USACorrespondence[email protected]
Pages 89-95 | Received 04 Jan 2019, Accepted 23 May 2019, Published online: 08 Jul 2019

References

  • Adressi, A., Bashirzadeh, R., Azizi, V., & Tasouji Hassanpour, S. (2014). Solving group scheduling problem in no-wait flow shop with sequence dependent setup times. Journal of Modern Processes in Manufacturing and Production, 3(1), 5–16.
  • Adressi, A., Hassanpour, S., & Azizi, V. (2016). Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown. Decision Science Letters, 5(1), 157–168.
  • Azizi, V., Jabbari, M., & Kheirkhah, A. (2016). M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan. International Journal of Industrial Engineering Computations, 7(2), 309–322.
  • Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115(1), 173–178.
  • Cheng, T., Wu, -C.-C., Chen, J.-C., Wu, W.-H., & Cheng, S.-R. (2013). Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. International Journal of Production Economics, 141(1), 79–86.
  • Fattahi, P., Azizi, V., & Jabbari, M. (2015). Lot streaming in no-wait multi product flowshop considering sequence dependent setup times and position based learning factors. International Journal of Engineering TRANSACTIONS A: Basics, 28, 1031–1039.
  • Li, D.-C., Hsu, P.-H., Wu, -C.-C., & Cheng, T. E. (2011). Two-machine flowshop scheduling with truncated learning to minimize the total completion time. Computers & Industrial Engineering, 61(3), 655–662.
  • Li, X., Yang, Z., Ruiz, R., Chen, T., & Sui, S. (2018). An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects. Information Sciences, 453, 408–425.
  • Liu, Y., & Feng, Z. (2014). Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Computers & Industrial Engineering, 75, 170–175.
  • Pham, H., & Olafsson, S. (2019). Bagged ensembles with tunable parameters. Computational Intelligence, 35(1), 184–203.
  • Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics (NRL), 3(1–2), 59–66.
  • Tian, Y., Xu, M., Jiang, C., Wang, J.-B., & Wang, X.-Y. (2018). No-wait resource allocation flowshop scheduling with learning effect under limited cost availability. The Computer Journal, 62(1), 90–96.
  • Wang, J.-B., Wang, X.-Y., Sun, L.-H., & Sun, L.-Y. (2013). Scheduling jobs with truncated exponential learning functions. Optimization Letters, 7(8), 1857–1873.
  • Wang, X.-Y., Zhou, Z., Zhang, X., Ji, P., & Wang, J.-B. (2013). Several flow shop scheduling problems with truncated position-based learning effect. Computers & Operations Research, 40(12), 2906–2929.
  • Wu, -C.-C., Wu, W.-H., Wu, W.-H., Hsu, P.-H., Yin, Y., & Xu, J. (2014). A single-machine scheduling with a truncated linear deterioration and ready times. Information Sciences, 256, 109–125.
  • Wu, -C.-C., Yin, Y., & Cheng, S.-R. (2013). Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions. Journal of the Operational Research Society, 64(1), 147–156.
  • Yin, Y., Xu, D., Sun, K., & Li, H. (2009). Some scheduling problems with general position-dependent and time-dependent learning effects. Information Sciences, 179(14), 2416–2425.

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.