Digital Commons Network^™

Scheduling And Sequencing Arrivals To A Stochastic Service System, Peter M. Vanden Bosch

Theses and Dissertations

Optimization of scheduled arrival times to an appointment system is approached from the perspectives of both queueing and scheduling theory. The appointment system is modeled as a one-server, first-come-first-served, transient queue with independent, distinctly distributed service times and no-show rates. If a customer does show, it is assumed to be punctual. The cost of operating the appointment system is a convex combination of customers' waiting times and the server's overtime. While techniques for finding the optimal static and dynamic schedules of arrivals have been proposed by other researchers, they mainly have focused on identical customers and strictly punctual arrivals. This …

Task Scheduling In Networks, Cynthia Phillips, Clifford Stein, Joel Wein

Dartmouth Scholarship

Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous. In this paper we remove this assumption and study the problem of network scheduling, where each job originates at some node of a network, and in order to be processed at another node must take the time to travel through the network to that node.

Our main contribution is to give approximation algorithms …

A Parallel Genetic-Neuro Scheduler For Job-Shop Scheduling Problems, H. C. Lee, Cihan H. Dagli

Engineering Management and Systems Engineering Faculty Research & Creative Works

Despite relentless efforts on developing new approaches, there are still large gaps between schedules generated through various planning systems, and schedules actually used in the shop floor environment. An effective schedule generation is a knowledge intensive activity requiring a comprehensive model of a factory and its environment at all times. There are four main difficulties that need to be addressed. First, job shop scheduling belongs to a class of NP-hard problems. Second, it is a highly constrained problem that changes from shop to shop. Third, scheduling decisions depend upon other decisions which are not isolated from other functions. Thus, it …

On Cvt Minimization In Single Machine Scheduling., D. K. Manna Dr.

Doctoral Theses

Scheduling problens are quite common in real life. They arise whenever there is a need to plan execution of various tasks over time and therefore they play very important roles in commercial set-ups concerning manufacturing or service in the optimal use of resources and/or customers satisfaction. The theory of scheduling deals with the construction of suitable models and their analyses. Researchersattention was drawn to the study of scheduling problems using mathematical modeling, probably for the first time when Johnson (1954] published his famous work on flowshop problem. Since then, the study of scheduling problem and its context has gradually attracted …

Short-Term Resource Scheduling With Ramp Constraints [Power Generation Scheduling], Chung-Li Tseng, Chao-An Li, A. J. Svoboda, R. B. Johnson

Engineering Management and Systems Engineering Faculty Research & Creative Works

This paper describes a Lagrangian relaxation-based method to solve the short-term resource scheduling (STRS) problem with ramp constraints. Instead of discretizing the generation levels, the ramp rate constraints are relaxed with the system demand constraints using Lagrange multipliers. Three kinds of ramp constraints, startup, operating and shutdown ramp constraints are considered. The proposed method has been applied to solve the hydro-thermal generation scheduling problem at PG&E. An example alone with numerical results is also presented

G97-1324 Beef Cattle Implant Update, Dicky D. Griffin, Terry L. Mader

University of Nebraska-Lincoln Extension: Historical Materials

This NebGuide discusses the mechanism of action and use strategies for growth promoting implants, including expected responses and cost analysis.

Introduction

Growth promoting implants have been used extensively in beef production for over 30 years. Significant changes in implants and implanting strategies have occurred. Prior to 1987, available implants were estrogenic agents which metabolically enhanced nutrient use to enhance growth. These products improved feed efficiency 5-10 percent and daily gains from 5-15 percent. In 1987, the androgenic (tissue building) agent, trenbolone acetate, was approved for use in growth promoting implants. This compound had an additive effect with existing estrogenic implants. …

A Simulation Analysis Of The Impact Of Family Configuration On Virtual Cellular Manufacturing, Vijay R. Kannan

Management Faculty Publications

Past research has shown that it is possible to simultaneously achieve the setup efficiencies of traditional cellular manufacturing systems and the routeing flexibility of a job shop by viewing cells not as permanent, physical structures, but as temporary, 'virtual' entities. This research demonstrates that the advantages of virtual manufacturing cells can be obtained over a range of part family configurations. In particular, virtual cellular manufacturing is robust to changes in the number and size of families being processed. Further, the research shows that the benefits can be obtained under setup conditions impartial to a family-oriented part environment.