Inverse Scheduling Method for Aircraft Flat-tail Assembly Production Based on Improved Genetic Algorithm

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated deep summary by claude@2026-06, 2026-06-24 · read from full text

This paper studies how to generate feasible, near-optimal production schedules for aircraft flat-tail assembly, where manual assembly at fixed stations with variable shift teams can produce non-optimal or infeasible schedules due to uncertainties after initial scheduling. It proposes an inverse scheduling strategy framed as a multi-objective optimization problem that minimizes maximum delay penalty cost and assembly time adjustment cost, solved using an improved genetic algorithm that integrates local search and a self-adaptive tolerance-driving mechanism to handle order delay exception events. The effectiveness of the proposed mechanism and inverse scheduling approach is evaluated through enterprise case studies, with the work presented as a preprint and explicitly described as not peer reviewed by a journal. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract The manufacturing process of the aircraft flat-tail assembly is complex and discrete. It typically involves manual assembly at fixed stations with variable shift teams. However, uncertainties can arise even after a scheduling scheme is created, leading to non-optimal or even infeasible schedules. To address this issue, a new scheduling strategy called ‘inverse scheduling’ has been proposed by incorporating the concept of inverse optimization. Notably, this is the first application of inverse scheduling in the complex manufacturing process of aircraft flat-tail assembly. This paper presents a multi-objective optimization model for the inverse scheduling problem of flat-tail assembly production. The scheduling objectives include minimizing the maximum delay penalty cost and minimizing the assembly time adjustment cost. To address the limitations of traditional mathematical planning methods in terms of efficiency and solution quality, an improved genetic algorithm is proposed. This algorithm combines the genetic algorithm with a local search strategy to solve the large-scale inverse scheduling problem. Additionally, an inverse scheduling strategy based on the self-adaptive tolerance-driving mechanism is designed to enhance the algorithm's efficiency and effectively handle order delay exception events. The effectiveness of the self-adaptive tolerance driving mechanism and the inverse scheduling method is verified through case studies in enterprises.
Full text 13,959 characters · extracted from preprint-html · click to expand
Inverse Scheduling Method for Aircraft Flat-tail Assembly Production Based on Improved Genetic Algorithm | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article Inverse Scheduling Method for Aircraft Flat-tail Assembly Production Based on Improved Genetic Algorithm Tengda Li, Min Hua, Junliang Wang, Wei Qin This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7336541/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 17 Nov, 2025 Read the published version in Scientific Reports → Version 1 posted 12 You are reading this latest preprint version Abstract The manufacturing process of the aircraft flat-tail assembly is complex and discrete. It typically involves manual assembly at fixed stations with variable shift teams. However, uncertainties can arise even after a scheduling scheme is created, leading to non-optimal or even infeasible schedules. To address this issue, a new scheduling strategy called ‘inverse scheduling’ has been proposed by incorporating the concept of inverse optimization. Notably, this is the first application of inverse scheduling in the complex manufacturing process of aircraft flat-tail assembly. This paper presents a multi-objective optimization model for the inverse scheduling problem of flat-tail assembly production. The scheduling objectives include minimizing the maximum delay penalty cost and minimizing the assembly time adjustment cost. To address the limitations of traditional mathematical planning methods in terms of efficiency and solution quality, an improved genetic algorithm is proposed. This algorithm combines the genetic algorithm with a local search strategy to solve the large-scale inverse scheduling problem. Additionally, an inverse scheduling strategy based on the self-adaptive tolerance-driving mechanism is designed to enhance the algorithm's efficiency and effectively handle order delay exception events. The effectiveness of the self-adaptive tolerance driving mechanism and the inverse scheduling method is verified through case studies in enterprises. Physical sciences/Engineering Physical sciences/Mathematics and computing Flat-tail assembly production Self-adaptive driving mechanism Inverse scheduling Improved genetic algorithm Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 17 Nov, 2025 Read the published version in Scientific Reports → Version 1 posted Editorial decision: Revision requested 11 Sep, 2025 Reviews received at journal 09 Sep, 2025 Reviews received at journal 07 Sep, 2025 Reviews received at journal 06 Sep, 2025 Reviewers agreed at journal 03 Sep, 2025 Reviewers agreed at journal 31 Aug, 2025 Reviewers agreed at journal 28 Aug, 2025 Reviewers invited by journal 28 Aug, 2025 Editor invited by journal 19 Aug, 2025 Editor assigned by journal 14 Aug, 2025 Submission checks completed at journal 13 Aug, 2025 First submitted to journal 09 Aug, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7336541","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":509968561,"identity":"2b3f6730-f31b-4b29-9a92-4af23e1e4f4f","order_by":0,"name":"Tengda Li","email":"","orcid":"","institution":"Shanghai Jiao Tong University, USC-SJTU Institute of Cultural and Creative Industry","correspondingAuthor":false,"prefix":"","firstName":"Tengda","middleName":"","lastName":"Li","suffix":""},{"id":509968564,"identity":"5b3eb3a1-41de-4610-9a10-f0ae3b624800","order_by":1,"name":"Min Hua","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAzElEQVRIiWNgGAWjYBACAxCRwGDDwNgAYrERryWNgbGNJC0MDIehqonRYi6R/HTDwx3n7Znn9xgwfCg7zMA/uwG/FssZaWY3Es/cTmxs4zFgnHHuMIPEnQMEHHYjAail7XYCI1ALM2/bYQYDiQRCWtK/AbWcswdr+UuclhyQLQcYQQ5jZiRKy5k3ZUAtyUC/pBUc7DmXziNxg5CW4+nbbv5ss7M3bD688cGPMms5/hkEtMCBYQMDwwEgzUOkeiCQJ17pKBgFo2AUjDQAACnRRd7h9J1dAAAAAElFTkSuQmCC","orcid":"","institution":"Shanghai Jiao Tong University, USC-SJTU Institute of Cultural and Creative Industry","correspondingAuthor":true,"prefix":"","firstName":"Min","middleName":"","lastName":"Hua","suffix":""},{"id":509968570,"identity":"9ab6655c-7040-4cdc-ac31-61ccd9ca1b12","order_by":2,"name":"Junliang Wang","email":"","orcid":"","institution":"Donghua University","correspondingAuthor":false,"prefix":"","firstName":"Junliang","middleName":"","lastName":"Wang","suffix":""},{"id":509968573,"identity":"248e36de-dccd-4c92-9d7b-435e4d32a082","order_by":3,"name":"Wei Qin","email":"","orcid":"","institution":"Shanghai Jiao Tong University","correspondingAuthor":false,"prefix":"","firstName":"Wei","middleName":"","lastName":"Qin","suffix":""}],"badges":[],"createdAt":"2025-08-10 03:23:12","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7336541/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7336541/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1038/s41598-025-23898-9","type":"published","date":"2025-11-17T15:57:48+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":96650120,"identity":"fc4c0155-08ba-4f8c-bfce-1d509959cad0","added_by":"auto","created_at":"2025-11-24 16:08:16","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":514550,"visible":true,"origin":"","legend":"","description":"","filename":"ScientificReportsInverseSchedulingMethodforAircraftFlattailAssemblyProductionBasedonImprovedGeneticAlgorithm.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7336541/v1_covered_61ae0ee5-8719-4d1a-a703-26942a8917f4.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Inverse Scheduling Method for Aircraft Flat-tail Assembly Production Based on Improved Genetic Algorithm","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"Flat-tail assembly production, Self-adaptive driving mechanism, Inverse scheduling, Improved genetic algorithm","lastPublishedDoi":"10.21203/rs.3.rs-7336541/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7336541/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThe manufacturing process of the aircraft flat-tail assembly is complex and discrete. It typically involves manual assembly at fixed stations with variable shift teams. However, uncertainties can arise even after a scheduling scheme is created, leading to non-optimal or even infeasible schedules. To address this issue, a new scheduling strategy called \u0026lsquo;inverse scheduling\u0026rsquo; has been proposed by incorporating the concept of inverse optimization. Notably, this is the first application of inverse scheduling in the complex manufacturing process of aircraft flat-tail assembly. This paper presents a multi-objective optimization model for the inverse scheduling problem of flat-tail assembly production. The scheduling objectives include minimizing the maximum delay penalty cost and minimizing the assembly time adjustment cost. To address the limitations of traditional mathematical planning methods in terms of efficiency and solution quality, an improved genetic algorithm is proposed. This algorithm combines the genetic algorithm with a local search strategy to solve the large-scale inverse scheduling problem. Additionally, an inverse scheduling strategy based on the self-adaptive tolerance-driving mechanism is designed to enhance the algorithm's efficiency and effectively handle order delay exception events. The effectiveness of the self-adaptive tolerance driving mechanism and the inverse scheduling method is verified through case studies in enterprises.\u003c/p\u003e","manuscriptTitle":"Inverse Scheduling Method for Aircraft Flat-tail Assembly Production Based on Improved Genetic Algorithm","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-09-05 20:23:52","doi":"10.21203/rs.3.rs-7336541/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-09-11T08:23:47+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-09T05:27:52+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-08T00:11:05+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-06T15:00:27+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"121156826736588872653417836439746904809","date":"2025-09-04T02:44:32+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"92483600862938089251442289357136444245","date":"2025-08-31T06:12:31+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"113239883247972015042921674536239420290","date":"2025-08-29T03:03:22+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-08-29T02:27:09+00:00","index":"","fulltext":""},{"type":"editorInvited","content":"","date":"2025-08-19T07:11:50+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-08-14T08:02:44+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-08-13T13:28:14+00:00","index":"","fulltext":""},{"type":"submitted","content":"Scientific Reports","date":"2025-08-10T03:18:02+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"ef9debb5-5632-4bb4-a947-2bca0b0ba232","owner":[],"postedDate":"September 5th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[{"id":54164415,"name":"Physical sciences/Engineering"},{"id":54164416,"name":"Physical sciences/Mathematics and computing"}],"tags":[],"updatedAt":"2025-11-24T16:01:36+00:00","versionOfRecord":{"articleIdentity":"rs-7336541","link":"https://doi.org/10.1038/s41598-025-23898-9","journal":{"identity":"scientific-reports","isVorOnly":false,"title":"Scientific Reports"},"publishedOn":"2025-11-17 15:57:48","publishedOnDateReadable":"November 17th, 2025"},"versionCreatedAt":"2025-09-05 20:23:52","video":"","vorDoi":"10.1038/s41598-025-23898-9","vorDoiUrl":"https://doi.org/10.1038/s41598-025-23898-9","workflowStages":[]},"version":"v1","identity":"rs-7336541","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7336541","identity":"rs-7336541","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0