Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Sequencing Problems"”.
-
Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation
… for classes of combinatorial optimisation problems. We introduce a method, called dynasearch, of constructing new neighbourhoods, and of viewing some previously derived exponentially sized neighbourhoods which are searchable in polynomial time. We produce new neighbourhoods by combining …
-
Three essays on sequencing and routing problems
… we study different combinatorial optimization problems. These problems arise in many practical settings where there is a need for finding good solutions fast. The first class of problems we study are vehicle routing problems, and the second type of problems are sequencing problems. We study …
-
Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs
… we present a novel connection between certain sequencing problems that involve the coordination of activities and the problem of factorizing integer numbers. We use this connection to derive hardness results for three different problems: -- The Joint Replenishment Problem with General Integer …
-
Improving the Efficiency of Hub Operations in a Less-than-Truckload Distribution Network
… for assigning trailers to dock doors and sequencing the unloading of shipments at hubs. This thesis reviews current industry practices and available research literature on hub operations. Solution approaches for the trailer-to-door assignment and freight sequencing problems are presented …
-
Modeling, Analysis and Solution Approaches for Some Optimization Problems: High Multiplicity Asymmetric Traveling Salesman, Primary Pharmaceutical Manufacturing Scheduling, and Lot Streaming in an Assembly System
… approaches for some optimization-related problems encountered in industrial and manufacturing settings. We begin by introducing a special type of traveling salesman problem called "High Multiplicity Asymmetric Traveling Salesman Problem" (HMATSP). We propose a new formulation for this …
-
Dynamic Data-Driven Simulation-Based Decision Support System for Medical Procedures
… to capture key decision/task alternatives and sequencing problems within the caregiver’s decision-making. Moreover, discussions on the caregiver's decision-making strategy and the application of the decision-theoretic model (R-DFT) for solving AND/OR junctions based on risk and time-urgency …