Q-learning Based Tree Structure Encoding Discrete Symbiotic Organisms Search Algorithm to Solve Shop Scheduling Problem

Q-learning Based Tree Structure Encoding Discrete Symbiotic Organisms Search Algorithm to Solve Shop Scheduling Problem | 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 Q-learning Based Tree Structure Encoding Discrete Symbiotic Organisms Search Algorithm to Solve Shop Scheduling Problem Jun Li, Xichen Liu, Qiwen Zhang This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4936053/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Based on the practical scheduling situation, this paper considers the effect of learning effect on scheduling and the learning threshold of jobs, and designs a learning effect no-wait scheduling model based on position truncation. A Q-learning based tree structure encoded discrete symbiotic organism search (QDTSEDSOS) algorithm is proposed for the scheduling problem, which first transforms feasible solutions into a tree structure more suitable for representing complex problems to improve search efficiency and expand solution space. Secondly, in the mutualism phase, the "advantageous block" of jobs is preserved to improve global optimization ability. In addition, the population is divided into superior and inferior subpopulations based on the distribution characteristics of particles. The superior subpopulation proposes three neighborhood search strategies to deal with the "large valley" phenomenon and uses Q-learning to utilize the results and information of historical search in order to guide the current search process. The solution space is searched more efficiently by selecting operators based on prior experience, while the inferior subgroup performs a parasitic strategy based on backward connectivity to purposely explore promising individuals. Experimental results on the Taillard benchmark set show that QDTSEDSOS is feasible and effective in solving the learning effect-based no-wait flow shop scheduling problem. Physical sciences/Mathematics and computing/Computational science Physical sciences/Mathematics and computing/Computer science Physical sciences/Mathematics and computing/Information technology Learning Effect No-Wait Flow Shop Scheduling Problem Symbiotic Organisms Search algorithm Tree Structure Reinforcement learning Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted 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-4936053","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":357230537,"identity":"741242e4-25d3-411f-b09b-4038f7fc6c8e","order_by":0,"name":"Jun Li","email":"","orcid":"","institution":"Lanzhou Modern Vocational College","correspondingAuthor":false,"prefix":"","firstName":"Jun","middleName":"","lastName":"Li","suffix":""},{"id":357230540,"identity":"6e7c8200-785d-4a49-b327-226b7c4ce6c4","order_by":1,"name":"Xichen Liu","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAy0lEQVRIiWNgGAWjYBACNmbmww8SDNiY7ZuZDxCnhY+9Lc3gQwEfuwE7WwJxWuR4zhhIzvggx2/Az2NApMMkcgyMeQzMpM2ZeT7eeMNgJ6fbQFBLWsFjHoM0Y8tm3s2WcxiSjc0OENSSvAFoy7FkhsO826R5GA4kbiOsJcFAmsfgf33DYZ5nRGrhOQL0PjCQDQ7zsBGpBRzIQC2SzWzGlnMMiPCLfDMoKv+wMfPzH354402FnRxBLShAgtioQdZCqo5RMApGwSgYEQAAtMo56mC/mocAAAAASUVORK5CYII=","orcid":"","institution":"Lanzhou University of Technology","correspondingAuthor":true,"prefix":"","firstName":"Xichen","middleName":"","lastName":"Liu","suffix":""},{"id":357230541,"identity":"a519cef1-01ce-4ee6-a677-76d9cadc677f","order_by":2,"name":"Qiwen Zhang","email":"","orcid":"","institution":"Lanzhou University of Technology","correspondingAuthor":false,"prefix":"","firstName":"Qiwen","middleName":"","lastName":"Zhang","suffix":""}],"badges":[],"createdAt":"2024-08-19 05:39:42","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4936053/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4936053/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":88209890,"identity":"2ad7780b-0d2e-4710-a5d2-0ab2078b0190","added_by":"auto","created_at":"2025-08-04 04:38:49","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":2838309,"visible":true,"origin":"","legend":"","description":"","filename":"QlearningBasedTreeStructureEncodingDiscreteSymbiotic.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4936053/v1_covered_f9dfe032-898e-4ebf-beb0-bca9f89d92cd.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Q-learning Based Tree Structure Encoding Discrete Symbiotic Organisms Search Algorithm to Solve Shop Scheduling Problem","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Learning Effect, No-Wait Flow Shop Scheduling Problem, Symbiotic Organisms Search algorithm, Tree Structure, Reinforcement learning","lastPublishedDoi":"10.21203/rs.3.rs-4936053/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4936053/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Based on the practical scheduling situation, this paper considers the effect of learning effect on scheduling and the learning threshold of jobs, and designs a learning effect no-wait scheduling model based on position truncation. A Q-learning based tree structure encoded discrete symbiotic organism search (QDTSEDSOS) algorithm is proposed for the scheduling problem, which first transforms feasible solutions into a tree structure more suitable for representing complex problems to improve search efficiency and expand solution space. Secondly, in the mutualism phase, the \"advantageous block\" of jobs is preserved to improve global optimization ability. In addition, the population is divided into superior and inferior subpopulations based on the distribution characteristics of particles. The superior subpopulation proposes three neighborhood search strategies to deal with the \"large valley\" phenomenon and uses Q-learning to utilize the results and information of historical search in order to guide the current search process. The solution space is searched more efficiently by selecting operators based on prior experience, while the inferior subgroup performs a parasitic strategy based on backward connectivity to purposely explore promising individuals. Experimental results on the Taillard benchmark set show that QDTSEDSOS is feasible and effective in solving the learning effect-based no-wait flow shop scheduling problem.","manuscriptTitle":"Q-learning Based Tree Structure Encoding Discrete Symbiotic Organisms Search Algorithm to Solve Shop Scheduling Problem","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-10-04 06:09:10","doi":"10.21203/rs.3.rs-4936053/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"8cfc5006-9dec-4291-8102-616a313e52cb","owner":[],"postedDate":"October 4th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":38002529,"name":"Physical sciences/Mathematics and computing/Computational science"},{"id":38002530,"name":"Physical sciences/Mathematics and computing/Computer science"},{"id":38002531,"name":"Physical sciences/Mathematics and computing/Information technology"}],"tags":[],"updatedAt":"2025-08-04T04:38:15+00:00","versionOfRecord":[],"versionCreatedAt":"2024-10-04 06:09:10","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4936053","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4936053","identity":"rs-4936053","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}