Abstract
In this paper, a scheduling problem for a two-stage production system including machining operations and assembly operations is studied. In this system, a number of products of different kinds are produced. Each product is assembled with a set of several parts. The first stage is a hybrid flow shop to produce parts. All machines can process all kinds of parts in this stage, but each machine can process only one part at a time. The second stage is a single assembly machine or a single assembly team of workers. The considered objective is to minimize the completion time of all products (makespan). A mathematical modeling is presented, and since this problem has been proved strongly nondeterministic polynomial-time hard, a series of heuristic algorithms based on the basic idea of Johnson algorithm is proposed. Also, two lower bounds is introduced and improved to evaluate the final solution obtained from heuristic algorithms. The numerical experiments are used to evaluate the performance of the proposed algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lee CY, Cheng TCE, Lin BMT (1993) Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Manag Sci 39:616–625
Allahverdi A, Al-Anzi FS (2009) The two-stage assembly scheduling problem to minimize total completion time with setup times. Comput Oper Res 36:2740–2747
Potts CN, Sevast'Janov SV, Strusevich VA, Van Wassenhove LN, Zwaneveld CM (1995) The two-stage assembly scheduling problem: complexity and approximation. Oper Res 43:346–355
Koulamas Ch, Kyparisis GJ (2001) The three-stage assembly flow shop scheduling problem. Comput Oper Res 28:689–704
Blazewicz J, Ecker K, Pesch E, Schmidt G, Weglarz J (2007) Handbook on scheduling from theory to application. Springer, USA
Quadt D, Kuhn H (2007) A taxonomy of flexible flow line scheduling procedures. Eur J Oper Res 178:686–698
Pinedo ML (2008) Scheduling theory, algorithms, and systems, 3rd edn. Springer, USA
Ruiz R, Vazquez-Rodriguez JA (2010) Invited review the hybrid flow shop scheduling problem. Eur J Oper Res 205:1–18
Hariri AMA, Potts CN (1997) A branch and bound algorithm for the two-stage assembly scheduling problem. Eur J Oper Res 103:547–556
Cheng TCE, Wang G (1999) Scheduling the fabrication and assembly of components in a two-machine flow shop. IIE Trans 31:135–143
Yokoyama M (2001) Hybrid flow-shop scheduling with assembly operations. Int J Prod Econ 73:103–116
Sun X, Morizawa K, Nagasawa H (2003) Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flow shop scheduling. Eur J Oper Res 146:498–516
Yokoyama M, Santos DL (2005) Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times. Eur J Oper Res 161:754–770
Al-Anzi FS, Allahverdi A (2009) Heuristics for a two-stage assembly flow shop with bicriteria of maximum lateness and makespan. Comput Oper Res 36:2682–2689
Oguz C, Ercan MF, Cheng TCE, Fung YF (2003) Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. Eur J Oper Res 149:390–403
Shaukat A, Brah LLL (1999) Heuristics for scheduling in a flow shop with multiple processors. Eur J Oper Res 113:113–122
Gupta JND, Kruger K, Lauff V, Werner F, Sotskov YN (2002) Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput Oper Res 29:1417–1439
Sung CS, Ah KH (2008) A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times. Int J Prod Econ 113:1038–1048
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fattahi, P., Hosseini, S.M.H. & Jolai, F. A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem. Int J Adv Manuf Technol 65, 787–802 (2013). https://doi.org/10.1007/s00170-012-4217-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-012-4217-x