Novel Mathematical Programming Models for Radiotherapy Appointments Scheduling

preprint OA: closed
Full text JSON View at publisher
Full text 16,446 characters · extracted from preprint-html · click to expand
Novel Mathematical Programming Models for Radiotherapy Appointments Scheduling | 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 Research Article Novel Mathematical Programming Models for Radiotherapy Appointments Scheduling Mohammad-Matin Kord-Sichani, Saeedeh Ketabi, Mahsa Kianinia This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8487431/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 8 You are reading this latest preprint version Abstract A large number of cancer patients at present and the prediction of a significant increase in the number of cancer cases in the next two decades, have raised the importance of proper timing for optimal use of medical resources to cure. The radiotherapy (RT) treatment, as the most used cancer therapy, should be scheduled in several radiation sessions, with specific intervals and duration planned by the oncologists, distinguishing it from other patient scheduling issues. Our main objective is to minimize the waiting time for access to radiation care for cancer treatment. In this study, we propose a mixed integer linear programming (MILP) model to formulate the problem of scheduling and sequencing RT sessions considering current restrictions in radiotherapy centers such as treatment deadlines, patient priorities, linac capacity, and patient treatment plans. A novel feature of the proposed model is the ability to adapt any sequence of appointments prescribed for different medical conditions and the rules of medical centers. This model can simplify implementation and improve real-time scheduling, especially for cases with long queues. The results show that the model can reduce patients’ waiting time significantly according to their priorities. Radiotherapy Planning Patient Scheduling Mixed Integer Linear Programming Linear accelerator Full Text Additional Declarations No competing interests reported. Supplementary Files Appendices.docx Cite Share Download PDF Status: Under Review Version 1 posted Reviews received at journal 20 Jan, 2026 Reviewers agreed at journal 12 Jan, 2026 Reviews received at journal 11 Jan, 2026 Reviewers agreed at journal 09 Jan, 2026 Reviewers invited by journal 06 Jan, 2026 Editor assigned by journal 05 Jan, 2026 Submission checks completed at journal 05 Jan, 2026 First submitted to journal 31 Dec, 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-8487431","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":570441721,"identity":"8d1425fd-57b1-44f1-8e4f-cf26ec5c3825","order_by":0,"name":"Mohammad-Matin Kord-Sichani","email":"","orcid":"","institution":"University of Isfahan","correspondingAuthor":false,"prefix":"","firstName":"Mohammad-Matin","middleName":"","lastName":"Kord-Sichani","suffix":""},{"id":570441723,"identity":"d712ba81-b83c-43e0-89b5-2da43423e0bc","order_by":1,"name":"Saeedeh Ketabi","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA3klEQVRIiWNgGAWjYDACHiBmbJCQg/AMGMBcQloYG4BajEnWwpBIQBkSkO85fPzBzx0W6f39hw8w8xQwyPM3MLd9wKfF4GxbYmPvGYncGTfSEph5DBgMZxxgbJ6BVws/j2EDb5tEbsMNHgOQFsYNDIzN+B3Wz/+x8W+bRLr8+fMfQFrsCWphONvD2Ay0JcHgQA4DSEsiQS0GZ44ZzpY9I2G48UaawcE5BhLJMw4TclhP8oOPb3fUycudP/zwwZs/Nrb97e2P8TsMGRxgYJBgYGAmXsMoGAWjYBSMAhwAAIHwRU+bcesLAAAAAElFTkSuQmCC","orcid":"","institution":"University of Isfahan","correspondingAuthor":true,"prefix":"","firstName":"Saeedeh","middleName":"","lastName":"Ketabi","suffix":""},{"id":570441725,"identity":"e6692536-4c2a-4e7d-984c-5372da4a1c39","order_by":2,"name":"Mahsa Kianinia","email":"","orcid":"","institution":"Isfahan University of Medical Sciences","correspondingAuthor":false,"prefix":"","firstName":"Mahsa","middleName":"","lastName":"Kianinia","suffix":""}],"badges":[],"createdAt":"2025-12-31 08:08:31","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8487431/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8487431/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":99912170,"identity":"6fd1d351-c2b4-4dbe-b08d-294491a4392c","added_by":"auto","created_at":"2026-01-09 18:35:19","extension":"docx","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":124365,"visible":true,"origin":"","legend":"","description":"","filename":"paper1sichani9.docx","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/7ba05990504af99d3dc75fe7.docx"},{"id":100359626,"identity":"46673e86-dd27-4050-86b1-60f39a14d179","added_by":"auto","created_at":"2026-01-16 07:23:57","extension":"json","order_by":1,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":4934,"visible":true,"origin":"","legend":"","description":"","filename":"36b028f06c4f4bd8bf82fdf4ed652d9b.json","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/d33a49ec3458c77ebf9023ee.json"},{"id":99912176,"identity":"2cd3f518-e8d3-4a64-a52e-6795ebf4e579","added_by":"auto","created_at":"2026-01-09 18:35:19","extension":"docx","order_by":2,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":218905,"visible":true,"origin":"","legend":"","description":"","filename":"Appendices.docx","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/a6ebb3d28b8d1d5d870943c4.docx"},{"id":99912179,"identity":"d70865f1-30c4-4be0-9eeb-23024f51b0a9","added_by":"auto","created_at":"2026-01-09 18:35:19","extension":"xml","order_by":3,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":171301,"visible":true,"origin":"","legend":"","description":"","filename":"36b028f06c4f4bd8bf82fdf4ed652d9b1enriched.xml","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/e7b1426d29caa3578973108a.xml"},{"id":99912177,"identity":"35345eb1-3233-4494-b32a-90a02038f3f7","added_by":"auto","created_at":"2026-01-09 18:35:19","extension":"jpeg","order_by":4,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":1966,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage1.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/71398aa507627459e62fe2d3.jpeg"},{"id":100359389,"identity":"f80fa75e-13fd-46a1-a488-e0ebc678eeee","added_by":"auto","created_at":"2026-01-16 07:22:12","extension":"jpeg","order_by":5,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":29668,"visible":true,"origin":"","legend":"","description":"","filename":"groupimage1.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/556997421dee79b7e53a5edb.jpeg"},{"id":99912183,"identity":"92ac65d3-f4b7-43e7-89ab-8d3c8daa28f1","added_by":"auto","created_at":"2026-01-09 18:35:19","extension":"png","order_by":6,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":999,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage1.png","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/ac56f17586d06951c391a5f6.png"},{"id":99912181,"identity":"58d83781-32eb-43e5-a619-64fbfaa342d6","added_by":"auto","created_at":"2026-01-09 18:35:19","extension":"png","order_by":7,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":7562,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinegroupimage1.png","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/10b69cafc195ab9487e72114.png"},{"id":99912184,"identity":"7d236647-ca28-4cd4-b8f0-30708260e3f4","added_by":"auto","created_at":"2026-01-09 18:35:19","extension":"xml","order_by":8,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":169182,"visible":true,"origin":"","legend":"","description":"","filename":"36b028f06c4f4bd8bf82fdf4ed652d9b1structuring.xml","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/d3bbb56a006e3bda30e5f9be.xml"},{"id":99912186,"identity":"fc7364f7-fb45-472a-acce-c5304dbdd3ae","added_by":"auto","created_at":"2026-01-09 18:35:20","extension":"html","order_by":9,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":186976,"visible":true,"origin":"","legend":"","description":"","filename":"earlyproof.html","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/c1c636b26eb2c105bccac3f3.html"},{"id":100377269,"identity":"f3797725-a452-41b1-b74a-a7b440668bf2","added_by":"auto","created_at":"2026-01-16 08:47:38","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":638256,"visible":true,"origin":"","legend":"","description":"","filename":"paper1sichani9.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1_covered_ef4c42e8-de42-4b7e-88b0-fcb18bb3777f.pdf"},{"id":99912173,"identity":"467c9bf8-5aea-4c98-86de-5ac4df2c38f1","added_by":"auto","created_at":"2026-01-09 18:35:19","extension":"docx","order_by":0,"title":"","display":"","copyAsset":false,"role":"supplement","size":218905,"visible":true,"origin":"","legend":"","description":"","filename":"Appendices.docx","url":"https://assets-eu.researchsquare.com/files/rs-8487431/v1/568153c3c22d332fff9481fc.docx"}],"financialInterests":"No competing interests reported.","formattedTitle":"Novel Mathematical Programming Models for Radiotherapy Appointments Scheduling","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"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":"bmc-health-services-research","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"bhsr","sideBox":"Learn more about [BMC Health Services Research](http://bmchealthservres.biomedcentral.com/)","snPcode":"","submissionUrl":"https://www.editorialmanager.com/BHSR/default.aspx","title":"BMC Health Services Research","twitterHandle":"BMC_series","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"em","reportingPortfolio":"BMC Series","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"Radiotherapy Planning, Patient Scheduling, Mixed Integer Linear Programming, Linear accelerator","lastPublishedDoi":"10.21203/rs.3.rs-8487431/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8487431/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eA large number of cancer patients at present and the prediction of a significant increase in the number of cancer cases in the next two decades, have raised the importance of proper timing for optimal use of medical resources to cure. The radiotherapy (RT) treatment, as the most used cancer therapy, should be scheduled in several radiation sessions, with specific intervals and duration planned by the oncologists, distinguishing it from other patient scheduling issues. Our main objective is to minimize the waiting time for access to radiation care for cancer treatment.\u003c/p\u003e \u003cp\u003eIn this study, we propose a mixed integer linear programming (MILP) model to formulate the problem of scheduling and sequencing RT sessions considering current restrictions in radiotherapy centers such as treatment deadlines, patient priorities, linac capacity, and patient treatment plans. A novel feature of the proposed model is the ability to adapt any sequence of appointments prescribed for different medical conditions and the rules of medical centers. This model can simplify implementation and improve real-time scheduling, especially for cases with long queues. The results show that the model can reduce patients\u0026rsquo; waiting time significantly according to their priorities.\u003c/p\u003e","manuscriptTitle":"Novel Mathematical Programming Models for Radiotherapy Appointments Scheduling","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-01-09 18:35:14","doi":"10.21203/rs.3.rs-8487431/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorInvitedReview","content":"","date":"2026-01-20T13:55:37+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"285682131523159368730845548881909533681","date":"2026-01-12T08:14:27+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-01-11T14:45:33+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"117896073067259670689806574512750952996","date":"2026-01-09T05:33:06+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-01-06T21:25:50+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-01-06T02:04:01+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-01-06T02:03:56+00:00","index":"","fulltext":""},{"type":"submitted","content":"BMC Health Services Research","date":"2025-12-31T08:00:18+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"bmc-health-services-research","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"bhsr","sideBox":"Learn more about [BMC Health Services Research](http://bmchealthservres.biomedcentral.com/)","snPcode":"","submissionUrl":"https://www.editorialmanager.com/BHSR/default.aspx","title":"BMC Health Services Research","twitterHandle":"BMC_series","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"em","reportingPortfolio":"BMC Series","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"dddec576-4c5e-468b-a97a-7f2a604ce644","owner":[],"postedDate":"January 9th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-01-09T18:35:15+00:00","versionOfRecord":[],"versionCreatedAt":"2026-01-09 18:35:14","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8487431","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8487431","identity":"rs-8487431","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","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 (2026) — 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