Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 7 of 7
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Algorithmic And Mathematical Programming Approaches To Scheduling Problems With Energy-Based Objectives, Kan Fang
Open Access Dissertations
This dissertation studies scheduling as a means to address the increasing concerns related to energy consumption and electricity cost in manufacturing enterprises. Two classes of problems are considered in this dissertation: (i) minimizing the makespan in a permutation flow shop with peak power consumption constraints (the PFSPP problem for short) and (ii) minimizing the total electricity cost on a single machine under time-of-use tariffs (the SMSEC problem for short). We incorporate the technology of dynamic speed scaling and the variable pricing of electricity into these scheduling problems to improve energy efficiency in manufacturing.The challenge in the PFSPP problem is to …
Improved Photolithography Scheduling In Semiconductor Manufacturing, Sreenath Chalil Madathil
Improved Photolithography Scheduling In Semiconductor Manufacturing, Sreenath Chalil Madathil
All Theses
Photolithography is typically the bottleneck process in semiconductor manufacturing. In this thesis, we present a model for optimizing photolithography job scheduling in the presence of both individual and cluster tools. The combination of individual and cluster tools that process various layers or stages of the semiconductor manufacturing process flow is a special type of flexible flowshop. We seek separately to minimize total weighted completion time and maximize on-time delivery performance. Experimental results suggest that our mathematical- and heuristic-based solution approaches show promise for real world implementation as they can help to improve resource utilization, reduce job completion times, and decrease …
An Optimization Model For Class Scheduling At A Dance Studio, Chirag Ojha
An Optimization Model For Class Scheduling At A Dance Studio, Chirag Ojha
All Theses
Scheduling has been a large area of research for decades. A substantial amount of work has been done to express, classify, and solve scheduling problems. Most of these problems are computationally difficult to solve and require complex algorithms. In this thesis, we develop a mixed-integer linear program for a real world optimization problem at a dance studio. Similar to a university, the students in this studio request a particular class and instructors teach the classes under constrained resources such as a limited number of classrooms. The priorities of instructors as well as dancers are included to further mimic reality. Experimental …
Heuristic Algorithms To Minimize Total Weighted Tardiness On The Single Machine And Identical Parallel Machines With Sequence Dependent Setup And Future Ready Time, Yue Xi
Theses and Dissertations
This study generates heuristic algorithms to minimize the total weighted tardiness on the single machine and identical parallel machines with sequence dependent setup and future ready time. Due to the complexity of the considered problem, we propose two new Apparent Tardiness Cost based (ATC-based) rules. The performances of these two rules are evaluated on the single machine and identical parallel machines. Besides of these two rules, we also propose a look-ahead identical parallel machines heuristic (LAIPM). When a machine becomes idle, it selects a job to process from available jobs and near future jobs. The proposed method, LAIPM, is evaluated …
Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau
Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We study a real-world problem arising from the operations of a hospital service provider, which we term the master physician scheduling problem. It is a planning problem of assigning physicians’ full range of day-to-day duties (including surgery, clinics, scopes, calls, administration) to the defined time slots/shifts over a time horizon, incorporating a large number of constraints and complex physician preferences. The goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We propose mathematical programming models that represent different variants of this problem. The models were tested on a real …
East Tennessee Children's Hospital Lean, Eddie D. Eatherly, Catherine Julson, Kelsey Tjader, Jack Smodic, Lanier Loftin
East Tennessee Children's Hospital Lean, Eddie D. Eatherly, Catherine Julson, Kelsey Tjader, Jack Smodic, Lanier Loftin
Chancellor’s Honors Program Projects
No abstract provided.
Vehicle Minimization For The Multimodal Pickup And Delivery Problem With Time Windows, Benjamin A . Clapp
Vehicle Minimization For The Multimodal Pickup And Delivery Problem With Time Windows, Benjamin A . Clapp
Theses and Dissertations
The algorithm proposed here is used for heuristic solutions for the Multimodal Multiple Vehicle Routing Problem with Unloading Capacity, Pickup and Dropoff, and Time Windows, solved so as to minimize the number of vehicles used, subject to varying objective function values for each vehicle. The MVRP is simplified and split into a routing problem and a scheduling problem. The routing problem is addressed by Dijkstra's Algorithm. This generates a new network for the second stage of the algorithm. It is assumed that the shortest path is the correct path to use, and shipments each travel unimodally. The scheduling problem is …