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 20 of 22 for “"single machine scheduling"”.
-
Investigation of single machine scheduling with scheduled preventive maintenance
… includmg scheduled preventive maintenance in job scheduling research is quite practical and usefiil. This research mvestigates single machine job scheduling with scheduled preventive maintenance. These problems can be categorized into two classes — fixed maintenance schedule and flexible …
-
Single-machine scheduling of customer orders with restrictions on the number of active orders
… rules to schedule production in dynamic multi-machine environment with the objective of minimizing total costs consisting of setup costs and earliness/tardiness penalties under storage space restrictions for finished products before delivery. There are m loading docks available on the shop …
-
Effects of Processing Time Distributions and Rescheduling Policies on Efficiency and Instability for Single Machine Settings
Operating room (OR) scheduling is becoming increasingly important and poses a challenging problem due to the presence of uncertainty. Motivated by OR scheduling, we study the single machine scheduling problem with uncertainty in both dynamic arrivals and stochastic processing times. We use …
-
Optimization of Large-Scale Single Machine and Parallel Machine Scheduling
… 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 …
-
A smart market for scheduling: An experimental study
… efficient use are exemplified by the problem of scheduling a single machine. Scheduling even a single machine is NP-hard--nonetheless, simulated bidders and human bidders can achieve 80 to 99 percent efficiency in a market for scheduling. These success rates are higher than heuristic algorithms …
-
Distributed optimization under partial information using direct interaction: a methodology and applications
… contexts: manufacturing capacity allocation, single machine scheduling, and jobshop scheduling. The experimental results show that the proposed method generates close-to optimal solutions in the tested problem settings.
-
Logistics with competing users
… logistics problems with competing users: (1) single machine scheduling, (2) network resource allocation and (3) assignment to multiple servers (queues). New cooperative game theoretic methods are developed to negotiate on the Pareto frontier. In addition, a Stackelberg leader-follower game …
-
Energy System Roadmap for Carbon Neutrality via Production Scheduling in Manufacturing
… built under the context of a sequence-dependent single machine scheduling problem. Moreover, the scheduling decisions are assumed to be affected by independent time of use electricity prices and carbon footprint environmental policies forced by either corporate or governmental institutions. To …
-
Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems
… LP-based approximation algorithms for several scheduling and inventory management problems, using both LP-rounding and the primal-dual method. In machine scheduling, we consider a general class of single-machine scheduling problem of minimizing the total cost summing over all jobs, and the only …
-
Polyhedral studies on scheduling and routing problems
… problems: (i) precedence constrained single machine scheduling and (ii) TSP, both Symmetric TSP (STSP) and Asymmetric TSP (ATSP). These problems are of both theoretical interest and practical importance. Better knowledge of the polyhedral descriptions of these problems may facilitate …
-
Algorithmic Developments in Two-Stage Robust Scheduling
… the modelling and solving of a range of scheduling problems, with a particular focus on the use of robust optimisation for scheduling in two-stage decision-making contexts. One key contribution of this thesis is the development of a new compact robust counterpart for the …
-
Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics
… the warehouse management system and the parallel machine scheduling literature. We provide mathematical formulations for the problem and devise two solution methods. The first is a simulated annealing metaheuristic, while the second is an exact branch-and-price method. We test the solutions on …
-
Some topics on deterministic scheduling problems
Sequencing and scheduling problems are motivated by allocation of limited resources over time. The goal is to find an optimal allocation where optimality is defined by some problem specific objectives. This dissertation considers the scheduling of a set of ri tasks, with precedence constraints, on …
-
Scheduling based on earliness and tardiness criteria in assembly job shops
<p>In this research, the following four scheduling problems have been studied: (1) single machine problem with earliness cost minimization, (2) single machine problem with the sum of the weighted earliness and weighted tardiness cost minimization, (3) assembly job shop problem with earliness cost …
-
Batch Scheduling in Supply Chains
… and delivery plays a major role in production scheduling. Inventory holding cost is proportional to the flow time of jobs at the shop. Therefore, we study single machine batch scheduling problems to minimize the sum of weighted flow time and the delivery cost in supply chains.</p> <p> It has …
-
Scheduling Models with Additional Features: Synchronization, Pliability and Resiliency
In this thesis we study three new extensions of scheduling models with both practical and theoretical relevance, namely synchronization, pliability and resiliency. Synchronization has previously been studied for flow shop scheduling and we now apply the concept to open shop models for the first …
-
Meta-raps: Parameter Setting And New Applications
… methods studied, for 38 of the 41 Early/Tardy Single Machine Scheduling with Common Due Date and Sequence-Dependent Setup Time (ETP) problems and 50 of the 54 0-1 Multidimensional Knapsack Problems (0-1 MKP). In addition to the parameter setting procedure discussed, this dissertation provides …
-
Three nonlinear network flow problems
… of user equilibrium. Unlike the problems in the single machine scheduling literature, the project weights, in this case, are unknown a priori due to the nonlinear congestion effects coming from traffic equilibrium. We first derive an analogue of Bellman's optimality principle, allowing us to …
Page 1 of 2