A branch-and-bound approach to schedule a no-wait flow shop to minimize the CVaR of the residual work content
| Autor: | Marcello Urgo |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
021103 operations research
General Computer Science Operations research Branch and bound Aircraft manufacturing Conditional value at risk Robust scheduling Stochastic scheduling Conditional value at risk business.industry Computer science CVAR Aircraft manufacturing 0211 other engineering and technologies General Engineering Work content Scheduling (production processes) Workload Stochastic scheduling 02 engineering and technology Flow shop scheduling Robust scheduling Residual Scheduling (computing) Manufacturing 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing business |
| Zdroj: | Computers & Industrial Engineering. 129:67-75 |
| ISSN: | 0360-8352 |
| DOI: | 10.1016/j.cie.2019.01.002 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect