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

ISSN Print: 1947-3931
ISSN Online: 1947-394X
www.scirp.net/journal/eng
E-mail: [email protected]

Citations

"A Branch-and-Bound Based Heuristic Algorithm for Minimizing Makespan in Machining-Assembly Flowshop Scheduling"
written by Kazuko Morizawa,
published by Engineering, Vol.6 No.13, 2014

has been cited by the following article(s):

[1]	Assembly Flow Shop with Post-Processing: Mathematical Optimization Models
	SSRN Electronic Journal, 2022

[2]	Branch and Bound Method to Overcome Delay Delivery Order in Flow Shop Scheduling Problem
	2020

[3]	Contribution à l'étude des problèmes d'ordonnancement des systèmes de production de type flow-shop: Modélisation, optimisation et expérimentation
	2019

[4]	Multi-Stage assembly flow shop with setup time and release time
	2019

[5]	Ordonnancement d'un système de production industriel complexe: flow shop hybride avec des machines dédiées soumis à différentes contraintes temporelles
	2018

[6]	Flow shop scheduling problems with assembly operations: a review and new trends
	2018

[7]	Scheduling Problems of Flexible Manufacturing Systems: Review, Classification and Opportunities
	International Journal of Engineering Research in Africa, 2016

[1]	A novel and efficient mathematical optimization model for multi-stage assembly flow shop considering post-processing Journal of Industrial and Production Engineering, 2024 DOI:10.1080/21681015.2024.2370847

[2]	Branch and Bound Method to Overcome Delay Delivery Order in Flow Shop Scheduling Problem IOP Conference Series: Materials Science and Engineering, 2020 DOI:10.1088/1757-899X/1003/1/012129

[3]	Multi-Stage assembly flow shop with setup time and release time Operations Research Perspectives, 2019 DOI:10.1016/j.orp.2019.100111

[4]	Flow shop scheduling problems with assembly operations: a review and new trends International Journal of Production Research, 2018 DOI:10.1080/00207543.2018.1550269