Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

PDF

2006

Scheduling

Discipline
Institution
Publication
Publication Type

Articles 1 - 17 of 17

Full-Text Articles in Entire DC Network

Minimizing The Makespan In A Two-Stage Flowshop Scheduling Problem With A Function Constraint On Alternative Machines, Chou-Jung Hsu, Wen-Hung Kuo, Dar-Li Yang, Maw-Sheng Chern Sep 2006

Minimizing The Makespan In A Two-Stage Flowshop Scheduling Problem With A Function Constraint On Alternative Machines, Chou-Jung Hsu, Wen-Hung Kuo, Dar-Li Yang, Maw-Sheng Chern

Journal of Marine Science and Technology

In this paper, we consider a two-stage flowshop scheduling problem with a function constraint on alternative machines. The objective is to minimize the makespan. We show that the proposed problem is NP-hard and provide some heuristic algorithms and computational experiments. In addition, from the experimental results, the modification of Johnson’s rule combined with the First-Fit rule is the best heuristic algorithm of the proposed heuristic algorithms.

Go to article

Tabu Search For Optimization Of Military Supply Distribution, Ben Weber, Brett Bojduj, Jens G. Pohl Aug 2006

Tabu Search For Optimization Of Military Supply Distribution, Ben Weber, Brett Bojduj, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

The dynamic and non-hierarchical nature of the military domain presents a challenge for traditional supply chain optimization. Flow networks and simulation techniques have been applied to the military distribution problem, but are unable to provide time-definite delivery to customers. Recently, optimization approaches have been independently applied towards strategic and operational levels of planning. However, decomposing military distribution into separate problems forces optimization techniques to utilize imprecise data. The size of the military distribution problem has prevented optimization techniques from providing end-to-end planning capabilities. This paper presents a Tabu Search algorithm for simultaneously solving strategic and operational levels of planning. The …

Go to article

An Energy-Efficient And Access Latency Optimized Indexing Scheme For Wireless Data Broadcast, Yuxia Yao, Xueyan Tang, Ee Peng Lim, Aixin Sun Aug 2006

An Energy-Efficient And Access Latency Optimized Indexing Scheme For Wireless Data Broadcast, Yuxia Yao, Xueyan Tang, Ee Peng Lim, Aixin Sun

Research Collection School Of Computing and Information Systems

Data broadcast is an attractive data dissemination method in mobile environments. To improve energy efficiency, existing air indexing schemes for data broadcast have focused on reducing tuning time only, i.e., the duration that a mobile client stays active in data accesses. On the other hand, existing broadcast scheduling schemes have aimed at reducing access latency through nonflat data broadcast to improve responsiveness only. Not much work has addressed the energy efficiency and responsiveness issues concurrently. This paper proposes an energy-efficient indexing scheme called MHash that optimizes tuning time and access latency in an integrated fashion. MHash reduces tuning time by …

Go to article

High Performance Queueing And Scheduling In Support Of Multicasting In Input-Queued Switches, Weiying Zhu Jul 2006

High Performance Queueing And Scheduling In Support Of Multicasting In Input-Queued Switches, Weiying Zhu

Electrical & Computer Engineering Theses & Dissertations

Due to its mild requirement on the bandwidth of switching fabric and internal memory, the input-queued architecture is a practical solution for today's very high-speed switches. One of the notoriously difficult problems in the design of input-queued switches with very high link rates is the high performance queueing and scheduling of multicast traffic. This dissertation focuses on proposing novel solutions for this problem. The design challenge stems from the nature of multicast traffic, i.e., a multicast packet typically has multiple destinations. On the one hand, this nature makes queueing and scheduling of multicast traffic much more difficult than that of …

Go to article

Use And Effectiveness Of Contract Schedule Incentives In Air Force Materiel Command, Rodrick A. Koch Jun 2006

Use And Effectiveness Of Contract Schedule Incentives In Air Force Materiel Command, Rodrick A. Koch

Theses and Dissertations

Are contract schedule incentives utilized by our acquisition contracting workforce, and if so what are their effectiveness? This research shows there is not widespread use of these types of incentives. There is also disagreement on their perceived effectiveness. Surveying, via email, the population of contracting officers and buyers within Air Force Materiel Command yielded responses from every center and many large acquisition systems. Only 8.5% of responses showed that they use schedule incentives. These respondents claim that schedule incentives are somewhat effective, yet of the 91.5 % that have not used them, 2-to-l say they would not be effective. The …

