Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Complexityarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Complexity
Article . 2018 . Peer-reviewed
License: CC BY
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Complexity
Article
License: CC BY
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Complexity
Article . 2018
Data sources: DOAJ
DBLP
Article
Data sources: DBLP
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
versions View all 4 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

A Proactive Robust Scheduling Method for Aircraft Carrier Flight Deck Operations with Stochastic Durations

Authors: Xichao Su; Wei Han; Yu Wu 0009; Yong Zhang; Jie Liu 0011;

A Proactive Robust Scheduling Method for Aircraft Carrier Flight Deck Operations with Stochastic Durations

Abstract

The operations on the aircraft carrier flight deck are carried out in a time‐critical and resource‐constrained environment with uncertainty, and it is of great significance to optimize the makespan and obtain a robust schedule and resource allocation plan for a greater sortie generation capacity and better operational management of an aircraft carrier. In this paper, a proactive robust optimization method for flight deck scheduling with stochastic operation durations is proposed. Firstly, an operation on node‐flow (OONF) network is adopted to model the precedence relationships of multi‐aircraft operations, and resource constraints categorized into personnel, support equipment, workstation space, and supply resource are taken into consideration. On this basis, a mathematical model of the robust scheduling problem for flight deck operation (RSPFDO) is established, and the goal is to maximize the probability of completing within the limitative makespan (PCLM) and minimize the weighted sum of expected makespan and variance of makespan (IRM). Then, in terms of proactive planning, both serial and parallel schedule generation schemes for baseline schedule and robust personnel allocation scheme and equipment allocation adjustment scheme for resource allocation are designed. In terms of executing schedules, an RSPFDO‐oriented preconstraint scheduling policy (CPC) is proposed. To optimize the baseline schedule and resource allocation, a hybrid teaching‐learning‐based optimization (HTLBO) algorithm is designed which integrates differential evolution operators, peak crossover operator, and learning‐automata‐based adaptive variable neighborhood search strategy. Simulation results shows that the HTLBO algorithm outperforms both some other state‐of‐the‐art algorithms for deterministic cases and some existing algorithms for stochastic project scheduling, and the robustness of the flight deck operations can be improved with the proposed resource allocation schemes and CPC policy.

Related Organizations
Keywords

Electronic computers. Computer science, QA75.5-76.95

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    16
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
16
Top 10%
Top 10%
Average
gold