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

Digital Commons Network™

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

PDF

Journal

Scheduling

Discipline
Institution
Publication Year
Publication

Articles 31 - 46 of 46

Full-Text Articles in Entire DC Network

Modeling And Resource Scheduling Of Real-Time Unsplittable Data Transfers, Mustafa Müjdat Atanak, Atakan Doğan, Mustafa Bayram Mar 2015

Modeling And Resource Scheduling Of Real-Time Unsplittable Data Transfers, Mustafa Müjdat Atanak, Atakan Doğan, Mustafa Bayram

Applied Mathematics & Information Sciences

Real-time communication where the timely delivery of the data transfer requests needs to be guaranteed is essential for several applications. This work formally introduces the Real-Time Unsplittable Data Dissemination Problem (RTU/DDP), which is a generalization of the unsplittable flow problem. RTU/DDP problem is proved to be NP-hard. Therefore, heuristic approaches are required to acquire good solutions to the problem. The problem is divided into two sub-problems: path selection and request packing. Each of these sub-problems is formally defined and heuristic algorithms are proposed for both sub-problems. MinMin/FPF, Edge Disjoint MinMin/FPF, MinCon/FPF, and LFL-MinCon/FPF heuristics are proposed for the path selection …

Go to article

An Exact And Meta-Heuristic Approach For Two-Agent Single-Machine Scheduling Problem, Wen-Hung Wu Apr 2013

An Exact And Meta-Heuristic Approach For Two-Agent Single-Machine Scheduling Problem, Wen-Hung Wu

Journal of Marine Science and Technology

In many real-life applications, it can be often found that multiple agents compete on the usage of a common processing resource in different application environments and different methodological fields, such as artificial intelligence, decision theory, operations research, etc. Moreover, scheduling with multiple agents is relatively unexplored. Based on this observation, this paper attempts to study a single-machine scheduling problem where the objective is to minimize the total tardiness of the first agent with the constraint that no tardy job is allowed for the second agent. In this study, we provide a branch-and-bound algorithm and a genetic algorithm for the optimal …

Go to article

Cada: Channel And Delay Aware Scheduler For Real-Time Applications In Wimax Networks, Melek Oktay, Haci Ali̇ Mantar Jan 2013

Cada: Channel And Delay Aware Scheduler For Real-Time Applications In Wimax Networks, Melek Oktay, Haci Ali̇ Mantar

Turkish Journal of Electrical Engineering and Computer Sciences

Scheduling is the core of the worldwide interoperability for microwave access (WiMAX) technology that directly affects the performance of the network. In this study, we focus on scheduling and present a novel algorithm called the channel and delay aware scheduler (CADA) for real-time applications, such as voice over Internet protocol, video-on-demand, and video streaming. CADA has 2 important modules: wireless and network delay monitoring tools. The wireless module, including the compensation and channel state monitoring modules, increases the network throughput and provides fairness among all of the flows in the network. The network delay monitoring tool calculates the estimated network …

Go to article

The Four-Day School Week: Impact On Student Academic Performance, Paul M. Hewitt, George S. Denny Mar 2012

The Four-Day School Week: Impact On Student Academic Performance, Paul M. Hewitt, George S. Denny

The Rural Educator

Although the four-day school week originated in 1936, it was not widely implemented until 1973 when there was a need to conserve energy and reduce operating costs. This study investigated how achievement tests scores of schools with a four-day school week compared with schools with a traditional five-day school week. The study focused on student performance in Colorado where 62 school districts operated a four-day school week. The results of the Colorado Student Assessment Program (CSAP) were utilized to examine student performance in reading, writing, and mathematics in grades 3 through 10. While the mean test scores for five-day week …

Go to article

Due-Date Assignment And Optional Maintenance Activity Scheduling Problem With Linear Deterioreting Jobs, Chou-Jung Hsu, Suh-Jenq Yang, Dar-Li Yang Feb 2011

Due-Date Assignment And Optional Maintenance Activity Scheduling Problem With Linear Deterioreting Jobs, Chou-Jung Hsu, Suh-Jenq Yang, Dar-Li Yang

