Engineering Commons^™

Utilization Of Integer Programming For Scheduling Maintenance At Nuclear Power Plants, Timothy Gallacher

Doctoral Dissertations

This thesis develops a thought that naturally explores three specific motifs for solving the complexities of scheduling maintenance at Nuclear Power Plants (NPP). The first chapter of this paper will develop the initial thought around creating a schedule for a given work week, including all the various constraints inherent to this problem. Such constraints include but are not limited to personnel availability, allowable component out-of-service time, and the Plant Risk Assessment. The objective function being to minimize the total cost of worker’s compensation for that given week.

The second chapter addresses the question of whether this simple schedule can be …

Essays On Perioperative Services Problems In Healthcare, Amogh S. Bhosekar

All Dissertations

One of the critical challenges in healthcare operations management is to efficiently utilize the expensive resources needed while maintaining the quality of care provided. Simulation and optimization methods can be effectively used to provide better healthcare services. This can be achieved by developing models to minimize patient waiting times, minimize healthcare supply chain and logistics costs, and maximize access. In this proposal, we study some of the important problems in healthcare operations management. More specifically, we focus on perioperative services and study scheduling of operating rooms (ORs) and management of necessary resources such as staff, equipment, and surgical instruments. We …

Scheduling, Complexity, And Solution Methods For Space Robot On-Orbit Servicing, Susan E. Sorenson

Graduate Theses and Dissertations

This research proposes problems, models, and solutions for the scheduling of space robot on-orbit servicing. We present the Multi-Orbit Routing and Scheduling of Refuellable On-Orbit Servicing Space Robots problem which considers on-orbit servicing across multiple orbits with moving tasks and moving refuelling depots. We formulate a mixed integer linear program model to optimize the routing and scheduling of robot servicers to accomplish on-orbit servicing tasks. We develop and demonstrate flexible algorithms for the creation of the model parameters and associated data sets. Our first algorithm creates the network arcs using orbital mechanics. We have also created a novel way to …

A Study Of Scheduling Problems With Sequence Dependent Restrictions And Preferences, Nitin Srinath

All Dissertations

In some applications like fabric dying, semiconductor wafer processing, and flexible manufacturing, the machines being used to process jobs must be set up and serviced frequently. These setup processes and associated setup times between jobs often depend on the jobs and the sequence in which jobs are placed onto machines. That is, the scheduling of jobs on machines must account for the sequence-dependent setup times as well. These setup times can be a major factor in operational costs. In fabric dyeing processes, the sequence in which jobs are processed is also important for quality, i.e., there is a strong preference …

A Deep Reinforcement Learning Approach With Prioritized Experience Replay And Importance Factor For Makespan Minimization In Manufacturing, Jose Napoleon Martinez

LSU Doctoral Dissertations

In this research, we investigated the application of deep reinforcement learning (DRL) to a common manufacturing scheduling optimization problem, max makespan minimization. In this application, tasks are scheduled to undergo processing in identical processing units (for instance, identical machines, machining centers, or cells). The optimization goal is to assign the jobs to be scheduled to units to minimize the maximum processing time (i.e., makespan) on any unit.

Machine learning methods have the potential to "learn" structures in the distribution of job times that could lead to improved optimization performance and time over traditional optimization methods, as well as to adapt …

Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method, Bryant Jamison Spencer

Graduate Theses, Dissertations, and Problem Reports

In the pharmaceutical manufacturing world, a deadline could be the difference between losing a multimillion-dollar contract or extending it. This, among many other reasons, is why good scheduling methods are vital. This problem report addresses Flexible Flowshop (FF) scheduling using Simulated Annealing (SA) in conjunction with the Steepest Descent heuristic (SD).

FF is a generalized version of the flowshop problem, where each product goes through S number of stages, where each stage has M number of machines. As opposed to a normal flowshop problem, all ‘jobs’ do not have to flow in the same sequence from stage to stage. The …

Methodologies For Solving Integrated Transportation And Scheduling Problems, Fereydoun Adbesh

Graduate Theses and Dissertations

This research proposes novel solution techniques to optimize two real-world problems in the area of scheduling and transportation. We first consider a model for optimizing the operations of dredges. In this problem, scheduling and assignment decisions are integrated across a finite planning horizon. Additional constraints and problem elements explicitly considered include, but are not limited, to environmental work window restrictions, budget limitations, dredge operation rates and schedule-dependent dredge availability. Our approach makes use of Constraint Programming (CP) to obtain quality and robust solutions within an amount of time small enough to be useful to practitioners. The expanded feature set of …

Decision Support Models For A Few Critical Problems In Transportation System Design And Operations, Ran Zhang

USF Tampa Graduate Theses and Dissertations

