A branch-and-bound approach to schedule a no-wait flow shop to minimize the CVaR of the residual work content. (March 2019)

• Record Type: Journal Article
• Authors: Urgo, M.
• Is Part Of: Computers & industrial engineering. Volume 129(2019)
• Page Start: 67
• Page End: 75
• Publication Date: 2019-03
• Subjects: Stochastic scheduling -- Robust scheduling -- Conditional value at risk -- Aircraft manufacturing; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2019.01.002
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: A flow shop stochastic scheduling approach minimizing the CVaR of the residual work content. A robust schedule is devised to cope with the uncertain availability of workforce. Good performance in comparison with the scheduling approaches used in the company. Solution times are compatible with the dimension of aggregate scheduling problems. Abstract: The aerospace industry ranks among the largest manufacturing industries in the world facing a significant growing phase as well as an increased competition. This paper addresses the scheduling of a set of jobs in a paced assembly line in presence of uncertainty affecting the availability of production resources, stemming from the assembly process in the aircraft manufacturing industry. The production problem is modeled as a no-wait paced permutation flow shop and solved providing a robust scheduling solution minimizing the conditional value-at-risk ( CVaR ) of the residual work content, i.e., the amount of workload that cannot be completed during the cycle time in the stations, due to a lack of available resources. A branch-and-bound approach is developed and applied to randomly generated instances as well as to an industrial problem related to the production of aircrafts.