Journal of Marine Science and Technology

The focus of this work is to analyze linear deteriorating jobs in a single-machine scheduling problem with due-date assignment and maintenance activity. The linear deteriorating jobs means its processing time is an increasing function of their starting time. The objective is to minimize the total of earliness, tardiness and due-date cost. To solve the scheduling problem addressed in this work, we have to determine the job sequence, the common due-date, and the location of a maintenance activity. We show that the problem can be solved optimally in O(n2 log n) time.

Go to article

Civil Practice And Procedure, John R. Walk, Andrew P. Sherrod Nov 2010

Civil Practice And Procedure, John R. Walk, Andrew P. Sherrod

University of Richmond Law Review

This article surveys recent significant developments in Virginia civil practice and procedure. Specifically, the article discusses opinions of the Supreme Court of Virginia from June 2009 through April 2010 addressing civil procedure; significant amendments to the Rules of the Supreme Court of Virginia made during the same period; and legislation enacted by the Virginia GeneralAssembly during its 2010 session relating to civil practice.

Go to article

Behaviors Of Real-Time Schedulers Under Resource Modification And A Steady Scheme With Bounded Utilization, Refi̇k Samet, Orhan Fi̇kret Duman Jan 2010

Behaviors Of Real-Time Schedulers Under Resource Modification And A Steady Scheme With Bounded Utilization, Refi̇k Samet, Orhan Fi̇kret Duman

Turkish Journal of Electrical Engineering and Computer Sciences

In this article we present an analysis for task models having random resource needs and different arrival patterns. In hard real-time environments like avionic systems or nuclear reactors, the inputs to the system are obtained from real world by using sensors. And it is highly possible for a task to have different resource needs for each period according to these changing conditions of real world. We made an analysis of schedulers for task models having random resources in each period. Since feasibility tests for usual task models are just limited to some specific schedulers and arrival patterns, we made our …

Go to article

Performance Comparison Of New Heuristic With Genetic Algorithm In Parallel Flow Line Set Up, K. Balasubramanian, A. Noorul Haq, N. Rajeswari May 2008

Performance Comparison Of New Heuristic With Genetic Algorithm In Parallel Flow Line Set Up, K. Balasubramanian, A. Noorul Haq, N. Rajeswari

International Journal of Applied Management and Technology

A new heuristic has been developed to solve the problem in parallel flow line scheduling. It involves the minimization of the makespan by the optimal allocation of a finite number of jobs to finite number of lines in the first phase and the optimal sequencing of allocated jobs in each line in the second phase. Here new heuristic and genetic algorithm for analyzing the parallel flow line scheduling are discussed and executed on a set of randomly generated problems. The results obtained for the test problems suggest that the developed new heuristic can be used successfully to solve large scale …

Go to article

Ant Colony Optimization For Multilevel Assembly Job Shop Scheduling, M. Omkumar, P. Shahabudeen May 2008

Ant Colony Optimization For Multilevel Assembly Job Shop Scheduling, M. Omkumar, P. Shahabudeen

International Journal of Applied Management and Technology

Job shop scheduling is one of the most explored areas in the last few decades. Although it is very commonly witnessed in real-life situations, very less investigation has been carried out in scheduling operations of multi-level jobs, which undergo serial, parallel, and assembly operations in an assembly job shop. In this work, some of the dispatch rules, which have best performances in scheduling multilevel jobs in dynamic assembly job shop, are tested in static assembly job shop environment. A new optimization heuristic based on Ant Colony Algorithm is proposed and its performance is compared with the dispatch rules.

Go to article

Optimal Scheduling Models For Ferry Companies Under Alliances, Shangyao Yan, Chia-Hung Chen, Hsin-Yen Chen, Tze-Chiang Lou Feb 2007

Optimal Scheduling Models For Ferry Companies Under Alliances, Shangyao Yan, Chia-Hung Chen, Hsin-Yen Chen, Tze-Chiang Lou

Journal of Marine Science and Technology