Transportation system is one of the key functioning components of the modern society and plays an important role in the circulation of commodity and growth of economy. Transportation system is not only the major influencing factor of the efficiency of large-scale complex industrial logistics, but also closely related to everyone’s daily life. The goals of an ideal transportation system are focused on improving mobility, accessibility, safety, enhancing the coordination of different transportation modals and reducing the impact on the environment, all these activities require sophisticated design and plan that consider different factors, balance tradeoffs and maintaining efficiency. Hence, the design …

Heuristic Solution For Separated Manufacturing Process, James Dee Davis

Masters Theses

Downtime is a major issue for manufactures. Downtime may occur from breakdowns, quality issues, lack of manpower, lack of materials, or in this case a lack of storage containers. A manufacturing system was studied that consists of an injection machine that supplies two assembly lines. The injection machine suffered from frequent downtime from lack of containers. The process was analyzed for root cause of downtime. After analysis of the system it was found that the injection process had high variability in production quantity and quality. The scheduling scheme called for production until all available containers were full regardless of actual …

Optimizing Boat Hull And Deck Mold Storage Scheduling With Linear Programming, Tron Bjorn Dareing

Masters Theses

With a wide range of products, Sea Ray uses a vast amount of large boat molds for each of the different boat models. Storing and transporting these molds can be an issue with introducing high variability in the production process. One of the largest problems deals with the utilization of the employees’ time with the large amount of boat production. Having the boat molds being ready for production is a critical part of the manufacturing of quality boats. There is non-value added time spent on preparing the molds for the lamination process and storing them in various areas. This problem …

Large-Scale Solution Approaches For Healthcare And Supply Chain Scheduling, Ridvan Gedik

Graduate Theses and Dissertations

This research proposes novel solution techniques for two real world problems. We first consider a patient scheduling problem in a proton therapy facility with deterministic patient arrivals. In order to assess the impacts of several operational constraints, we propose single and multi-criteria linear programming models. In addition, we ensure that the strategic patient mix restrictions predetermined by the decision makers are also enforced within the planning horizon. We study the mathematical structures of the single criteria model with strict patient mix restrictions and derive analytical equations for the optimal solutions under several operational restrictions. These efforts lead to a set …

A Set Union Based Formulation For Course Scheduling And Timetabling, Jesse Paul Bukenberger

Master's Theses

The Course Timetabling Problem is a widely studied optimization problem where a number of sections are scheduled in concert with the assignment of students to sections in order to maximize the desirability of the resulting schedule for all stakeholders. This problem is commonly solved as a linear program with variables for each student or group of students with identical schedules. In this paper we explore an alternative formulation that aggregates binary student variables into integer variables denoting the number of students enrolled in a course. Our solution method assumes decomposition of the general schedule into time blocks, and applies a …

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 …

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 …

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.

A New Metaheuristic Algorithm Motivated By The Rooting Phenomena In Plants, Behzad Nemati

All Theses

In this thesis, we present a new metaheuristic algorithm for analyzing challenging optimization problems. Initial testing reveals the potential for the algorithm, which is based on the rooting phenomena found in plants in nature, to quickly produce effective solutions to challenging combinatorial optimization problems in the class NP. We present computational results describing the proposed metaheuristic's efficacy for an important class of scheduling problems and discuss areas of future work and application.

Implementation Of Evolutionary Algorithms On The Power Industry And Aviation Security, Anuar Jesus Aguirre

Open Access Theses & Dissertations

The main objective of the power electric power grid is to supply reliable electricity to all the customers. Customers could be industrial, commercial, household, transportation and others. The power grid is a complex and large, and it formed by the conjunction of the generation, transmission and distribution system. The present research is focused in power distribution system. A new component replacement analysis method to solve component replacement problems for complex electricity distribution systems using Genetic Algorithms is developed. In the present model a Taylor series expansion is used to approximate the associated opportunity cost for each component in the system. …

Optimization Models And Approximate Algorithms For The Aerial Refueling Scheduling And Rescheduling Problems, Sezgin Kaplan

Engineering Management & Systems Engineering Theses & Dissertations

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with release times and due date-to-deadline window. ARSP assumes that the jobs have different release times, due dates, and due date-to-deadline windows between the refueling due date and a deadline to return without refueling. The Aerial Refueling Rescheduling Problem (ARRP), on the other hand, can be defined as updating the existing AR schedule after being disrupted by job related events including the …

Random Keys Genetic Algorithms Scheduling And Rescheduling Systems For Common Production Systems, Elkin Rodriguez-Velasquez

Engineering Management & Systems Engineering Theses & Dissertations

The majority of scheduling research deals with problems in specific production environments with specific objective functions. However, in many cases, more than one problem type and/or objective function exists, resulting in the need for a more generic and flexible system to generate schedules. Furthermore, most of the published scheduling research focuses on creating an optimal or near optimal initial schedule during the planning phase. However, after production processes start, circumstances like machine breakdowns, urgent jobs, and other unplanned events may render the schedule suboptimal, obsolete or even infeasible resulting in a "rescheduling" problem, which is typically also addressed for a …

