Digital Commons Network^™

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 …

Wikifying Your Workplace, Audrey Defrank, Karen K. Hein

Criss Library Faculty Proceedings & Presentations

A presentation on adding an organizational wiki to your workplace drawing upon gardening analogies. What's a Wiki?; Wiki your Work; Sowing the Seeds; Why Wiki?; Your Monitor?; Your Inbox?; Your Shared Drive?; Your Intranet?; Your People?; Choosing a Wiki; Planting; Growing; Weeding; Future Harvests; Criss Library Wiki; Criss Library Wiki Stats; New Crops and Cultivation for Criss Library; Keep Tilling!

Comparison Of De And Pso For Generator Maintenance Scheduling, Yusuf Yare, Ganesh K. Venayagamoorthy

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents a comparison of a differential evolution (DE) algorithm and a modified discrete particle swarm optimization (MDPSO) algorithm for generating optimal preventive maintenance schedules for economical and reliable operation of a power system, while satisfying system load demand and crew constraints. The DE, an evolutionary technique and an optimization algorithm utilizes the differential information to guide its further search, and can handle mixed integer discrete continuous optimization problems. Discrete particle swarm optimization (DPSO) is known to effectively solve large scale multi-objective optimization problems and has been widely applied in power systems. Both the DE and MDPSO are applied …

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 …

Dynamic Energy Aware Task Scheduling For Periodic Tasks Using Expected Execution Time Feedback, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

Scheduling dependent tasks is one of the most challenging problems in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. An interesting application of scheduling is in the area of energy awareness for mobile battery operated devices where minimizing the energy utilized is the most important scheduling policy consideration. A number of heuristics have been developed for this consideration. In this paper, we study the scheduling problem for a particular battery model. In the proposed work, we show how to enhance a well know approach of accounting for …

R&D Project Scheduling When Activities May Fail, Bert De Reyck, Roel Leus

Research Collection Lee Kong Chian School Of Business

An R&D project typically consists of several stages. Due to technological risks, the project may have to be terminated before completion, each stage having a specific likelihood of success. In the project planning and scheduling literature, this technological uncertainty has typically been ignored and project plans are developed only for scenarios in which the project succeeds. In this paper we examine how to schedule projects in order to maximize their expected net present value when the project activities have a probability of failure and when an activity's failure leads to overall project termination. We formulate the problem, show that it …

A Heuristic Search Algorithm For Flow-Shop Scheduling, Joshua P. Fan, Graham K. Winley

Sydney Business School - Papers

This article describes the development of a new intelligent heuristic search algorithm (IHSA*) which guarantees an optimal solution for flow-shop problems with an arbitrary number of jobs and machinesprovided the job sequence is constrained to be the same on each machine. The development is described in terms of 3 modifications made to the initial version of IHSA*. The first modification concerns thechoice of an admissible heuristic function. The second concerns the calculation of heuristic estimates as the search for an optimal solution progresses, and the third determines multiple optimal solutions whenthey exist. The first 2 modifications improve performance characteristics of …

Integrated, Embedded, And Case-Based: Selling Library Instruction To The Business School, Leticia Camacho, Andy Spackman

Faculty Publications

Brigham Young University (BYU), located in Provo, Utah, is home to the Marriott School of Management, which has an enrollment of 1,900 undergraduate and 1,100 graduate students. Nearly 75 percent are bilingual, 20 percent speak a third language, and approximately 10 percent are foreign citizens.

In the year 2000, the Tanner Management Library was displaced from the Marriott School and incorporated into the Harold B. Lee Library, BYU’s main campus library. Without a physical presence in the business school, BYU’s business librarians have struggled to remain relevant to a faculty and student body that is increasingly dependent on the Internet …

Introducing Algorithm Portfolios To A Class Of Vehicle Routing And Scheduling Problem, Nagesh Shukla, Yogesh Dashora, M K. Tiwari, F T. S Chan, T C. Wong

Faculty of Engineering and Information Sciences - Papers: Part A

The paper presents a comprehensive foundation and implementation of Algorithm Portfolios to solve Theater Distribution Vehicle Routing and Scheduling Problems (TDVRSP). In order to evaluate the performance of proposed approach, it has been applied to varying dimensions of theater distribution problem. In particular, eight random search metaheuristics embedded in four processors, packed to form different portfolios. Four basic algorithms- Genetic Algorithm (GA), Simulated Annealing (SA), Tabu Search (TS) and Artificial Immune System (AIS), as well as their group theoretic counterparts have been utilized. The proposed approach also takes care of platform dependence and helps evolving a robust solution pack. The …

An Integer Programming Approach To Support The Us Air Force’S Air Mobility Network, Corbin G. Koepke, Andrew P. Armacost, Cynthia Barnhart, Stephan E. Kolitz

United States Air Force: Publications

The United States Air Force’s air mobility command is responsible for creating a schedule and executing that schedule for a large-scale air mobility network that encompasses aircraft with prioritized missions. Aerial ports (airports) can process or park a maximum number of aircraft, called the maximum on ground (MOG). As the schedule changes due to disruptions, such as equipment failure or weather, the MOG constraint can cause the new schedule to be infeasible. Traditionally, re-planning the channel route schedule to adhere to MOG constraints has been a manual process that usually stops after the first feasible set of changes is found, …