<?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-22T21:55:47Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/10642" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/10642</identifier><datestamp>2025-03-26T23:35:14Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Fukasawa, Ricardo</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Ricardez-Sandoval, Luis</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="74b21fbc-0ea5-4ba0-91e9-30aca7a3a5d2" confidence="600">Lagzi, Saman</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2016-08-17T15:14:06Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2016-08-17T15:14:06Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2016-08-17</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2016-08-15</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/10642</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The problem of scheduling operations has received significant attention from academia&#xd;
and industrial practitioners in the past few decades. A key decision in various scheduling&#xd;
operations problems is when to perform an operation and thus the quality of the final&#xd;
schedule can be seriously affected by the choice of how to model the times at which such&#xd;
a decision may take place. The two most commonly used approaches for modeling these&#xd;
times are: Discrete time approaches, which pre-specify a finite set of time points when any&#xd;
decision may be taken, and continuous time approaches, in which the optimization model&#xd;
determines, through the use of continuous decision variables, at which point in time the&#xd;
operation will be performed.&#xd;
The focus of this thesis will be to study the benefits and limitations of each of these&#xd;
approaches within the context of an analytical services facility. Such a facility receives a&#xd;
large number of samples that need to be analyzed/processed through a specific sequence of&#xd;
limited resources/machines before its analysis is completed. The results of these analyses&#xd;
form a basis for many of the decisions made in their client industries (e.g. oil and mining),&#xd;
which in turn indicates the economic importance of the analytical services sector. The&#xd;
operations of such facilities have several particular conditions that need to be modeled and&#xd;
a particularly important one is called multitasking. If analyzing each type of samples is&#xd;
regarded as a task, then the machines in such facilities have the ability to perform multiple&#xd;
tasks at the same time as they are able to analyze different types of samples together at&#xd;
the same (as long as their capacity is not overloaded). The above mentioned study will&#xd;
be performed through an empirical comparison of the discrete and continuous approaches&#xd;
that take into account all the conditions in such facilities, including multitasking.&#xd;
While discrete and continuous approaches have often been independently employed,&#xd;
few studies have considered a comparison between them [37, 28, 39]. In addition, none of&#xd;
these studies consider the operational conditions that are present in short-term scheduling&#xd;
of operations in an analytical services facility.&#xd;
Since the continuous time formulations in the literature are not capable of accounting&#xd;
for multitasking, this thesis presents a novel continuous time mixed-integer linear programming&#xd;
(MILP) formulation that is capable of accommodating such feature and several other&#xd;
operational constraints present at analytical services facilities. The performance of the presented&#xd;
formulation is studied in comparison with a singletasking formulation. The results&#xd;
show that, while the multitasking formulation is not more costly in terms of solution time,&#xd;
it is capable of producing significantly better solutions. Furthermore, this thesis extends&#xd;
the idea of  flexible time discretization for discrete time formulations, previously proposed&#xd;
by Velez and Maravelias [40], to be able to account for the operational constraints of an&#xd;
analytical services facility.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Scheduling</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Continuous Time Formulations</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Non-Uniform Time Discretization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">A Study of Time Representation in a Class of Short Term Scheduling Problems</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Fukasawa, Ricardo</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Ricardez-Sandoval, Luis</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>