Go to article

Mabs: Spreadsheet– Based Decision Support For Precision Marketing, Bert De Reyck, Zeger Degraeve Jun 2006

Mabs: Spreadsheet– Based Decision Support For Precision Marketing, Bert De Reyck, Zeger Degraeve

Research Collection Lee Kong Chian School Of Business

In this paper, we describe a decision support system developed for automatically scheduling and optimising broadcasts of advertisements to mobile phones via SMS (Short Message Service) text messaging. The system, MABS or “Mobile Advertising Broadcast Scheduler”, is developed in Microsoft Excel with a link to Lingo, a modelling language and IP solver. It was developed for a London-based company specialized in location-sensitive precision marketing via mobile phones. The system significantly reduced the time required to schedule the broadcasts, and resulted both in increased customer response and revenues.

Go to article

Data Analysis And Its Impact On Predicting Schedule & Cost Risk, Steven M. Cross Mar 2006

Data Analysis And Its Impact On Predicting Schedule & Cost Risk, Steven M. Cross

Theses and Dissertations

Many databases rely on documents (research) of the past to input data to create a comprehensive database. The Selected Acquisition Report (SAR) is one such document. The SARs are pervasive documents that have undergone decades of scrutiny by Congress and watchdog organizations such as the Government Accountability Office. Since the SAR has undergone such massive evolutionary changes, creating an accurate acquisition database presents a daunting task for the analyst and researcher alike. This research concerns itself with one such database. From this prior research database, we look to fill in missing data. We first conduct a literature review to determine …

Go to article

Improving Intercontinental Ballistic Missile Maintenance Scheduling Through The Use Of Location Analysis Methodologies, Dale L. Overholts Ii Mar 2006

Improving Intercontinental Ballistic Missile Maintenance Scheduling Through The Use Of Location Analysis Methodologies, Dale L. Overholts Ii

Theses and Dissertations

The events of September 11, 2001 have led to increased security requirements for all ICBM-related activities. Missile maintenance managers must explore new scheduling techniques to sustain weapon system readiness levels in light of published security enhancements. The problem of improving missile maintenance scheduling is modeled as a two-stage heuristic that utilizes the maximal covering location problem methodology. Maintenance activities are categorized and weighted according to published priority designation and mission impact. The model’s first stage seeks to select two security umbrellas that maximize the weighted sum of maintenance activities. Stage two seeks to determine a maintenance schedule comprised of launch …

Go to article

Distributed Approaches For Exploiting Multiuser Diversity In Wireless Networks, Xiangping Qin, Randall A. Berry Feb 2006

Distributed Approaches For Exploiting Multiuser Diversity In Wireless Networks, Xiangping Qin, Randall A. Berry

Articles

In wireless fading channels, multiuser diversity can be exploited by scheduling users to transmit when their channel conditions are favorable. This leads to a sum throughput that increases with the number of users and, in certain cases, achieves capacity. However, such scheduling requires global knowledge of every user’s channel gain, which may be difficult to obtain in some situations. This paper addresses contention-based protocols for exploiting multiuser diversity with only local channel knowledge. A variation of the ALOHA protocol is given in which users attempt to exploit multiuser diversity gains, but suffer contention losses due to the distributed channel knowledge. …

Go to article

Allocating Non-Real-Time And Soft Real-Time Jobs In Multiclusters, Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Hong Jiang, Donna N. Dillenberger, Graham R. Nudd Feb 2006

Allocating Non-Real-Time And Soft Real-Time Jobs In Multiclusters, Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Hong Jiang, Donna N. Dillenberger, Graham R. Nudd

School of Computing: Faculty Publications

This paper addresses workload allocation techniques for two types of sequential jobs that might be found in multicluster systems, namely, non-real-time jobs and soft real-time jobs. Two workload allocation strategies, the Optimized mean Response Time (ORT) and the Optimized mean Miss Rate (OMR), are developed by establishing and numerically solving two optimization equation sets. The ORT strategy achieves an optimized mean response time for non-real-time jobs, while the OMR strategy obtains an optimized mean miss rate for soft real-time jobs over multiple clusters. Both strategies take into account average system behaviors (such as the mean arrival rate of jobs) in …

Go to article

Efficient Job Scheduling For A Cellular Manufacturing Environment, Joshua Dennie Jan 2006

Efficient Job Scheduling For A Cellular Manufacturing Environment, Joshua Dennie

