Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Optimization Models And Approximate Algorithms For The Aerial Refueling Scheduling And Rescheduling Problems, Sezgin Kaplan
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
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 …
Exact And Heuristic Algorithms For The Job Shop Scheduling Problem With Earliness And Tardiness Over A Common Due Date, Leonardo Bedoya-Valencia
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
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 …
A Comparison Of Alphanumeric, Direct Manipulation Graphic, And Equivalent Interface Design For A Production Scheduling Task, Ann C. Fulop
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 …