Ferry companies in Taiwan increasingly ally themselves with other ferry companies as a means of forming more complete networks, to operate more efficiently. The more complex ferry fleet routing and scheduling processes are not only important in each company’s operations, but also have a bearing on the alliance. In this research, we employ network flow techniques to construct several coordinated scheduling models to help solve for the most satisfactory schedules for the allied ferry companies. Finally, we perform a case study based on real operating data from two Taiwan ferry companies to evaluate the models. The preliminary results show that …

Go to article

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

Application Of Tabu Search Algorithm In Job Shop Scheduling, Betrianis Betrianis, Putu Teguh Aryawan Dec 2003

Application Of Tabu Search Algorithm In Job Shop Scheduling, Betrianis Betrianis, Putu Teguh Aryawan

Makara Journal of Technology

Application of Tabu Search Algorithm in Job Shop Scheduling. Tabu Search is one of local search methods which is used to solve the combinatorial optimization problem. This method aimed is to make the searching process of the best solution in a complex combinatorial optimization problem(np hard), ex : job shop scheduling problem, became more effective, in a less computational time but with no guarantee to optimum solution.In this paper, tabu search is used to solve the job shop scheduling problem consists of 3 (three) cases, which is ordering package of September, October and November with objective of minimizing makespan (Cmax). …

Go to article

Optimizing A Law School’S Course Schedule, Shelley Saxer, Gary M. Thompson May 2003

Optimizing A Law School’S Course Schedule, Shelley Saxer, Gary M. Thompson

The University of New Hampshire Law Review

[Excerpt] “Just like other educational institutions, law schools must schedule courses by taking into consideration student needs, faculty resources, and logistical support such as classroom size and equipment needs. Course scheduling is an administrative function, typically handled by an Assistant Dean or an Associate Dean, who works with the faculty and the registrar to balance these considerations in advance of the registration process. Usually, the entire academic year is scheduled in advance, although the spring semester may be labeled tentative until registration begins for that semester. It’s hard to imagine, but some schools even publish a two-year schedule of upper-division …

Go to article

Irrigation Scheduling Of Drip-Irrigated Tomatoes Using Class A Pan Evaporation, Öner Çeti̇n, Osman Yildirim, Demet Uygan, Hasan Boyaci Jan 2002

Irrigation Scheduling Of Drip-Irrigated Tomatoes Using Class A Pan Evaporation, Öner Çeti̇n, Osman Yildirim, Demet Uygan, Hasan Boyaci

Turkish Journal of Agriculture and Forestry

This study was carried out to investigate the irrigation schedule of drip-irrigated tomatoes (Lycopersicon esculentum cv. Dual Large, F 1) using Class A pan evaporation. Tomatoes plants were grown in a clay soil in the experimental fields of the Research Institute of Rural Services in Eskişehir between 1998 and 2000. Irrigation water was applied as a certain ratio of Class A pan evaporation (k_{pc} = 0.50, 0.75, 1.00, and 1.25) with different irrigation intervals (2, 4, and 6 days). Significant differences in fruit yields were obtained between the treatments, except for in 1998. Maximum marketable fruit yield was found at …

Go to article

Application Of A Pert-Type System And "Crashing" In A Food Service Operation, Glenn A. Leitch Jan 1989

Application Of A Pert-Type System And "Crashing" In A Food Service Operation, Glenn A. Leitch

Hospitality Review

A pert-type system, a combination of the program evaluation and review technique (PERT) and the critical path method (CPM), might be used by the hospitality industry to improve planning and control of complex functions. The author discusses this management science technique and how it can assist.

Go to article

Labor Cost Analysis For The Food Service Industry, Steven V. Moll Jan 1983

Labor Cost Analysis For The Food Service Industry, Steven V. Moll

Hospitality Review

There are many factors which can assist in controlling the cost of labor in the food service industry. The author discusses a number of these, including scheduling, establishing production standards, forecasting workloads, analyzing employee turnover, combating absenteeism, and controlling overtime.

Go to article

First Prev