Engineering

Vol.6 No.13(2014), Paper ID 52144, 9 pages

DOI:10.4236/eng.2014.613081

 

A Branch-and-Bound Based Heuristic Algorithm for Minimizing Makespan in Machining-Assembly Flowshop Scheduling

 

Kazuko Morizawa

 

Graduate School of Engineering, Osaka Prefecture University, Osaka, Japan

 

Copyright © 2014 Kazuko Morizawa 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.

 

How to Cite this Article

Morizawa, K. (2014) A Branch-and-Bound Based Heuristic Algorithm for Minimizing Makespan in Machining-Assembly Flowshop Scheduling. Engineering, 6, 877-885. doi: 10.4236/eng.2014.613081.
Journals Menu
Follow SCIRP
Contact us
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat

Copyright © 2025 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.