{"id":{"repo_id":"windsor","oai_identifier":"oai:uwindsor.scholaris.ca:20.500.14776/8488"},"canonical_url":"https://search.dev.ndltd.org/etd/windsor/oai:uwindsor.scholaris.ca:20.500.14776/8488","repository":{"repo_id":"windsor","name":"University of Windsor","base_url":"https://uwindsor.scholaris.ca/server/oai/request"},"display":{"title":"Multi-Mode Robust Appointment Scheduling for Uncertain Service Time and Random No-Show Using Min-Max Optimization","abstract":"The appointment scheduling issue has been widely used in a variety of industries, including those that provide services, healthcare, finance, and legal advice. Uncertainty of processing time and job no-shows make the problem more challenging. The majority of the literature now in existence makes unrealistic assumptions about most real-world scenarios, such as constant service time, and they use a vast quantity of data to view the service time distribution or failure to account for work no-shows. In the research, we address this issue by building a robust appointment scheduling model that uses min-max optimization to generate appointment time for a multi-mode system while considering customer no-shows and uncertain service times. The objective is to minimize the total expected cost of the job waiting time and service provider's idling and overtime for the worst-case scenario under any realization of the processing time and no-shows of the jobs. The advantage of the suggested methodology is that distributional data about the uncertain service time is not required. Since it just needs to take into account the extreme boundaries of the uncertain parameters, it can provide the best solution with less knowledge about the uncertain parameters. This method can be used with any probability distribution of the uncertain parameters. We formulated a mixed integer linear programming model to solve the problem. We ran some experimental runs and checked the effect of the problem parameters on the end of the day, the job waiting time, server idle time, and the total overall cost. This work will contribute to the literature related to uncertainty handling, job no-shows in decision-making, and industries that aim to achieve an efficient service system.","abstract_html":"The appointment scheduling issue has been widely used in a variety of industries, including those that provide services, healthcare, finance, and legal advice. Uncertainty of processing time and job no-shows make the problem more challenging. The majority of the literature now in existence makes unrealistic assumptions about most real-world scenarios, such as constant service time, and they use a vast quantity of data to view the service time distribution or failure to account for work no-shows. In the research, we address this issue by building a robust appointment scheduling model that uses min-max optimization to generate appointment time for a multi-mode system while considering customer no-shows and uncertain service times. The objective is to minimize the total expected cost of the job waiting time and service provider's idling and overtime for the worst-case scenario under any realization of the processing time and no-shows of the jobs. The advantage of the suggested methodology is that distributional data about the uncertain service time is not required. Since it just needs to take into account the extreme boundaries of the uncertain parameters, it can provide the best solution with less knowledge about the uncertain parameters. This method can be used with any probability distribution of the uncertain parameters. We formulated a mixed integer linear programming model to solve the problem. We ran some experimental runs and checked the effect of the problem parameters on the end of the day, the job waiting time, server idle time, and the total overall cost. This work will contribute to the literature related to uncertainty handling, job no-shows in decision-making, and industries that aim to achieve an efficient service system.","abstract_has_math":false,"creators":["Dash, Anik Chandra"],"institution":"University of Windsor","degree_name":"M.A.Sc.","degree_level":"Masters","degree_discipline":"Industrial and Manufacturing Systems Engineering","degree_department":null,"school":null,"contributors":["scholarship@uwindsor.ca"],"advisors":["Azab, Ahmed A.","Baki, Mohammed Fazle"],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023-10-04","date_published":"2023-10-04","updated_at":"2026-07-27T22:04:52Z","subjects":[],"languages":["en_CA"],"rights":[],"rights_urls":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/20.500.14776/8488","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["scholarship@uwindsor.ca"]},{"key":"dc:contributor.advisor","label":"Advisor","values":["Azab, Ahmed A.","Baki, Mohammed Fazle"]},{"key":"dc:creator","label":"Author","values":["Dash, Anik Chandra"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-07-03 14:19"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2024-02-13 22:03","2025-07-03T18:19:55Z"]},{"key":"dc:date.issued","label":"Date","values":["2023-10-04"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/masterThesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial and Manufacturing Systems Engineering","Engineering, Industrial Engineering, Operations Research, Systems Engineering and Industrial Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.A.Sc."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Windsor"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_CA"]},{"key":"dc:rights","label":"Dc Rights","values":["http://creativecommons.org/licenses/by-nc-nd/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/20.500.14776/8488"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The appointment scheduling issue has been widely used in a variety of industries, including those that provide services, healthcare, finance, and legal advice. Uncertainty of processing time and job no-shows make the problem more challenging. The majority of the literature now in existence makes unrealistic assumptions about most real-world scenarios, such as constant service time, and they use a vast quantity of data to view the service time distribution or failure to account for work no-shows. In the research, we address this issue by building a robust appointment scheduling model that uses min-max optimization to generate appointment time for a multi-mode system while considering customer no-shows and uncertain service times. The objective is to minimize the total expected cost of the job waiting time and service provider's idling and overtime for the worst-case scenario under any realization of the processing time and no-shows of the jobs. The advantage of the suggested methodology is that distributional data about the uncertain service time is not required. Since it just needs to take into account the extreme boundaries of the uncertain parameters, it can provide the best solution with less knowledge about the uncertain parameters. This method can be used with any probability distribution of the uncertain parameters. We formulated a mixed integer linear programming model to solve the problem. We ran some experimental runs and checked the effect of the problem parameters on the end of the day, the job waiting time, server idle time, and the total overall cost. This work will contribute to the literature related to uncertainty handling, job no-shows in decision-making, and industries that aim to achieve an efficient service system."]},{"key":"dc:title","label":"Title","values":["Multi-Mode Robust Appointment Scheduling for Uncertain Service Time and Random No-Show Using Min-Max Optimization"]}]}],"canonical_facts":{"dc:contributor":["scholarship@uwindsor.ca"],"dc:contributor.advisor":["Azab, Ahmed A.","Baki, Mohammed Fazle"],"dc:creator":["Dash, Anik Chandra"],"dc:date.accessioned":["2025-07-03 14:19"],"dc:date.available":["2024-02-13 22:03","2025-07-03T18:19:55Z"],"dc:date.issued":["2023-10-04"],"dc:description.abstract":["The appointment scheduling issue has been widely used in a variety of industries, including those that provide services, healthcare, finance, and legal advice. Uncertainty of processing time and job no-shows make the problem more challenging. The majority of the literature now in existence makes unrealistic assumptions about most real-world scenarios, such as constant service time, and they use a vast quantity of data to view the service time distribution or failure to account for work no-shows. In the research, we address this issue by building a robust appointment scheduling model that uses min-max optimization to generate appointment time for a multi-mode system while considering customer no-shows and uncertain service times. The objective is to minimize the total expected cost of the job waiting time and service provider's idling and overtime for the worst-case scenario under any realization of the processing time and no-shows of the jobs. The advantage of the suggested methodology is that distributional data about the uncertain service time is not required. Since it just needs to take into account the extreme boundaries of the uncertain parameters, it can provide the best solution with less knowledge about the uncertain parameters. This method can be used with any probability distribution of the uncertain parameters. We formulated a mixed integer linear programming model to solve the problem. We ran some experimental runs and checked the effect of the problem parameters on the end of the day, the job waiting time, server idle time, and the total overall cost. This work will contribute to the literature related to uncertainty handling, job no-shows in decision-making, and industries that aim to achieve an efficient service system."],"dc:identifier.uri":["https://hdl.handle.net/20.500.14776/8488"],"dc:language.iso":["en_CA"],"dc:rights":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"dc:title":["Multi-Mode Robust Appointment Scheduling for Uncertain Service Time and Random No-Show Using Min-Max Optimization"],"dc:type":["info:eu-repo/semantics/masterThesis"],"thesis:degree_discipline":["Industrial and Manufacturing Systems Engineering","Engineering, Industrial Engineering, Operations Research, Systems Engineering and Industrial Engineering"],"thesis:degree_level":["Masters"],"thesis:degree_name":["M.A.Sc."],"thesis:institution_name":["University of Windsor"]},"updated_at":"2026-07-27T22:04:52Z"}