Integrated scheduling algorithm with Dynamic Adjustment on Machine Idle Time

Integrated scheduling algorithm with Dynamic Adjustment on Machine Idle Time | 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 Integrated scheduling algorithm with Dynamic Adjustment on Machine Idle Time Wei Zhou, Xueying Ding, Zhiqiang Xie, Ming Sun, Zhenjiang Tan This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4302637/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 During the scheduling of the production of small batch and multi-variety products with treelike structure, many devices are idle due to the process constraints. This increases the makespan of production and reduces the utilization rate of the equipment. Aiming at improving this situation, a resource cooperative scheduling algorithm is proposed to dynamically adjust the idle time of equipment: the integrated scheduling algorithm with dynamic adjustment on machine idle time(ISA_DA). This algorithm adopts the critical path chain and the optimal scheduling strategy. Besides, the adjustment strategy considering the backward movement of the process is put forward to improve the intensity of the close connection of the process and the intensity of parallel processing. Experimental results show that the effect of the proposed algorithm is better than the comparison algorithms: the hierarchical scheduling order algorithm and the process tree cyclic decomposition algorithm. It can increase the equipment utilization rate by 10% and 11.5% respectively, and reduce the makespan by 28.6%. Physical sciences/Mathematics and computing/Computational science Physical sciences/Mathematics and computing/Computer science Optimization path value integrated scheduling 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-4302637","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":296815492,"identity":"a2de2bd4-56eb-42ab-a501-8c21515888ca","order_by":0,"name":"Wei Zhou","email":"","orcid":"","institution":"Jilin Normal University","correspondingAuthor":false,"prefix":"","firstName":"Wei","middleName":"","lastName":"Zhou","suffix":""},{"id":296815493,"identity":"06604301-463a-4c43-bda5-cd0703afdee9","order_by":1,"name":"Xueying Ding","email":"","orcid":"","institution":"Jilin Normal University","correspondingAuthor":false,"prefix":"","firstName":"Xueying","middleName":"","lastName":"Ding","suffix":""},{"id":296815494,"identity":"94b1f2f9-ef8c-478f-9554-74f8e5950935","order_by":2,"name":"Zhiqiang Xie","email":"","orcid":"","institution":"Harbin University of Science and Technology","correspondingAuthor":false,"prefix":"","firstName":"Zhiqiang","middleName":"","lastName":"Xie","suffix":""},{"id":296815495,"identity":"21564ec4-c14a-4b2d-b5fa-6339b958278f","order_by":3,"name":"Ming Sun","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA9UlEQVRIiWNgGAWjYBACxnYogw3IfiBRAGYb4NfSjNDCbCBhQIQWBmYEk02CgRgtzM3szx7+bLsTzSfdfq3CwuBOYgN78zYJhpo7eBzGY27M2/Yst03mTNkNCYNniQ08x8okGI49w6eFTZqx7XBum0ROGlDL4cQGiRwzCcaGw3i0sD+T/AnVUgDWIv+GkBYGMwlesJb0YwwQW3gIaQH6hecc2BZmCaAW4zaetGKLhGO4tRi2tz97+KPscO78GekPP0tUHJbtZz+88caHGjxaGkCRCAY8BswSDAwQbgJODQwM8gxwLewPGD/gUTkKRsEoGAUjFwAA+jdRw3QrKX8AAAAASUVORK5CYII=","orcid":"","institution":"Jilin Normal University","correspondingAuthor":true,"prefix":"","firstName":"Ming","middleName":"","lastName":"Sun","suffix":""},{"id":296815496,"identity":"714d26da-c701-4ab3-a53e-cf7b644677aa","order_by":4,"name":"Zhenjiang Tan","email":"","orcid":"","institution":"Jilin Normal University","correspondingAuthor":false,"prefix":"","firstName":"Zhenjiang","middleName":"","lastName":"Tan","suffix":""}],"badges":[],"createdAt":"2024-04-22 02:40:38","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4302637/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4302637/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":71848304,"identity":"73f3c395-c4ca-44b6-a0a1-c8e07f3b9f2e","added_by":"auto","created_at":"2024-12-19 06:54:28","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":425972,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4302637/v1_covered_39901e3d-f154-4893-88bb-8c9f342dca65.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Integrated scheduling algorithm with Dynamic Adjustment on Machine Idle Time","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":"Optimization, path value, integrated scheduling","lastPublishedDoi":"10.21203/rs.3.rs-4302637/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4302637/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eDuring the scheduling of the production of small batch and multi-variety products with treelike structure, many devices are idle due to the process constraints. This increases the makespan of production and reduces the utilization rate of the equipment. Aiming at improving this situation, a resource cooperative scheduling algorithm is proposed to dynamically adjust the idle time of equipment: the integrated scheduling algorithm with dynamic adjustment on machine idle time(ISA_DA). This algorithm adopts the critical path chain and the optimal scheduling strategy. Besides, the adjustment strategy considering the backward movement of the process is put forward to improve the intensity of the close connection of the process and the intensity of parallel processing. Experimental results show that the effect of the proposed algorithm is better than the comparison algorithms: the hierarchical scheduling order algorithm and the process tree cyclic decomposition algorithm. It can increase the equipment utilization rate by 10% and 11.5% respectively, and reduce the makespan by 28.6%.\u003c/p\u003e","manuscriptTitle":"Integrated scheduling algorithm with Dynamic Adjustment on Machine Idle Time","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-05-02 04:28:11","doi":"10.21203/rs.3.rs-4302637/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":"ccf5f7be-9b94-440d-a2ce-df02f8a5a405","owner":[],"postedDate":"May 2nd, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":31306974,"name":"Physical sciences/Mathematics and computing/Computational science"},{"id":31306975,"name":"Physical sciences/Mathematics and computing/Computer science"}],"tags":[],"updatedAt":"2024-12-19T06:54:13+00:00","versionOfRecord":[],"versionCreatedAt":"2024-05-02 04:28:11","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4302637","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4302637","identity":"rs-4302637","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}