<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T01:38:14Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/27809" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/27809</identifier><datestamp>2026-09-24T21:59:42Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Swartz, Christopher</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Lee, Che</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Chemical Engineering</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-09-14T18:04:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-09-14T18:04:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/27809</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/24024</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Hundreds of steel products need to be scheduled on a single or parallel machine in a steel plant every week. A good feasible schedule may save the company millions of dollars compared to a bad one. Single and parallel machine scheduling are also encountered often in many other industries, making it a crucial research topic for both the process system engineering and operations research communities.&#xd;
&#xd;
Single or parallel machine scheduling can be a challenging combinatorial optimization problem when a large number of jobs are to be scheduled. Each job has unique job characteristics, resulting in different setup times/costs depending on the processing sequence. They also have specific release dates to follow and due dates to meet.&#xd;
&#xd;
This work presents both an exact method using mixed-integer quadratic programming, and an approximate method with metaheuristics to solve real-world large-scale single/parallel machine scheduling problems faced in a steel plant. More than 1000 or 350 jobs are to be scheduled within a one-hour time limit in the single or parallel machine problem, respectively. The objective of the single machine scheduling is to minimize a combined total changeover, total earliness, and total tardiness cost, whereas the objective of the parallel machine scheduling is to minimize an objective function comprising the gaps between jobs before a critical time in a schedule, the total changeover cost, and the total tardiness cost. The exact method is developed to benchmark computation time for a small-scale single machine problem, but is not practical for solving the actual large-scale problem. A metaheuristic algorithm centered on variable neighborhood descent is developed to address the large-scale single machine scheduling with a sliding-window decomposition strategy. The algorithm is extended and modified to solve the large-scale parallel machine problem. Statistical tests, including Student's t-test and ANOVA, are conducted to determine efficient solution strategies and good parameters to be used in the metaheuristics.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Applied Science (MASc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">single machine scheduling</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">parallel machine scheduling</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">mixed-integer programming</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">metaheuristics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">variable neighborhood descent</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Optimization of Large-Scale Single Machine and Parallel Machine Scheduling</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">Large-Scale Single Machine and Parallel Machine Scheduling in the Steel Industry with Sequence-Dependent Changeover Costs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>