Online citations, reference lists, and bibliographies.

Scheduling In Aerospace Composite Manufacturing Systems: A Two-stage Hybrid Flow Shop Problem

A. Azami, K. Demirli, N. Bhuiyan
Published 2018 · Engineering

Cite This
Download PDF
Analyze on Scholarcy
Share
This research investigates a real-world complex two-stage hybrid flow shop scheduling problem which is faced during the manufacturing of composite aerospace components. There are a number of new constraints to be taken into account in this special hybrid flow shop, in particular limited physical capacity of the intermediate buffer, limited waiting time between processing stages, and limited tools/molds used in both stages in each production cycle. We propose a discrete-time mixed integer linear programming model with an underlying branch and bound algorithm, to solve small- and medium-size problems (up to 100 jobs). To solve the large instances of the problem (up to 300 jobs), a genetic algorithm with a novel crossover operator is developed. A new heuristic method is introduced to generate the initial population of the genetic algorithm. The results show the high level of computational efficiency and accuracy of the proposed genetic algorithm when compared to the optimal solutions obtained from the mathematical model. The results also show that the proposed genetic algorithm outperforms the conventional dispatching rules (i.e., shortest processing time, earliest dues date and longest processing time) when applied to large-size problems. A real case study undertaken at one of the leading aerospace companies in Canada is used to formulate the model, collect data for the parameters of the model, and analyze the results.
This paper references
10.1007/s10951-017-0530-4
A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
Yi Tan (2018)
10.1080/00207543.2016.1162341
Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times
X. Feng (2016)
10.1016/S0895-7177(02)00176-0
An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers
T. Sawik (2002)
10.1007/BF01585876
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
H. Hoogeveen (1998)
10.1007/S00170-006-0818-6
A genetic-algorithm-based optimization model for scheduling flexible assembly lines
Z. Guo (2008)
10.1007/978-1-4615-7139-1
Handbook of Composites
G. Lubin (1982)
10.1016/J.IJPE.2016.06.005
Hybrid flow shop batching and scheduling with a bi-criteria objective
Omid Shahvari (2016)
10.1080/00207540310001636994
Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
H. Balasubramanian (2004)
10.1007/s10845-009-0250-5
A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems
M. Zandieh (2010)
10.1109/WSC.2009.5429171
Heuristic based scheduling system for diffusion in semiconductor manufacturing
T. Yurtsever (2009)
10.1007/S00170-013-4956-3
Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times
S. F. Attar (2013)
10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R
Scheduling a batching machine
Peter Brucker (1997)
10.1007/S00170-005-2585-1
A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor
M. Mathirajan (2006)
10.1007/S00170-008-1618-Y
A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection
F. Jolai (2008)
10.1016/j.cie.2016.11.031
Two new approaches for a two-stage hybrid flowshop problem with a single batch processing machine under waiting time constraint
Tsui-Ping Chung (2017)
10.1016/j.eswa.2006.12.002
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
Der-Fang Shiau (2008)
10.1080/00207549008942855
Flowshop sequencing problems with limited buffer storage
R. Leisten (1990)
10.1080/00207541003610262
Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows
Huijune Luo (2011)
10.1057/palgrave.jors.2602033
Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers
L. Tang (2006)
10.1016/j.cor.2009.11.001
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
I. Ribas (2010)
10.7551/mitpress/1090.001.0001
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence
J. Holland (1992)
10.1016/S0377-2217(03)00264-9
Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times
M. Pranzo (2004)
10.1016/j.cie.2008.09.004
Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers
Victor Yaurima (2009)
10.1016/J.APM.2013.10.061
Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
M. Ebrahimi (2014)
10.1111/j.1467-8691.2008.00497.x
Aerospace Supply Chains as Evolutionary Networks of Activities: Innovation Via Risk-Sharing Partnerships
C. Rose-Anderssen (2008)
10.1016/J.IJPE.2008.10.009
Hybrid flow shop scheduling with parallel batching
M. R. Amin-Naseri (2009)
10.1016/S0377-2217(03)00434-X
A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation
S. Bertel (2004)
10.1016/j.ejor.2009.09.024
The hybrid flow shop scheduling problem
R. Ruiz (2010)
10.1016/j.cor.2011.02.017
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
Céline Gicquel (2012)
10.1016/j.cor.2007.11.004
A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
Xianpeng Wang (2009)
10.1016/J.APM.2013.06.005
A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
P. Fattahi (2014)
10.1080/00207543.2014.949363
A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling
S. Wang (2015)
10.1007/s10845-015-1144-3
An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time
W. Qin (2018)
10.1016/0166-218X(95)00114-7
Batch Scheduling in a Two-machine Flow Shop with Limited Buffer
A. Agnetis (1997)
10.1016/j.mcm.2008.09.012
Minimizing makespan in a two-machine flowshop scheduling with batching and release time
Lixin Tang (2009)
10.1016/j.ijar.2007.08.013
Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines
Alebachew D. Yimer (2009)
10.1016/j.ejor.2012.03.001
Solving the serial batching problem in job shop manufacturing systems
Liji Shen (2012)
10.1080/00207543.2013.835496
Dynamic set-up rules for hybrid flow shop scheduling with parallel batching machines
Andrea Rossi (2014)
10.1007/11730095_18
Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines
D. Reichelt (2006)
10.1109/IEEM.2016.7797914
Two-stage hybrid flowshop scheduling problem with waiting time
Heng Sun (2016)
10.1287/opre.40.4.750
Batching and Scheduling Jobs on Batch and Discrete Processors
J. Ahmadi (1992)
10.1007/s10951-005-1640-y
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks
C. Oguz (2005)
10.1016/S0377-2217(99)00153-8
Scheduling with batching: A review
C. Potts (2000)



This paper is referenced by
Semantic Scholar Logo Some data provided by SemanticScholar