Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 13 of 13
Full-Text Articles in Business
Methods To Support The Project Selection Problem With Non-Linear Portfolio Objectives, Time Sensitive Objectives, Time Sensitive Resource Constraints, And Modeling Inadequacies, Neil C. Ranly
Theses and Dissertations
The United States Air Force relies upon information production activities to gain insight regarding uncertainties affecting important system configuration and in-mission task execution decisions. Constrained resources that prevent the fulfillment of every information production request, multiple information requestors holding different temporal-sensitive objectives, non-constant marginal value preferences, and information-product aging factors that affect the value-of-information complicate the management of these activities. This dissertation reviews project selection research related to these issues and presents novel methods to address these complications. Quantitative experimentation results demonstrate these methods’ significance.
An Optimization Model For Operating Room Scheduling To Reduce Blocking Across The Perioperative Process, Amin Abedini, Wei Li, Honghan Ye
An Optimization Model For Operating Room Scheduling To Reduce Blocking Across The Perioperative Process, Amin Abedini, Wei Li, Honghan Ye
Mechanical Engineering Faculty Publications
Operating room (OR) scheduling is important. Because of increasing demand for surgical services, hospitals must provide high quality care more efficiently with limited resources. When constructing the OR schedule, it is necessary to consider the availability of downstream resources, such as intensive care unit (ICU) and post anaesthesia care unit (PACU). The unavailability of downstream resources causes blockings between every two consecutive stages. In this paper we address the master surgical schedule (MSS) problem in order to minimize blockings between two consecutive stages. First, we present a blocking minimization (BM) model for the MSS by using integer programming, based on …
Comparing Critical Chain Project Managemenet With Critical Path Method: A Case Study, Behzad Montazeri
Comparing Critical Chain Project Managemenet With Critical Path Method: A Case Study, Behzad Montazeri
Masters Theses & Specialist Projects
Scheduling is a major task in project management. The current scheduling technique, Critical Path Method (CPM), has been widely applied for several decades, but a large number of projects fail to be completed on time and schedule delays occur in many projects. This raises question about the validity of the current project scheduling system. Critical Chain Project Management (CCPM), derived from Theory of Constraints, is a relatively new alternative approach toward scheduling projects. This study compared CCPM and CPM to determine which scheduling method delivers a shorter project duration and has a better usage of resources. A scheduling software called …
Scheduling Strategies For Construction Project Managers Toward On Time Delivery, Paul Shamp
Scheduling Strategies For Construction Project Managers Toward On Time Delivery, Paul Shamp
Walden Dissertations and Doctoral Studies
Construction management projects involve complex, dynamic environments resulting in uncertainty and risk, compounded by demanding time constraints. Research indicated project managers have struggled to identify best practices for scheduling construction projects via critical path methodologies while searching for tools to increase timely job completions and budget profits. The purpose of this single case study was to explore the strategies that construction project managers used to manage scheduled construction project delivery on time. The constructivist philosophical worldview was used as the framework for this study. Data were collected from semistructured interviews from 7 project managers from 5 different construction companies selected …
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Shih-Fen Cheng
In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Shih-Fen Cheng
In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Shih-Fen CHENG
In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …
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 …
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …
Summer Sessions Breakdown Of Course Dates And Time, Paul Savory
Summer Sessions Breakdown Of Course Dates And Time, Paul Savory
Department of Industrial and Management Systems Engineering: Faculty Publications
This report highlights an exhaustive analysis of the hundreds of Summer Session courses to develop an understanding of when they occur during the day and during which of the four academic terms. The analysis shows that the most popular time for scheduling courses is between 9:30 am and noon for each of the four summer session terms. Given the limited number of general purpose classrooms on campus, accommodating faculty preference for rooms, buildings, and computer equipment is sometimes not possible during the most in demand course times. The results also showcase the potential for having summer courses four-day per week …
Dynamic Allocation Of Airline Check-In Counters: A Queueing Optimisation Approach, Mahmut Parlar, Sharafali Moosa
Dynamic Allocation Of Airline Check-In Counters: A Queueing Optimisation Approach, Mahmut Parlar, Sharafali Moosa
Research Collection Lee Kong Chian School Of Business
This paper was motivated by an observation in an international airport with regard to allocation of resources for check-in counters. In an exclusive check-in counter system, each flight has a dedicated number of counters that will be open until at least a half-hour before the scheduled departure of that flight. Currently, in many of the airports around the world, the decision to open or close check-in counters is done on an ad hoc basis by human schedulers. In doing so, the schedulers are almost always forced to perform a balancing act in meeting the quality of service stipulated by the …
Optimization Model For Base-Level Delivery Routes And Crew Scheduling, Young-Ho Cha
Optimization Model For Base-Level Delivery Routes And Crew Scheduling, Young-Ho Cha
Theses and Dissertations
In the U.S. Air Force, a Logistic Readiness Squadron (LRS) provides material management, distribution, and oversight of contingency operations. Dispatchers in the LRS must quickly prepare schedules that meet the needs of their customers while dealing with real-world constraints, such as time windows, delivery priorities, and intermittent recurring missions. Currently, LRS vehicle operation elements are faced with a shortage of manpower and lack an efficient scheduling algorithm and tool. The purpose of this research is to enhance the dispatchers' capability to handle flexible situations and produce "good" schedules within current manpower restrictions. In this research, a new scheduling model and …
Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew
Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew
Research Collection School Of Computing and Information Systems
We present ROMAN, a comprehensive, generic manpower rostering toolkit that successfully handles a wide spectrum of work policies found in service organizations. We review the use of various techniques and methodologies in the toolkit that contribute to its robustness and efficiency, and relate experience gained in addressing manpower rostering problems in industry.