Theses

An important aspect of any manufacturing environment is efficient job scheduling. With an increase in manufacturing facilities focused on producing goods with a cellular manufacturing approach, the need arises to schedule jobs optimally into cells at a specific time. A mathematical model has been developed to represent a standard cellular manufacturing job scheduling problem. The model incorporates important parameters of the jobs and the cells along with other system constraints. With each job and each cell having its own distinguishing parameters, the task of scheduling jobs via integer linear programming quickly becomes very difficult and time-consuming. In fact, such a …

Go to article

Generic Scheduling Framework And Algorithm For Time-Varying Wireless Networks, Gengfa Fang, Yi Sun, Jihua Zhou, Jinglin Shi, Eryk Dutkiewicz Jan 2006

Generic Scheduling Framework And Algorithm For Time-Varying Wireless Networks, Gengfa Fang, Yi Sun, Jihua Zhou, Jinglin Shi, Eryk Dutkiewicz

Faculty of Informatics - Papers (Archive)

In this paper, the problem of scheduling multiple users sharing a time varying wireless channel is studied, in networks such as in 3G CDMA and IEEE 802.16. We propose a new generic wireless packet scheduling framework (WPSF), which takes into account not only the quality of service (QoS) requirements but also the wireless resource consumed. The framework is generic in the sense that it can be used with different resource constraints and QoS requirements depending on the traffic flow types. Subsequently, based on this framework a minimum rate and channel aware (MRCA) scheduling algorithm is presented. MRCA attempts to greedily …

Go to article

Improving Mobile Station Energy Efficiency In Ieee 802.16e Wman By Burst Scheduling, Jinglin Shi, Gengfa Fang, Yi Sun, Jihua Zhou, Zhongcheng Li, Eryk Dutkiewicz Jan 2006

Improving Mobile Station Energy Efficiency In Ieee 802.16e Wman By Burst Scheduling, Jinglin Shi, Gengfa Fang, Yi Sun, Jihua Zhou, Zhongcheng Li, Eryk Dutkiewicz

Faculty of Informatics - Papers (Archive)

In this paper, we tackle the packet scheduling problem in IEEE 802.16e wireless metropolitan area network (WMAN), where the Sleep Mode is applied to save energy of mobile stations (MSs). Our objective is to design an energy efficient scheduling policy which works closely with the sleep mode mechanism so as to maximize battery lifetime in MSs. To the best of our knowledge no power saving scheduling algorithms based on sleep mode defined in IEEE 802.16e have been proposed so far in the literature. We propose a longest virtual burst first (LVBF) scheduling algorithm which schedules packets of MSs in a …

Go to article

A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem Jan 2006

A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem

Engineering Management & Systems Engineering Faculty Publications

In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequence- and machine- dependent setup times to minimize the schedules makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm uses two phases of perturbation schemes: the intra-machine perturbation, which optimizes the sequence of jobs on the machines, and the inter-machine perturbation, which balances the assignment of the jobs to the machines. We compare the proposed algorithm to an existing one that addressed the …

Go to article

Faculty Scheduling Using Genetic Algorithms, Kevin Soule Jan 2006

Faculty Scheduling Using Genetic Algorithms, Kevin Soule

Theses

The problem of developing a class schedule for a faculty has been proven to be NP-complete. Therefore when the schedule is large enough, finding just one feasible solution can be impossible for any direct search algorithm within a reasonable time. This project is geared toward investigating the possibility of using genetic-based algorithms to solve faculty scheduling problems of 100 courses or larger quickly. Multiple versions of genetic algorithms and heuristics are tested. Many parameter levels for these algorithms are optimized for fastest convergence.

Go to article

A Dynamic Web Server Based Appointment Calendar, Jane Zhong Jan 2006

A Dynamic Web Server Based Appointment Calendar, Jane Zhong

Theses

The most advanced server side technology, Microsoft .NET Framework and Microsoft SQL, will be used to develop a dynamic web server based calendar to handle appointment and meeting scheduling. It s a new calendar in architecture and functions compared to the traditional calendars. The existing commercial calendars, such as Outlook calendar, iCal and MeetingMaker, have a common weakness: unique calendar software should be installed in the user s computer. They are all not web based calendars. Some existing web calendars, like Yahoo calendar, have very limited functions. In this proposal, a web server based calendar is proposed to overcome this …

Go to article

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

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 …

Go to article