Modeling Systems For Optimal Resource Allocation, Scheduling, And Decision Making, Esengul Tayfur

All Dissertations

This dissertation focuses on the resource requirements and scheduling problem for logistic systems. We investigate solutions to this problem in two different logistic systems: logistic system of the health care facilities during emergency evacuations and delivery and distribution system of production industries. All hospitals must have an evacuation plan to ensure the safety of patients and prevent the loss of life. However, hospital operators have not been able to quantify how resource availability, the cost of acquiring those resources, and evacuation completion time are related. This research addresses this problem and contributes two methodologies to solve this problem. In the …

In-House Development Of Scheduling Decision Support Systems: Case Study For Scheduling Semiconductor Device Test Operations, Tali Freed, K. H. Doerr, T. Chang

Industrial and Manufacturing Engineering

Most manufacturing processes can benefit from an automated scheduling system. However;: the design of a fast, computerised scheduling system that achieves high-quality results and requires minimal resources is a difficult undertaking. Efficient .. scheduling of a semiconductor device test facility requires an information system that provides good schedules quickly. Semiconductor device testing-is the last stage of the long semiconductor manufacturing process, and therefore. is subjected to customer service pressures. The cost of an off-the-shelf computerised scheduling system may he prohibitive for many companies. In addition, many companies are taken aback by other characteristics of off-the-shelf scheduling systems, such as code …

Exact And Heuristic Algorithms For The Job Shop Scheduling Problem With Earliness And Tardiness Over A Common Due Date, Leonardo Bedoya-Valencia

Engineering Management & Systems Engineering Theses & Dissertations

Scheduling has turned out to be a fundamental activity for both production and service organizations. As competitive markets emerge, Just-In-Time (JIT) production has obtained more importance as a way of rapidly responding to continuously changing market forces. Due to their realistic assumptions, job shop production environments have gained much research effort among scheduling researchers. This research develops exact and heuristic methods and algorithms to solve the job shop scheduling problem when the objective is to minimize both earliness and tardiness costs over a common due date. The objective function of minimizing earliness and tardiness costs captures the essence of the …

A Robust Reactive Scheduling System With Application To Parallel Machine Scheduling, Jean-Paul M. Arnaout

Engineering Management & Systems Engineering Theses & Dissertations

In this turbulent world, scheduling role has become crucial in most manufacturing production, and service systems. It allows the allocation of limited resources to activities with the objective of optimizing one performance measure or more. Resources may be machines in a factory, operating rooms in a hospital, or employees in a company, while activities can be jobs in a manufacturing plant, surgeries in a hospital, or paper work in a company. The goal of each schedule is to optimize some performance measures, which could be the minimization of the schedule makespan, the jobs' completion times, jobs' earliness and tardiness, among …

Set-Up Saving Schemes For Printed Circuit Boards Assembly, Oded Z. Maimon, Ezey M. Dar-El, Tali F. Carmon

Industrial and Manufacturing Engineering

Focusing on a basic printed circuit board (PCB) assembly line configuration characterized by very long set-up times, we examine two scheduling methods that can significantly reduce the set-up. Both methods -the Grouped Set-Up (GSU) method that has been recently introduced in the literature and the Sequence Dependent Scheduling (SDS) method, which has not been studied in this context -are based on component commonality among PCB types. Using the typical traditional scheduling method as a benchmark, the GSU and the SDS methods are compared in terms of three performance measures: line throughput, average work-in-process (WIP) inventory level, and implementation complexity. Guidelines …

A Comparison Of Alphanumeric, Direct Manipulation Graphic, And Equivalent Interface Design For A Production Scheduling Task, Ann C. Fulop

Psychology Theses & Dissertations

Scheduling is an essential factor influencing the efficiency of any production system. The effectiveness of the scheduling system depends upon the interaction of the human and machine. Thus, to effectively design the interface between the human and the machine, the human factors professional must understand scheduling behavior and the information requirements of the scheduling task. The present study modeled human scheduling behavior and determined the information requirements of the scheduling task. The study also compared alphanumeric, direct manipulation graphic, and equivalent interfaces to determine which interface best supports scheduling. The results of the study show that schedulers monitor the current …

Proposed Scheduling Methods For Printed Circuit Board Assembly, Tali Freed, Ezey M. Dar-El, Oded Z. Maimon

Industrial and Manufacturing Engineering

The current practice in the assembly of electronic components on printed circuit boards (PCB's) is serial production, a process characterized by very long set-up times.

However. with the advent of efficient on-line process information, new production control methods are now possible. This paper proposes two new production methods - the Grouped Set-up (GSU) method and the Sequence-Dependent Scheduling (SDS) method, which can significantly reduce set-up times.

It is shown that the GSU always performs better than the SDS method in terms of total production flow (throughput). while the SDS performs better than the GSU method in terms of work-in-process (WIP) …