Coordinating, Scheduling, Processing and Analyzing IYA09
NASA Technical Reports Server (NTRS)
Gipson, John; Behrend, Dirk; Gordon, David; Himwich, Ed; MacMillan, Dan; Titus, Mike; Corey, Brian
2010-01-01
The IVS scheduled a special astrometric VLBI session for the International Year of Astronomy 2009 (IYA09) commemorating 400 years of optical astronomy and 40 years of VLBI. The IYA09 session is the most ambitious geodetic session to date in terms of network size, number of sources, and number of observations. We describe the process of designing, coordinating, scheduling, pre-session station checkout, correlating, and analyzing this session.
The Microchp Scheduling Problem
NASA Astrophysics Data System (ADS)
Bosman, M. G. C.; Bakker, V.; Molderink, A.; Hurink, J. L.; Smit, G. J. M.
2009-08-01
The increasing penetration of renewable energy sources, the demand for more energy efficient electricity production and the increase in distributed electricity generation causes a shift in the way electricity is produced and consumed. The downside of these changes in the electricity grid is that network stability and controllability becomes more difficult compared to the old situation. The new network has to accommodate various means of production, consumption and buffering and needs to offer control over the energy flows between these three elements. In order to offer such a control mechanism we need to know more about the individual aspects. In this paper we focus on the modelling of distributed production. Especially we look at the use of microCHP (Combined Heat and Power) appliances in a group of houses. The problem of planning the production runs of the microCHP is modelled via an ILP formulation both for a single house and for a group of houses.
Coordinated Science Campaign Scheduling for Sensor Webs
NASA Technical Reports Server (NTRS)
Edgington, Will; Morris, Robert; Dungan, Jennifer; Williams, Jenny; Carlson, Jean; Fleming, Damian; Wood, Terri; Yorke-Smith, Neil
2005-01-01
Future Earth observing missions will study different aspects and interacting pieces of the Earth's eco-system. Scientists are designing increasingly complex, interdisciplinary campaigns to exploit the diverse capabilities of multiple Earth sensing assets. In addition, spacecraft platforms are being configured into clusters, trains, or other distributed organizations in order to improve either the quality or the coverage of observations. These simultaneous advances in the design of science campaigns and in the missions that will provide the sensing resources to support them offer new challenges in the coordination of data and operations that are not addressed by current practice. For example, the scheduling of scientific observations for satellites in low Earth orbit is currently conducted independently by each mission operations center. An absence of an information infrastructure to enable the scheduling of coordinated observations involving multiple sensors makes it difficult to execute campaigns involving multiple assets. This paper proposes a software architecture and describes a prototype system called DESOPS (Distributed Earth Science Observation Planning and Scheduling) that will address this deficiency.
32 CFR 644.395 - Coordination on disposal problems.
Code of Federal Regulations, 2010 CFR
2010-07-01
... 32 National Defense 4 2010-07-01 2010-07-01 true Coordination on disposal problems. 644.395... PROPERTY REAL ESTATE HANDBOOK Disposal Predisposal Action § 644.395 Coordination on disposal problems. If any major change or problem requires a significant revision in the time schedule for disposal,...
32 CFR 644.395 - Coordination on disposal problems.
Code of Federal Regulations, 2011 CFR
2011-07-01
... 32 National Defense 4 2011-07-01 2011-07-01 false Coordination on disposal problems. 644.395... PROPERTY REAL ESTATE HANDBOOK Disposal Predisposal Action § 644.395 Coordination on disposal problems. If any major change or problem requires a significant revision in the time schedule for disposal,...
Integrated network design and scheduling problems :
Nurre, Sarah G.; Carlson, Jeffrey J.
2014-01-01
We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.
Group scheduling problems in directional sensor networks
NASA Astrophysics Data System (ADS)
Singh, Alok; Rossi, André
2015-12-01
This article addresses the problem of scheduling a set of groups of directional sensors arising as a result of applying an exact or a heuristic approach for solving a problem involving directional sensors. The problem seeks a schedule for these groups that minimizes the total energy consumed in switching from one group to the next group in the schedule. In practice, when switching from a group to the next one, active sensors in the new group have to rotate in order to face their working direction. These rotations consume energy, and the problem is to schedule the groups so as to minimize the total amount of energy consumed by all the sensor rotations, knowing the initial angular positions of all the sensors. In this article, it is assumed that energy consumption is proportional to the angular movement for all the sensors. Another problem version is also investigated that seeks to minimize the total time during which the sensor network cannot cover all the targets because active sensors are rotating. Both problems are proved to be ?-hard, and a lower bound for the first problem is presented. A greedy heuristic and a genetic algorithm are also proposed for addressing the problem of minimizing total rotation in the general case. Finally, a local search is also proposed to improve the solutions obtained through a genetic algorithm.
Coordinated Transportation: Problems and Promise?
ERIC Educational Resources Information Center
Fickes, Michael
1998-01-01
Examines the legal, administrative, and logistical barriers that have prevented the wide acceptance of coordinating community and school transportation services and why these barriers may be breaking down. Two examples of successful implementation of coordinated transportation are examined: employing a single system to serve all transportation…
Fuzzy coordinator in control problems
NASA Technical Reports Server (NTRS)
Rueda, A.; Pedrycz, W.
1992-01-01
In this paper a hierarchical control structure using a fuzzy system for coordination of the control actions is studied. The architecture involves two levels of control: a coordination level and an execution level. Numerical experiments will be utilized to illustrate the behavior of the controller when it is applied to a nonlinear plant.
Separation Assurance and Scheduling Coordination in the Arrival Environment
NASA Technical Reports Server (NTRS)
Aweiss, Arwa S.; Cone, Andrew C.; Holladay, Joshua J.; Munoz, Epifanio; Lewis, Timothy A.
2016-01-01
Separation assurance (SA) automation has been proposed as either a ground-based or airborne paradigm. The arrival environment is complex because aircraft are being sequenced and spaced to the arrival fix. This paper examines the effect of the allocation of the SA and scheduling functions on the performance of the system. Two coordination configurations between an SA and an arrival management system are tested using both ground and airborne implementations. All configurations have a conflict detection and resolution (CD&R) system and either an integrated or separated scheduler. Performance metrics are presented for the ground and airborne systems based on arrival traffic headed to Dallas/ Fort Worth International airport. The total delay, time-spacing conformance, and schedule conformance are used to measure efficiency. The goal of the analysis is to use the metrics to identify performance differences between the configurations that are based on different function allocations. A surveillance range limitation of 100 nmi and a time delay for sharing updated trajectory intent of 30 seconds were implemented for the airborne system. Overall, these results indicate that the surveillance range and the sharing of trajectories and aircraft schedules are important factors in determining the efficiency of an airborne arrival management system. These parameters are not relevant to the ground-based system as modeled for this study because it has instantaneous access to all aircraft trajectories and intent. Creating a schedule external to the CD&R and the scheduling conformance system was seen to reduce total delays for the airborne system, and had a minor effect on the ground-based system. The effect of an external scheduler on other metrics was mixed.
Optimal pre-scheduling of problem remappings
NASA Technical Reports Server (NTRS)
Nicol, David M.; Saltz, Joel H.
1987-01-01
A large class of scientific computational problems can be characterized as a sequence of steps where a significant amount of computation occurs each step, but the work performed at each step is not necessarily identical. Two good examples of this type of computation are: (1) regridding methods which change the problem discretization during the course of the computation, and (2) methods for solving sparse triangular systems of linear equations. Recent work has investigated a means of mapping such computations onto parallel processors; the method defines a family of static mappings with differing degrees of importance placed on the conflicting goals of good load balance and low communication/synchronization overhead. The performance tradeoffs are controllable by adjusting the parameters of the mapping method. To achieve good performance it may be necessary to dynamically change these parameters at run-time, but such changes can impose additional costs. If the computation's behavior can be determined prior to its execution, it can be possible to construct an optimal parameter schedule using a low-order-polynomial-time dynamic programming algorithm. Since the latter can be expensive, the performance is studied of the effect of a linear-time scheduling heuristic on one of the model problems, and it is shown to be effective and nearly optimal.
Coordinated scheduling for dynamic real-time systems
NASA Technical Reports Server (NTRS)
Natarajan, Swaminathan; Zhao, Wei
1994-01-01
In this project, we addressed issues in coordinated scheduling for dynamic real-time systems. In particular, we concentrated on design and implementation of a new distributed real-time system called R-Shell. The design objective of R-Shell is to provide computing support for space programs that have large, complex, fault-tolerant distributed real-time applications. In R-shell, the approach is based on the concept of scheduling agents, which reside in the application run-time environment, and are customized to provide just those resource management functions which are needed by the specific application. With this approach, we avoid the need for a sophisticated OS which provides a variety of generalized functionality, while still not burdening application programmers with heavy responsibility for resource management. In this report, we discuss the R-Shell approach, summarize the achievement of the project, and describe a preliminary prototype of R-Shell system.
Optimizing Center Performance through Coordinated Data Staging, Scheduling and Recovery
Zhang, Zhe; Wang, Chao; Vazhkudai, Sudharshan S; Ma, Xiaosong; Pike, Gregory; Cobb, John W; Mueller, Frank
2007-01-01
Procurement and optimized utilization of Petascale supercomputers and centers is a renewed national priority. Sustained performance and availability of such large centers is a key technical challenge significantly impacting their usability. As recent research shows, storage systems can be a primary fault source leading to unavailability of even today's supercomputer. Due to data unavailability, jobs are frequently resubmitted resulting in reduced compute center performance as well as in a lack of coordination between I/O activities and job scheduling. In this work, we explore two mechanisms, namely the coordination of job scheduling and data staging/offloading and on-demand job input data reconstruction to address the availability of job input/output data and to improve center-wide performance. Fundamental to both mechanisms is the efficient management of transient data: in the way it is scheduled and recovered. Collectively, from a center standpoint, these techniques optimize resource usage and increase its data/service availability. From a user job standpoint, they reduce job turnaround time and optimize the usage of allocated time. We have implemented our approaches within commonly used supercomputer software tools such as the PBS scheduler and the Lustre parallel file system. We have gathered reconstruction data from a production supercomputer environment using multiple data sources. We conducted simulations based on the measured data recovery performance, the job traces and staged data logs from leadership-class supercomputer centers. Our results indicate that the average waiting time of jobs is reduced. This trend increases significantly for larger jobs and also as data is striped over more I/O nodes.
NASA Technical Reports Server (NTRS)
Moore, J. E.
1975-01-01
An enumeration algorithm is presented for solving a scheduling problem similar to the single machine job shop problem with sequence dependent setup times. The scheduling problem differs from the job shop problem in two ways. First, its objective is to select an optimum subset of the available tasks to be performed during a fixed period of time. Secondly, each task scheduled is constrained to occur within its particular scheduling window. The algorithm is currently being used to develop typical observational timelines for a telescope that will be operated in earth orbit. Computational times associated with timeline development are presented.
48 CFR 536.570-9 - Shop drawings, coordination drawings, and schedules.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 48 Federal Acquisition Regulations System 4 2010-10-01 2010-10-01 false Shop drawings, coordination drawings, and schedules. 536.570-9 Section 536.570-9 Federal Acquisition Regulations System... CONTRACTS Contract Clauses 536.570-9 Shop drawings, coordination drawings, and schedules. Insert the...
48 CFR 536.570-9 - Shop drawings, coordination drawings, and schedules.
Code of Federal Regulations, 2013 CFR
2013-10-01
... 48 Federal Acquisition Regulations System 4 2013-10-01 2013-10-01 false Shop drawings, coordination drawings, and schedules. 536.570-9 Section 536.570-9 Federal Acquisition Regulations System... CONTRACTS Contract Clauses 536.570-9 Shop drawings, coordination drawings, and schedules. Insert the...
48 CFR 536.570-9 - Shop drawings, coordination drawings, and schedules.
Code of Federal Regulations, 2012 CFR
2012-10-01
... 48 Federal Acquisition Regulations System 4 2012-10-01 2012-10-01 false Shop drawings, coordination drawings, and schedules. 536.570-9 Section 536.570-9 Federal Acquisition Regulations System... CONTRACTS Contract Clauses 536.570-9 Shop drawings, coordination drawings, and schedules. Insert the...
48 CFR 552.236-78 - Shop Drawings, Coordination Drawings, and Schedules.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 48 Federal Acquisition Regulations System 4 2011-10-01 2011-10-01 false Shop Drawings, Coordination Drawings, and Schedules. 552.236-78 Section 552.236-78 Federal Acquisition Regulations System... Provisions and Clauses 552.236-78 Shop Drawings, Coordination Drawings, and Schedules. As prescribed in...
48 CFR 552.236-78 - Shop Drawings, Coordination Drawings, and Schedules.
Code of Federal Regulations, 2013 CFR
2013-10-01
... 48 Federal Acquisition Regulations System 4 2013-10-01 2013-10-01 false Shop Drawings, Coordination Drawings, and Schedules. 552.236-78 Section 552.236-78 Federal Acquisition Regulations System... Provisions and Clauses 552.236-78 Shop Drawings, Coordination Drawings, and Schedules. As prescribed in...
48 CFR 536.570-9 - Shop drawings, coordination drawings, and schedules.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 48 Federal Acquisition Regulations System 4 2011-10-01 2011-10-01 false Shop drawings, coordination drawings, and schedules. 536.570-9 Section 536.570-9 Federal Acquisition Regulations System... CONTRACTS Contract Clauses 536.570-9 Shop drawings, coordination drawings, and schedules. Insert the...
48 CFR 552.236-78 - Shop Drawings, Coordination Drawings, and Schedules.
Code of Federal Regulations, 2012 CFR
2012-10-01
... 48 Federal Acquisition Regulations System 4 2012-10-01 2012-10-01 false Shop Drawings, Coordination Drawings, and Schedules. 552.236-78 Section 552.236-78 Federal Acquisition Regulations System... Provisions and Clauses 552.236-78 Shop Drawings, Coordination Drawings, and Schedules. As prescribed in...
Job shop scheduling problem with late work criterion
NASA Astrophysics Data System (ADS)
Piroozfard, Hamed; Wong, Kuan Yew
2015-05-01
Scheduling is considered as a key task in many industries, such as project based scheduling, crew scheduling, flight scheduling, machine scheduling, etc. In the machine scheduling area, the job shop scheduling problems are considered to be important and highly complex, in which they are characterized as NP-hard. The job shop scheduling problems with late work criterion and non-preemptive jobs are addressed in this paper. Late work criterion is a fairly new objective function. It is a qualitative measure and concerns with late parts of the jobs, unlike classical objective functions that are quantitative measures. In this work, simulated annealing was presented to solve the scheduling problem. In addition, operation based representation was used to encode the solution, and a neighbourhood search structure was employed to search for the new solutions. The case studies are Lawrence instances that were taken from the Operations Research Library. Computational results of this probabilistic meta-heuristic algorithm were compared with a conventional genetic algorithm, and a conclusion was made based on the algorithm and problem.
AI techniques for a space application scheduling problem
NASA Technical Reports Server (NTRS)
Thalman, N.; Sparn, T.; Jaffres, L.; Gablehouse, D.; Judd, D.; Russell, C.
1991-01-01
Scheduling is a very complex optimization problem which can be categorized as an NP-complete problem. NP-complete problems are quite diverse, as are the algorithms used in searching for an optimal solution. In most cases, the best solutions that can be derived for these combinatorial explosive problems are near-optimal solutions. Due to the complexity of the scheduling problem, artificial intelligence (AI) can aid in solving these types of problems. Some of the factors are examined which make space application scheduling problems difficult and presents a fairly new AI-based technique called tabu search as applied to a real scheduling application. the specific problem is concerned with scheduling application. The specific problem is concerned with scheduling solar and stellar observations for the SOLar-STellar Irradiance Comparison Experiment (SOLSTICE) instrument in a constrained environment which produces minimum impact on the other instruments and maximizes target observation times. The SOLSTICE instrument will gly on-board the Upper Atmosphere Research Satellite (UARS) in 1991, and a similar instrument will fly on the earth observing system (Eos).
Handling Deafness Problem of Scheduled Multi-Channel Polling MACs
NASA Astrophysics Data System (ADS)
Jiang, Fulong; Liu, Hao; Shi, Longxing
Combining scheduled channel polling with channel diversity is a promising way for a MAC protocol to achieve high energy efficiency and performance under both light and heavy traffic conditions. However, the deafness problem may cancel out the benefit of channel diversity. In this paper, we first investigate the deafness problem of scheduled multi-channel polling MACs with experiments. Then we propose and evaluate two schemes to handle the deafness problem. Our experiment shows that deafness is a significant reason for performance degradation in scheduled multi-channel polling MACs. A proper scheme should be chosen depending on the traffic pattern and the design objective.
The application of artificial intelligence to astronomical scheduling problems
NASA Technical Reports Server (NTRS)
Johnston, Mark D.
1992-01-01
Efficient utilization of expensive space- and ground-based observatories is an important goal for the astronomical community; the cost of modern observing facilities is enormous, and the available observing time is much less than the demand from astronomers around the world. The complexity and variety of scheduling constraints and goals has led several groups to investigate how artificial intelligence (AI) techniques might help solve these kinds of problems. The earliest and most successful of these projects was started at Space Telescope Science Institute in 1987 and has led to the development of the Spike scheduling system to support the scheduling of Hubble Space Telescope (HST). The aim of Spike at STScI is to allocate observations to timescales of days to a week observing all scheduling constraints and maximizing preferences that help ensure that observations are made at optimal times. Spike has been in use operationally for HST since shortly after the observatory was launched in Apr. 1990. Although developed specifically for HST scheduling, Spike was carefully designed to provide a general framework for similar (activity-based) scheduling problems. In particular, the tasks to be scheduled are defined in the system in general terms, and no assumptions about the scheduling timescale are built in. The mechanisms for describing, combining, and propagating temporal and other constraints and preferences are quite general. The success of this approach has been demonstrated by the application of Spike to the scheduling of other satellite observatories: changes to the system are required only in the specific constraints that apply, and not in the framework itself. In particular, the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. This talk will discuss recent progress made in scheduling search techniques, the lessons learned from early HST operations, the application of Spike
Analysis of Feeder Bus Network Design and Scheduling Problems
Almasi, Mohammad Hadi; Karim, Mohamed Rehan
2014-01-01
A growing concern for public transit is its inability to shift passenger's mode from private to public transport. In order to overcome this problem, a more developed feeder bus network and matched schedules will play important roles. The present paper aims to review some of the studies performed on Feeder Bus Network Design and Scheduling Problem (FNDSP) based on three distinctive parts of the FNDSP setup, namely, problem description, problem characteristics, and solution approaches. The problems consist of different subproblems including data preparation, feeder bus network design, route generation, and feeder bus scheduling. Subsequently, descriptive analysis and classification of previous works are presented to highlight the main characteristics and solution methods. Finally, some of the issues and trends for future research are identified. This paper is targeted at dealing with the FNDSP to exhibit strategic and tactical goals and also contributes to the unification of the field which might be a useful complement to the few existing reviews. PMID:24526890
NASA Astrophysics Data System (ADS)
Huang, Wei; Zhang, Xingnan; Li, Chenming; Wang, Jianying
Management of group decision-making is an important issue in water source management development. In order to overcome the defects in lacking of effective communication and cooperation in the existing decision-making models, this paper proposes a multi-layer dynamic model for coordination in water resource allocation and scheduling based group decision making. By introducing the scheme-recognized cooperative satisfaction index and scheme-adjusted rationality index, the proposed model can solve the problem of poor convergence of multi-round decision-making process in water resource allocation and scheduling. Furthermore, the problem about coordination of limited resources-based group decision-making process can be solved based on the effectiveness of distance-based group of conflict resolution. The simulation results show that the proposed model has better convergence than the existing models.
Coordinating space telescope operations in an integrated planning and scheduling architecture
NASA Technical Reports Server (NTRS)
Muscettola, Nicola; Smith, Stephen F.; Cesta, Amedeo; D'Aloisi, Daniela
1992-01-01
The Heuristic Scheduling Testbed System (HSTS), a software architecture for integrated planning and scheduling, is discussed. The architecture has been applied to the problem of generating observation schedules for the Hubble Space Telescope. This problem is representative of the class of problems that can be addressed: their complexity lies in the interaction of resource allocation and auxiliary task expansion. The architecture deals with this interaction by viewing planning and scheduling as two complementary aspects of the more general process of constructing behaviors of a dynamical system. The principal components of the software architecture are described, indicating how to model the structure and dynamics of a system, how to represent schedules at multiple levels of abstraction in the temporal database, and how the problem solving machinery operates. A scheduler for the detailed management of Hubble Space Telescope operations that has been developed within HSTS is described. Experimental performance results are given that indicate the utility and practicality of the approach.
Innately Split Model for Job-shop Scheduling Problem
NASA Astrophysics Data System (ADS)
Ikeda, Kokolo; Kobayashi, Sigenobu
Job-shop Scheduling Problem (JSP) is one of the most difficult benchmark problems. GA approaches often fail searching the global optimum because of the deception UV-structure of JSPs. In this paper, we introduce a novel framework model of GA, Innately Split Model (ISM) which prevents UV-phenomenon, and discuss on its power particularly. Next we analyze the structure of JSPs with the help of the UV-structure hypothesys, and finally we show ISM's excellent performance on JSP.
NASA Astrophysics Data System (ADS)
Nagata, Takeshi; Tao, Yasuhiro; Utatani, Masahiro; Sasaki, Hiroshi; Fujita, Hideki
This paper proposes a multi-agent approach to maintenance scheduling in restructured power systems. The restructuring of electric power industry has resulted in market-based approaches for unbundling a multitude of service provided by self-interested entities such as power generating companies (GENCOs), transmission providers (TRANSCOs) and distribution companies (DISCOs). The Independent System Operator (ISO) is responsible for the security of the system operation. The schedule submitted to ISO by GENCOs and TRANSCOs should satisfy security and reliability constraints. The proposed method consists of several GENCO Agents (GAGs), TARNSCO Agents (TAGs) and a ISO Agent(IAG). The IAG’s role in maintenance scheduling is limited to ensuring that the submitted schedules do not cause transmission congestion or endanger the system reliability. From the simulation results, it can be seen the proposed multi-agent approach could coordinate between generation and transmission maintenance schedules.
Extended precedence preservative crossover for job shop scheduling problems
NASA Astrophysics Data System (ADS)
Ong, Chung Sin; Moin, Noor Hasnah; Omar, Mohd
2013-04-01
Job shop scheduling problems (JSSP) is one of difficult combinatorial scheduling problems. A wide range of genetic algorithms based on the two parents crossover have been applied to solve the problem but multi parents (more than two parents) crossover in solving the JSSP is still lacking. This paper proposes the extended precedence preservative crossover (EPPX) which uses multi parents for recombination in the genetic algorithms. EPPX is a variation of the precedence preservative crossover (PPX) which is one of the crossovers that perform well to find the solutions for the JSSP. EPPX is based on a vector to determine the gene selected in recombination for the next generation. Legalization of children (offspring) can be eliminated due to the JSSP representation encoded by using permutation with repetition that guarantees the feasibility of chromosomes. The simulations are performed on a set of benchmarks from the literatures and the results are compared to ensure the sustainability of multi parents recombination in solving the JSSP.
Solving Open Job-Shop Scheduling Problems by SAT Encoding
NASA Astrophysics Data System (ADS)
Koshimura, Miyuki; Nabeshima, Hidetomo; Fujita, Hiroshi; Hasegawa, Ryuzo
This paper tries to solve open Job-Shop Scheduling Problems (JSSP) by translating them into Boolean Satisfiability Testing Problems (SAT). The encoding method is essentially the same as the one proposed by Crawford and Baker. The open problems are ABZ8, ABZ9, YN1, YN2, YN3, and YN4. We proved that the best known upper bounds 678 of ABZ9 and 884 of YN1 are indeed optimal. We also improved the upper bound of YN2 and lower bounds of ABZ8, YN2, YN3 and YN4.
A Heuristic Approach for International Crude Oil Transportation Scheduling Problems
NASA Astrophysics Data System (ADS)
Yin, Sisi; Nishi, Tatsushi; Izuno, Tsukasa
In this paper, we propose a heuristic algorithm to solve a practical ship scheduling problem for international crude oil transportation. The problem is considered as a vehicle routing problem with split deliveries. The objective of this paper is to find an optimal assignment of tankers, a sequence of visiting and loading volume simultaneously in order to minimize the total distance satisfying the capacity of tankers. A savings-based meta-heuristic algorithm with lot sizing parameters and volume assignment heuristic is developed. The proposed method is applied to solve a case study with real data. Computational results demonstrate the effectiveness of the heuristic algorithm compared with that of human operators.
Artificial immune algorithm for multi-depot vehicle scheduling problems
NASA Astrophysics Data System (ADS)
Wu, Zhongyi; Wang, Donggen; Xia, Linyuan; Chen, Xiaoling
2008-10-01
In the fast-developing logistics and supply chain management fields, one of the key problems in the decision support system is that how to arrange, for a lot of customers and suppliers, the supplier-to-customer assignment and produce a detailed supply schedule under a set of constraints. Solutions to the multi-depot vehicle scheduling problems (MDVRP) help in solving this problem in case of transportation applications. The objective of the MDVSP is to minimize the total distance covered by all vehicles, which can be considered as delivery costs or time consumption. The MDVSP is one of nondeterministic polynomial-time hard (NP-hard) problem which cannot be solved to optimality within polynomial bounded computational time. Many different approaches have been developed to tackle MDVSP, such as exact algorithm (EA), one-stage approach (OSA), two-phase heuristic method (TPHM), tabu search algorithm (TSA), genetic algorithm (GA) and hierarchical multiplex structure (HIMS). Most of the methods mentioned above are time consuming and have high risk to result in local optimum. In this paper, a new search algorithm is proposed to solve MDVSP based on Artificial Immune Systems (AIS), which are inspirited by vertebrate immune systems. The proposed AIS algorithm is tested with 30 customers and 6 vehicles located in 3 depots. Experimental results show that the artificial immune system algorithm is an effective and efficient method for solving MDVSP problems.
Automated problem scheduling and reduction of synchronization delay effects
NASA Technical Reports Server (NTRS)
Saltz, Joel H.
1987-01-01
It is anticipated that in order to make effective use of many future high performance architectures, programs will have to exhibit at least a medium grained parallelism. A framework is presented for partitioning very sparse triangular systems of linear equations that is designed to produce favorable preformance results in a wide variety of parallel architectures. Efficient methods for solving these systems are of interest because: (1) they provide a useful model problem for use in exploring heuristics for the aggregation, mapping and scheduling of relatively fine grained computations whose data dependencies are specified by directed acrylic graphs, and (2) because such efficient methods can find direct application in the development of parallel algorithms for scientific computation. Simple expressions are derived that describe how to schedule computational work with varying degrees of granularity. The Encore Multimax was used as a hardware simulator to investigate the performance effects of using the partitioning techniques presented in shared memory architectures with varying relative synchronization costs.
Children Use Salience to Solve Coordination Problems
ERIC Educational Resources Information Center
Grueneisen, Sebastian; Wyman, Emily; Tomasello, Michael
2015-01-01
Humans are routinely required to coordinate with others. When communication is not possible, adults often achieve this by using salient cues in the environment (e.g. going to the Eiffel Tower, as an obvious meeting point). To explore the development of this capacity, we presented dyads of 3-, 5-, and 8-year-olds (N = 144) with a coordination…
An Improved Differential Evolution Solution for Software Project Scheduling Problem
Biju, A. C.; Victoire, T. Aruldoss Albert; Mohanasundaram, Kumaresan
2015-01-01
This paper proposes a differential evolution (DE) method for the software project scheduling problem (SPSP). The interest on finding a more efficient solution technique for SPSP is always a topic of interest due to the fact of ever growing challenges faced by the software industry. The curse of dimensionality is introduced in the scheduling problem by ever increasing software assignments and the number of staff who handles it. Thus the SPSP is a class of NP-hard problem, which requires a rigorous solution procedure which guarantees a reasonably better solution. Differential evolution is a direct search stochastic optimization technique that is fairly fast and reasonably robust. It is also capable of handling nondifferentiable, nonlinear, and multimodal objective functions like SPSP. This paper proposes a refined DE where a new mutation mechanism is introduced. The superiority of the proposed method is experimented and demonstrated by solving the SPSP on 50 random instances and the results are compared with some of the techniques in the literature. PMID:26495419
Petri Net Modeling and Decomposition Method for Solving Production Scheduling Problems
NASA Astrophysics Data System (ADS)
Nishi, Tatsushi; Maeno, Ryota
Considering the need to develop general scheduling problem solver, the recent integration of Petri Nets as modeling tools into effective optimization methods for scheduling problems is very promising. The paper addresses a Petri Net modeling and decomposition method for solving a wide variety of scheduling problems. The scheduling problems are represented as the optimal transition firing sequence problems for timed Petri Nets. The Petri Net is decomposed into several subnets in which each subproblem can be easily solved by Dijkstra' algorithm. The approach is applied to a flowshop scheduling problem. The performance of the proposed algorithm is compared with that of a simulated annealing method.
Applications of dynamic scheduling technique to space related problems: Some case studies
NASA Technical Reports Server (NTRS)
Nakasuka, Shinichi; Ninomiya, Tetsujiro
1994-01-01
The paper discusses the applications of 'Dynamic Scheduling' technique, which has been invented for the scheduling of Flexible Manufacturing System, to two space related scheduling problems: operation scheduling of a future space transportation system, and resource allocation in a space system with limited resources such as space station or space shuttle.
Applications of dynamic scheduling technique to space related problems: Some case studies
NASA Astrophysics Data System (ADS)
Nakasuka, Shinichi; Ninomiya, Tetsujiro
1994-10-01
The paper discusses the applications of 'Dynamic Scheduling' technique, which has been invented for the scheduling of Flexible Manufacturing System, to two space related scheduling problems: operation scheduling of a future space transportation system, and resource allocation in a space system with limited resources such as space station or space shuttle.
Walking (Gait), Balance, and Coordination Problems
... tizanidine are generally effective in treating this symptom. Balance : Balance problems typically result in a swaying and “drunken” ... factors for falls are complex and include: poor balance and slowed walking reduced proprioception (the sensation of ...
JIT single machine scheduling problem with periodic preventive maintenance
NASA Astrophysics Data System (ADS)
Shahriari, Mohammadreza; Shoja, Naghi; Zade, Amir Ebrahimi; Barak, Sasan; Sharifi, Mani
2016-03-01
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.
Mathematical Problems in Children with Developmental Coordination Disorder
ERIC Educational Resources Information Center
Pieters, Stefanie; Desoete, Annemie; Van Waelvelde, Hilde; Vanderswalmen, Ruth; Roeyers, Herbert
2012-01-01
Developmental coordination disorder (DCD) is a heterogeneous disorder, which is often co-morbid with learning disabilities. However, mathematical problems have rarely been studied in DCD. The aim of this study was to investigate the mathematical problems in children with various degrees of motor problems. Specifically, this study explored if the…
Nurse Scheduling System based on Dynamic Weighted Maximal Constraint Satisfaction Problem
NASA Astrophysics Data System (ADS)
Hattori, Hiromitsu; Isomura, Atsushi; Ito, Takayuki; Ozono, Tadachika; Shintani, Toramatsu
Scheduling has been an important research field in Artificial Intelligence. Because typical scheduling problems could be modeled as a Constraint Satisfaction Problem(CSP), several constraint satisfaction techniques have been proposed. In order to handle the different levels of importance of the constraints, solving a problem as a Weighted Maximal Constraint Satisfaction Problem(W-MaxCSP) is an promising approach. However, there exists the case where unexpected events are added and some sudden changes are required, i.e., the case with dynamic changes in scheduling problems. In this paper, we describe such dynamic scheduling problem as a Dynamic Weighted Maximal Constraint Satisfaction Problem(DW-MaxCSP) in which constraints would changes dynamically. Generally, it is undesirable to determine vastly modified schedule even if re-scheduling is needed. A new schedule should be close to the current one as much as possible. In order to obtain stable solutions, we propose the methodology to maintain portions of the current schedule using the provisional soft constraints, which explicitly penalize the changes from the current schedule. We have experimentally confirmed the efficacy of re-scheduling based on our method with provisional constraints. In this paper, we construct the nurse scheduling system for applying the proposed scheduling method.
Genetic-Annealing Algorithm in Grid Environment for Scheduling Problems
NASA Astrophysics Data System (ADS)
Cruz-Chávez, Marco Antonio; Rodríguez-León, Abelardo; Ávila-Melgar, Erika Yesenia; Juárez-Pérez, Fredy; Cruz-Rosales, Martín H.; Rivera-López, Rafael
This paper presents a parallel hybrid evolutionary algorithm executed in a grid environment. The algorithm executes local searches using simulated annealing within a Genetic Algorithm to solve the job shop scheduling problem. Experimental results of the algorithm obtained in the "Tarantula MiniGrid" are shown. Tarantula was implemented by linking two clusters from different geographic locations in Mexico (Morelos-Veracruz). The technique used to link the two clusters and configure the Tarantula MiniGrid is described. The effects of latency in communication between the two clusters are discussed. It is shown that the evolutionary algorithm presented is more efficient working in Grid environments because it can carry out major exploration and exploitation of the solution space.
A coordinated approach for real-time short term hydro scheduling
Tufegdzic, N.; Frowd, R.J.; Stadlin, W.O.
1996-11-01
The paper describes a coordinated approach to short-term hydro scheduling and dispatch that has been developed as a part of the Tasmanian Hydro Electric Commission`s (HEC) new Energy Management System (EMS), which is being delivered by Landis and Gyr Energy Management. Tasmania`s hydro generation system consists of 40 reservoirs in six river catchments. The daily water release for each plant is scheduled using the HEC`s mid-term operation policy. The Hydro Scheduling and Commitment (HSC) function schedules the hydro units on a half hourly basis so that the allocated water release maximizes the energy production. This maximization of energy production is achieved by maximizing the head and this ensures that operation is always as close as possible to maximum efficiency. Mixed Integer Linear Programming is used with a detailed model of the interconnected hydro system to determine the half-hourly operation schedule. The Hydro Economic Dispatch (HED) function is used to implement the schedules produced by HSC in the real-time operation. The HED also uses a detailed model of the hydro system with a Linear Programming algorithm to ensure that each unit operates as close as possible to its head-dependent theoretical maximum efficiency point while meeting the desired storage levels specified by the HSC solution. HSC and HED have been tested against a number of operational scenarios and when it is fully integrated within the new EMS it is expected to yield annual stored energy savings up to 0.5% through more efficient hydro-electric system operation. It is expected to also provide additional savings by fostering improvements to the mid-term operating plan.
NASA Technical Reports Server (NTRS)
Smith, Stephen F.; Pathak, Dhiraj K.
1991-01-01
In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.
Training State Child Service Coordinators in Creative Problem Solving.
ERIC Educational Resources Information Center
Combs, Wendy LeeAnn; Gilman, David Alan
The preliminary findings of the evaluation of the training program, Creative Problem Solving, are presented. The training was provided through the Blumberg Center for Interdisciplinary Studies in Special Education at Indiana State University. Twenty-one state and county child service coordinators participated in the training on a voluntary basis.…
Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang
2014-01-01
A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220
Spreading order: religion, cooperative niche construction, and risky coordination problems.
Bulbulia, Joseph
2012-01-01
Adaptationists explain the evolution of religion from the cooperative effects of religious commitments, but which cooperation problem does religion evolve to solve? I focus on a class of symmetrical coordination problems for which there are two pure Nash equilibriums: (1) ALL COOPERATE, which is efficient but relies on full cooperation; (2) ALL DEFECT, which is inefficient but pays regardless of what others choose. Formal and experimental studies reveal that for such risky coordination problems, only the defection equilibrium is evolutionarily stable. The following makes sense of otherwise puzzling properties of religious cognition and cultures as features of cooperative designs that evolve to stabilise such risky exchange. The model is interesting because it explains lingering puzzles in the data on religion, and better integrates evolutionary theories of religion with recent, well-motivated models of cooperative niche construction. PMID:22207773
Coordinating complex problem-solving among distributed intelligent agents
NASA Technical Reports Server (NTRS)
Adler, Richard M.
1992-01-01
A process-oriented control model is described for distributed problem solving. The model coordinates the transfer and manipulation of information across independent networked applications, both intelligent and conventional. The model was implemented using SOCIAL, a set of object-oriented tools for distributing computing. Complex sequences of distributed tasks are specified in terms of high level scripts. Scripts are executed by SOCIAL objects called Manager Agents, which realize an intelligent coordination model that routes individual tasks to suitable server applications across the network. These tools are illustrated in a prototype distributed system for decision support of ground operations for NASA's Space Shuttle fleet.
Protocols for distributive scheduling
NASA Technical Reports Server (NTRS)
Richards, Stephen F.; Fox, Barry
1993-01-01
The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of space shuttle mission planning.
Parallel-Batch Scheduling and Transportation Coordination with Waiting Time Constraint
Gong, Hua; Chen, Daheng; Xu, Ke
2014-01-01
This paper addresses a parallel-batch scheduling problem that incorporates transportation of raw materials or semifinished products before processing with waiting time constraint. The orders located at the different suppliers are transported by some vehicles to a manufacturing facility for further processing. One vehicle can load only one order in one shipment. Each order arriving at the facility must be processed in the limited waiting time. The orders are processed in batches on a parallel-batch machine, where a batch contains several orders and the processing time of the batch is the largest processing time of the orders in it. The goal is to find a schedule to minimize the sum of the total flow time and the production cost. We prove that the general problem is NP-hard in the strong sense. We also demonstrate that the problem with equal processing times on the machine is NP-hard. Furthermore, a dynamic programming algorithm in pseudopolynomial time is provided to prove its ordinarily NP-hardness. An optimal algorithm in polynomial time is presented to solve a special case with equal processing times and equal transportation times for each order. PMID:24883385
An Optimization Model for Scheduling Problems with Two-Dimensional Spatial Resource Constraint
NASA Technical Reports Server (NTRS)
Garcia, Christopher; Rabadi, Ghaith
2010-01-01
Traditional scheduling problems involve determining temporal assignments for a set of jobs in order to optimize some objective. Some scheduling problems also require the use of limited resources, which adds another dimension of complexity. In this paper we introduce a spatial resource-constrained scheduling problem that can arise in assembly, warehousing, cross-docking, inventory management, and other areas of logistics and supply chain management. This scheduling problem involves a twodimensional rectangular area as a limited resource. Each job, in addition to having temporal requirements, has a width and a height and utilizes a certain amount of space inside the area. We propose an optimization model for scheduling the jobs while respecting all temporal and spatial constraints.
Coordinated problem solving through resource sharing in a distributed environment.
Deshpande, Umesh; Gupta, Arobinda; Basu, Anupam
2004-04-01
An important feature in a distributed problem solving system is that the resources of different nodes can be shared through cooperation. In this paper, the generalized partial global planning (GPGP) approach used for multiagent systems is extended by providing a coordination mechanism for resource sharing across nodes. In our framework, multiple conflicting criteria (or objectives) like quality, cost, and duration may be associated with an input task. Preference ratings expressed subjectively may be assigned to each of the criteria. Task assignment in this system, which is a multiobjective decision making problem, is important for the satisfaction of the criteria. It has to be done with imprecise information since the system is dynamic and preference ratings are specified subjectively. A technique for task assignment using the fuzzy set approach is also presented in this paper. Simulation studies for the coordination mechanism and the task assignment have been performed to demonstrate their effectiveness. PMID:15376875
Children's capacity to use cultural focal points in coordination problems.
Goldvicht-Bacon, Efrat; Diesendruck, Gil
2016-04-01
Coordination problems require one to act based on expectations about how partners will act. In Experiment 1, 5-year-olds (n=57) had to hide a sticker in the box another child from their, or a different, culture was most likely to search in. Boxes were marked with cues presumed to be known by everybody, cultural members, or the child. Experiment 2 assessed 5-year-olds' (n=57) behavior in a competition scenario. In Experiment 1, children were more likely to hide in the cultural box when playing with a same- than a different-culture partner. In Experiment 2, children's behavior was the opposite. Thus by age 5, children are capable of modulating their actions in coordination problems, according to their partners' presumed knowledge. PMID:26826539
What Causes Care Coordination Problems? A Case for Microanalysis
Zachary, Wayne; Maulitz, Russell Charles; Zachary, Drew A.
2016-01-01
Introduction: Care coordination (CC) is an important fulcrum for pursuing a range of health care goals. Current research and policy analyses have focused on aggregated data rather than on understanding what happens within individual cases. At the case level, CC emerges as a complex network of communications among providers over time, crossing and recrossing many organizational boundaries. Micro-level analysis is needed to understand where and how CC fails, as well as to identify best practices and root causes of problems. Coordination Process Diagramming: Coordination Process Diagramming (CPD) is a new framework for representing and analyzing CC arcs at the micro level, separating an arc into its participants and roles, communication structure, organizational structures, and transitions of care, all on a common time line. Conclusion: Comparative CPD analysis across a sample of CC arcs identifies common CC problems and potential root causes, showing the potential value of the framework. The analyses also suggest intervention strategies that could be applied to attack the root causes of CC problems, including organizational changes, education and training, and additional health information technology development. PMID:27563685
Optimizing scheduling problem using an estimation of distribution algorithm and genetic algorithm
NASA Astrophysics Data System (ADS)
Qun, Jiang; Yang, Ou; Dong, Shi-Du
2007-12-01
This paper presents a methodology for using heuristic search methods to optimize scheduling problem. Specifically, an Estimation of Distribution Algorithm (EDA)- Population Based Incremental Learning (PBIL), and Genetic Algorithm (GA) have been applied to finding effective arrangement of curriculum schedule of Universities. To our knowledge, EDAs have been applied to fewer real world problems compared to GAs, and the goal of the present paper is to expand the application domain of this technique. The experimental results indicate a good applicability of PBIL to optimize scheduling problem.
The problem of scheduling for the linear section of a single-track railway
NASA Astrophysics Data System (ADS)
Akimova, Elena N.; Gainanov, Damir N.; Golubev, Oleg A.; Kolmogortsev, Ilya D.; Konygin, Anton V.
2016-06-01
The paper is devoted to the problem of scheduling for the linear section of a single-track railway: how to organize the flow in both directions in the most efficient way. In this paper, the authors propose an algorithm for scheduling, examine the properties of this algorithm and perform the computational experiments.
Electric power scheduling - A distributed problem-solving approach
NASA Technical Reports Server (NTRS)
Mellor, Pamela A.; Dolce, James L.; Krupp, Joseph C.
1990-01-01
Space Station Freedom's power system, along with the spacecraft's other subsystems, needs to carefully conserve its resources and yet strive to maximize overall Station productivity. Due to Freedom's distributed design, each subsystem must work cooperatively within the Station community. There is a need for a scheduling tool which will preserve this distributed structure, allow each subsystem the latitude to satisfy its own constraints, and preserve individual value systems while maintaining Station-wide integrity.
Electric power scheduling: A distributed problem-solving approach
NASA Technical Reports Server (NTRS)
Mellor, Pamela A.; Dolce, James L.; Krupp, Joseph C.
1990-01-01
Space Station Freedom's power system, along with the spacecraft's other subsystems, needs to carefully conserve its resources and yet strive to maximize overall Station productivity. Due to Freedom's distributed design, each subsystem must work cooperatively within the Station community. There is a need for a scheduling tool which will preserve this distributed structure, allow each subsystem the latitude to satisfy its own constraints, and preserve individual value systems while maintaining Station-wide integrity. The value-driven free-market economic model is such a tool.
Solving a real-world problem using an evolving heuristically driven schedule builder.
Hart, E; Ross, P; Nelson, J
1998-01-01
This work addresses the real-life scheduling problem of a Scottish company that must produce daily schedules for the catching and transportation of large numbers of live chickens. The problem is complex and highly constrained. We show that it can be successfully solved by division into two subproblems and solving each using a separate genetic algorithm (GA). We address the problem of whether this produces locally optimal solutions and how to overcome this. We extend the traditional approach of evolving a "permutation + schedule builder" by concentrating on evolving the schedule builder itself. This results in a unique schedule builder being built for each daily scheduling problem, each individually tailored to deal with the particular features of that problem. This results in a robust, fast, and flexible system that can cope with most of the circumstances imaginable at the factory. We also compare the performance of a GA approach to several other evolutionary methods and show that population-based methods are superior to both hill-climbing and simulated annealing in the quality of solutions produced. Population-based methods also have the distinct advantage of producing multiple, equally fit solutions, which is of particular importance when considering the practical aspects of the problem. PMID:10021741
Solving scheduling tournament problems using a new version of CLONALG
NASA Astrophysics Data System (ADS)
Pérez-Cáceres, Leslie; Riff, María Cristina
2015-01-01
The travelling tournament problem (TTP) is an important and well-known problem within the collective sports research community. The problem is NP-hard which makes difficult finding quality solution in short amount of time. Recently a new kind of TTP has been proposed 'The Relaxed Travelling Tournament Problem'. This version of the problem allows teams to have some days off during the tournament. In this paper, we propose an immune algorithm that is able to solve both problem versions. The algorithm uses moves which are based on the team home/away patterns. One of these moves has been specially designed for the relaxed travel tournament instances. We have tested the algorithm using well-known problem benchmarks and the results obtained are very encouraging.
Solving Stochastic Flexible Flow Shop Scheduling Problems with a Decomposition-Based Approach
NASA Astrophysics Data System (ADS)
Wang, K.; Choi, S. H.
2010-06-01
Real manufacturing is dynamic and tends to suffer a lot of uncertainties. Research on production scheduling under uncertainty has recently received much attention. Although various approaches have been developed for scheduling under uncertainty, this problem is still difficult to tackle by any single approach, because of its inherent difficulties. This chapter describes a decomposition-based approach (DBA) for makespan minimisation of a flexible flow shop (FFS) scheduling problem with stochastic processing times. The DBA decomposes an FFS into several machine clusters which can be solved more easily by different approaches. A neighbouring K-means clustering algorithm is developed to firstly group the machines of an FFS into an appropriate number of machine clusters, based on a weighted cluster validity index. A back propagation network (BPN) is then adopted to assign either the Shortest Processing Time (SPT) Algorithm or the Genetic Algorithm (GA) to generate a sub-schedule for each machine cluster. After machine grouping and approach assignment, an overall schedule is generated by integrating the sub-schedules of the machine clusters. Computation results reveal that the DBA is superior to SPT and GA alone for FFS scheduling under stochastic processing times, and that it can be easily adapted to schedule FFS under other uncertainties.
Three-index Model for Westenberger-Kallrath Benchmark Scheduling Problem
NASA Astrophysics Data System (ADS)
Vooradi, Ramsagar; Shaik, Munawar A.; Gupta, Nikhil M.
2010-10-01
Short-term scheduling of batch operations has become an important research area in the last two decades. Recently Shaik and Floudas (2009) proposed a novel unified model for short-term scheduling using unit-specific event based continuous time representation employing three-index binary and continuous variables. In this work, we extend this three index model to solve a challenging benchmark problem from the scheduling literature that covers most of the features contributing to the complexity of batch process scheduling in industry. In order to implement the problem, new sets of constraints and modifications are incorporated into the three-index model. The different demand instances of the benchmark problem have been solved using the developed model and the results are compared with the literature to demonstrate the effectiveness of the proposed three-index model.
On scheduling models for the frequency interval assignment problem with cumulative interferences
NASA Astrophysics Data System (ADS)
Kiatmanaroj, Kata; Artigues, Christian; Houssin, Laurent
2016-05-01
In this article, models and methods for solving a real-life frequency assignment problem based on scheduling theory are investigated. A realistic frequency assignment problem involving cumulative interference constraints in which the aim is to maximize the number of assigned users is considered. If interferences are assumed to be binary, a multiple carrier frequency assignment problem can be treated as a disjunctive scheduling problem since a user requesting a number of contiguous frequencies can be considered as a non-preemptive task with a processing time, and two interfering users can be modelled through a disjunctive constraint on the corresponding tasks. A binary interference version of the problem is constructed and a disjunctive scheduling model is derived. Based on the binary representation, two models are proposed. The first one relies on an interference matrix and the second one considers maximal cliques. A third, cumulative, model that yields a new class of scheduling problems is also proposed. Computational experiments show that the case-study frequency assignment problem can be solved efficiently with disjunctive scheduling techniques.
An efficient game for vehicle-to-grid coordination problems in smart grids
NASA Astrophysics Data System (ADS)
Shi, Xingyu; Ma, Zhongjing
2015-11-01
Emerging plug-in electric vehicles (PEVs), as distributed energy sources, are promising to provide vehicle-to-grid (V2G) services for power grids, like frequency and voltage regulations, by coordinating their active and reactive power rates. However, due to the autonomy of PEVs, it is challenging how to efficiently schedule the coordination behaviours among these units in a distributed way. In this paper, we formulate the underlying coordination problems as a novel class of Vickrey-Clarke-Groves style (VCG-style) auction games where players, power grids and PEVs do not report a full cost or valuation function but only a multidimensional bid signal: the maximum active and reactive power quantities that a power grid wants and the maximum per unit prices it is willing to pay, and the maximum active and reactive power quantities that a PEV can provide and the minimum per unit prices it asks for. We show the existence of the efficient Nash equilibrium (NE) for the underlying auction games, though there may exist other inefficient NEs. In order to deal with large-scale PEVs, we design games with aggregator players each of which submits bid profiles representing the overall utility for a collection of PEVs, and extend the so-called quantised-progressive second price mechanism to the underlying auction games to implement the efficient NE.
A modify ant colony optimization for the grid jobs scheduling problem with QoS requirements
NASA Astrophysics Data System (ADS)
Pu, Xun; Lu, XianLiang
2011-10-01
Job scheduling with customers' quality of service (QoS) requirement is challenging in grid environment. In this paper, we present a modify Ant colony optimization (MACO) for the Job scheduling problem in grid. Instead of using the conventional construction approach to construct feasible schedules, the proposed algorithm employs a decomposition method to satisfy the customer's deadline and cost requirements. Besides, a new mechanism of service instances state updating is embedded to improve the convergence of MACO. Experiments demonstrate the effectiveness of the proposed algorithm.
Application of a hybrid generation/utility assessment heuristic to a class of scheduling problems
NASA Technical Reports Server (NTRS)
Heyward, Ann O.
1989-01-01
A two-stage heuristic solution approach for a class of multiobjective, n-job, 1-machine scheduling problems is described. Minimization of job-to-job interference for n jobs is sought. The first stage generates alternative schedule sequences by interchanging pairs of schedule elements. The set of alternative sequences can represent nodes of a decision tree; each node is reached via decision to interchange job elements. The second stage selects the parent node for the next generation of alternative sequences through automated paired comparison of objective performance for all current nodes. An application of the heuristic approach to communications satellite systems planning is presented.
Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
NASA Astrophysics Data System (ADS)
Cruz-Chávez, Marco Antonio
2015-11-01
This paper presents a neighbourhood generation mechanism for the job shop scheduling problems (JSSPs). In order to obtain a feasible neighbour with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations in a scheduling of the JSSP. If there is no slack time between the adjacent pair of operations that is permuted, then it is proven, through theory and experimentation, that the new neighbour (schedule) generated is feasible. It is demonstrated that the neighbourhood generation mechanism is very efficient and effective in a simulated annealing.
ERIC Educational Resources Information Center
Tsakanikos, Elias; Underwood, Lisa; Sturmey, Peter; Bouras, Nick; McCarthy, Jane
2011-01-01
The present study employed the Disability Assessment Schedule (DAS) to assess problem behaviors in a large sample of adults with ID (N = 568) and evaluate the psychometric properties of this instrument. Although the DAS problem behaviors were found to be internally consistent (Cronbach's [alpha] = 0.87), item analysis revealed one weak item…
NASA Technical Reports Server (NTRS)
Wang, Lui; Valenzuela-Rendon, Manuel
1993-01-01
The Space Station Freedom will require the supply of items in a regular fashion. A schedule for the delivery of these items is not easy to design due to the large span of time involved and the possibility of cancellations and changes in shuttle flights. This paper presents the basic concepts of a genetic algorithm model, and also presents the results of an effort to apply genetic algorithms to the design of propellant resupply schedules. As part of this effort, a simple simulator and an encoding by which a genetic algorithm can find near optimal schedules have been developed. Additionally, this paper proposes ways in which robust schedules, i.e., schedules that can tolerate small changes, can be found using genetic algorithms.
Automated telescope scheduling
NASA Technical Reports Server (NTRS)
Johnston, Mark D.
1988-01-01
With the ever increasing level of automation of astronomical telescopes the benefits and feasibility of automated planning and scheduling are becoming more apparent. Improved efficiency and increased overall telescope utilization are the most obvious goals. Automated scheduling at some level has been done for several satellite observatories, but the requirements on these systems were much less stringent than on modern ground or satellite observatories. The scheduling problem is particularly acute for Hubble Space Telescope: virtually all observations must be planned in excruciating detail weeks to months in advance. Space Telescope Science Institute has recently made significant progress on the scheduling problem by exploiting state-of-the-art artificial intelligence software technology. What is especially interesting is that this effort has already yielded software that is well suited to scheduling groundbased telescopes, including the problem of optimizing the coordinated scheduling of more than one telescope.
Automated telescope scheduling
NASA Astrophysics Data System (ADS)
Johnston, Mark D.
1988-08-01
With the ever increasing level of automation of astronomical telescopes the benefits and feasibility of automated planning and scheduling are becoming more apparent. Improved efficiency and increased overall telescope utilization are the most obvious goals. Automated scheduling at some level has been done for several satellite observatories, but the requirements on these systems were much less stringent than on modern ground or satellite observatories. The scheduling problem is particularly acute for Hubble Space Telescope: virtually all observations must be planned in excruciating detail weeks to months in advance. Space Telescope Science Institute has recently made significant progress on the scheduling problem by exploiting state-of-the-art artificial intelligence software technology. What is especially interesting is that this effort has already yielded software that is well suited to scheduling groundbased telescopes, including the problem of optimizing the coordinated scheduling of more than one telescope.
ERIC Educational Resources Information Center
Kratochvil, Daniel W.
Variable Modular Scheduling Via Computer, a scheduling program which focuses on allocating a school's resources according to the school's overall purposes, is designed to allow schools to adapt organizational patterns to whatever teaching and learning patterns they define as necessary in meeting their educational goals. The system's rationale,…
Scheduling Earth Observing Fleets Using Evolutionary Algorithms: Problem Description and Approach
NASA Technical Reports Server (NTRS)
Globus, Al; Crawford, James; Lohn, Jason; Morris, Robert; Clancy, Daniel (Technical Monitor)
2002-01-01
We describe work in progress concerning multi-instrument, multi-satellite scheduling. Most, although not all, Earth observing instruments currently in orbit are unique. In the relatively near future, however, we expect to see fleets of Earth observing spacecraft, many carrying nearly identical instruments. This presents a substantially new scheduling challenge. Inspired by successful commercial applications of evolutionary algorithms in scheduling domains, this paper presents work in progress regarding the use of evolutionary algorithms to solve a set of Earth observing related model problems. Both the model problems and the software are described. Since the larger problems will require substantial computation and evolutionary algorithms are embarrassingly parallel, we discuss our parallelization techniques using dedicated and cycle-scavenged workstations.
ERIC Educational Resources Information Center
Wagner, Matthias Oliver; Bos, Klaus; Jascenoka, Julia; Jekauc, Darko; Petermann, Franz
2012-01-01
The aim of this study was to gain insights into the relationship between developmental coordination disorder, peer problems, and behavioral problems in school-aged children where both internalizing and externalizing behavioral problems were considered. We assumed that the relationship between developmental coordination disorder and…
Solution of the NP-hard total tardiness minimization problem in scheduling theory
NASA Astrophysics Data System (ADS)
Lazarev, A. A.
2007-06-01
The classical NP-hard (in the ordinary sense) problem of scheduling jobs in order to minimize the total tardiness for a single machine 1‖Σ T j is considered. An NP-hard instance of the problem is completely analyzed. A procedure for partitioning the initial set of jobs into subsets is proposed. Algorithms are constructed for finding an optimal schedule depending on the number of subsets. The complexity of the algorithms is O( n 2Σ p j ), where n is the number of jobs and p j is the processing time of the jth job ( j = 1, 2, …, n).
A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems
NASA Astrophysics Data System (ADS)
Thammano, Arit; Teekeng, Wannaporn
2015-05-01
The job-shop scheduling problem is one of the most difficult production planning problems. Since it is in the NP-hard class, a recent trend in solving the job-shop scheduling problem is shifting towards the use of heuristic and metaheuristic algorithms. This paper proposes a novel metaheuristic algorithm, which is a modification of the genetic algorithm. This proposed algorithm introduces two new concepts to the standard genetic algorithm: (1) fuzzy roulette wheel selection and (2) the mutation operation with tabu list. The proposed algorithm has been evaluated and compared with several state-of-the-art algorithms in the literature. The experimental results on 53 JSSPs show that the proposed algorithm is very effective in solving the combinatorial optimization problems. It outperforms all state-of-the-art algorithms on all benchmark problems in terms of the ability to achieve the optimal solution and the computational time.
Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm
NASA Astrophysics Data System (ADS)
Piroozfard, Hamed; Wong, Kuan Yew
2015-05-01
The efforts of finding optimal schedules for the job shop scheduling problems are highly important for many real-world industrial applications. In this paper, a multi-objective based job shop scheduling problem by simultaneously minimizing makespan and tardiness is taken into account. The problem is considered to be more complex due to the multiple business criteria that must be satisfied. To solve the problem more efficiently and to obtain a set of non-dominated solutions, a meta-heuristic based non-dominated sorting genetic algorithm is presented. In addition, task based representation is used for solution encoding, and tournament selection that is based on rank and crowding distance is applied for offspring selection. Swapping and insertion mutations are employed to increase diversity of population and to perform intensive search. To evaluate the modified non-dominated sorting genetic algorithm, a set of modified benchmarking job shop problems obtained from the OR-Library is used, and the results are considered based on the number of non-dominated solutions and quality of schedules obtained by the algorithm.
Active Solution Space and Search on Job-shop Scheduling Problem
NASA Astrophysics Data System (ADS)
Watanabe, Masato; Ida, Kenichi; Gen, Mitsuo
In this paper we propose a new searching method of Genetic Algorithm for Job-shop scheduling problem (JSP). The coding method that represent job number in order to decide a priority to arrange a job to Gannt Chart (called the ordinal representation with a priority) in JSP, an active schedule is created by using left shift. We define an active solution at first. It is solution which can create an active schedule without using left shift, and set of its defined an active solution space. Next, we propose an algorithm named Genetic Algorithm with active solution space search (GA-asol) which can create an active solution while solution is evaluated, in order to search the active solution space effectively. We applied it for some benchmark problems to compare with other method. The experimental results show good performance.
NASA Astrophysics Data System (ADS)
Marwati, Rini; Yulianti, Kartika; Pangestu, Herny Wulandari
2016-02-01
A fuzzy evolutionary algorithm is an integration of an evolutionary algorithm and a fuzzy system. In this paper, we present an application of a genetic algorithm to a fuzzy evolutionary algorithm to detect and to solve chromosomes conflict. A chromosome conflict is identified by existence of any two genes in a chromosome that has the same values as two genes in another chromosome. Based on this approach, we construct an algorithm to solve a lecture scheduling problem. Time codes, lecture codes, lecturer codes, and room codes are defined as genes. They are collected to become chromosomes. As a result, the conflicted schedule turns into chromosomes conflict. Built in the Delphi program, results show that the conflicted lecture schedule problem is solvable by this algorithm.
Some single-machine scheduling problems with learning effects and two competing agents.
Li, Hongjie; Li, Zeyuan; Yin, Yunqiang
2014-01-01
This study considers a scheduling environment in which there are two agents and a set of jobs, each of which belongs to one of the two agents and its actual processing time is defined as a decreasing linear function of its starting time. Each of the two agents competes to process its respective jobs on a single machine and has its own scheduling objective to optimize. The objective is to assign the jobs so that the resulting schedule performs well with respect to the objectives of both agents. The objective functions addressed in this study include the maximum cost, the total weighted completion time, and the discounted total weighted completion time. We investigate three problems arising from different combinations of the objectives of the two agents. The computational complexity of the problems is discussed and solution algorithms where possible are presented. PMID:25009829
Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents
Li, Hongjie; Li, Zeyuan; Yin, Yunqiang
2014-01-01
This study considers a scheduling environment in which there are two agents and a set of jobs, each of which belongs to one of the two agents and its actual processing time is defined as a decreasing linear function of its starting time. Each of the two agents competes to process its respective jobs on a single machine and has its own scheduling objective to optimize. The objective is to assign the jobs so that the resulting schedule performs well with respect to the objectives of both agents. The objective functions addressed in this study include the maximum cost, the total weighted completion time, and the discounted total weighted completion time. We investigate three problems arising from different combinations of the objectives of the two agents. The computational complexity of the problems is discussed and solution algorithms where possible are presented. PMID:25009829
An information theoretic view of the scheduling problem in whole-body CAD
NASA Astrophysics Data System (ADS)
Zhan, Yiqiang; Zhou, Xiang Sean; Krishnan, Arun
2008-03-01
Emerging whole-body imaging technologies push computer aided detection/diagnosis (CAD) to scale up to a whole-body level, which involves multiple organs or anatomical structure. To be exploited in this paper is the fact that the various tasks in whole-body CAD are often highly dependent (e.g., the localization of the femur heads strongly predicts the position of the iliac bifurcation of the aorta). One way to effectively employ task dependency is to schedule the tasks such that outputs of some tasks are used to guide the others. In this sense, optimal task scheduling is key to improve overall performance of a whole-body CAD system. In this paper, we propose a method for task scheduling that is optimal in an information-theoretic sense. The central idea is to schedule tasks in such an order that each operation achieves maximum expected information gain over all the tasks. The formulation embeds two intuitive principles: (1) a task with higher confidence tends to be scheduled earlier; (2) a task with higher predictive power for other tasks tends to be scheduled earlier. More specifically, task dependency is modeled by conditional probability; the outcome of each task is assumed to be probabilistic as well; and the objective function is based on the reduction of the summed conditional entropy over all tasks. The validation is carried out on a challenging CAD problem, multi-organ localization in whole-body CT. Compared to unscheduled and ad hoc scheduled organ detection/localization, our scheduled execution achieves higher accuracy with much less computation time.
ERIC Educational Resources Information Center
Borrero, Carrie S. W.; Vollmer, Timothy R.; Borrero, John C.; Bourret, Jason C.; Sloman, Kimberly N.; Samaha, Andrew L.; Dallery, Jesse
2010-01-01
This study evaluated how children who exhibited functionally equivalent problem and appropriate behavior allocate responding to experimentally arranged reinforcer rates. Relative reinforcer rates were arranged on concurrent variable-interval schedules and effects on relative response rates were interpreted using the generalized matching equation.…
Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem
Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue
2015-01-01
As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods. PMID:26176764
Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.
Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue
2015-01-01
As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods. PMID:26176764
Morrow, Daniel; Raquel, Liza; Schriver, Angela; Redenbo, Seth; Rozovski, David; Weiss, Gillian
2008-09-01
Taking medication requires developing plans to accomplish the activity. This planning challenges older adults because of age-related cognitive limits and inadequate collaboration with health providers. The authors investigated whether an external aid (medtable) supports collaborative planning in the context of a simulated patient/provider task in which pairs of older adults worked together to create medication schedules. Experiment 1 compared pairs who used the medtable, blank paper (unstructured aid), or no aid to create schedules varying in complexity of medication constraints (number of medications and medication co-occurrence restrictions) and patient constraints (available times during the day to take medication). Both aids increased problem-solving accuracy and efficiency (time per unit accuracy) compared to the no-aid condition, primarily for more complex schedules. However, benefits were similar for the two aids. In Experiment 2, a redesigned medtable increased problem-solving accuracy and efficiency compared to blank paper. Both aids presumably supported problem solving by providing a jointly visible workspace for developing schedules. The medtable may be more effective because it externalizes constraints (relationships between medication and patient information), so that participants can more easily organize information. PMID:18808282
NASA Astrophysics Data System (ADS)
Konno, Yohko; Suzuki, Keiji
This paper describes an approach to development of a solution algorithm of a general-purpose for large scale problems using “Local Clustering Organization (LCO)” as a new solution for Job-shop scheduling problem (JSP). Using a performance effective large scale scheduling in the study of usual LCO, a solving JSP keep stability induced better solution is examined. In this study for an improvement of a performance of a solution for JSP, processes to a optimization by LCO is examined, and a scheduling solution-structure is extended to a new solution-structure based on machine-division. A solving method introduced into effective local clustering for the solution-structure is proposed as an extended LCO. An extended LCO has an algorithm which improves scheduling evaluation efficiently by clustering of parallel search which extends over plural machines. A result verified by an application of extended LCO on various scale of problems proved to conduce to minimizing make-span and improving on the stable performance.
Compound Words: A Problem in Post-Coordinate Retrieval Systems
ERIC Educational Resources Information Center
Jones, Kevin P.
1971-01-01
Compound words cause some difficulty in post-coordinate indexing systems: if too many are fractured, or the wrong categories are selected for fracturing noise will be produced at unacceptable levels on retrieval. (Author/MM)
Hidri, Lotfi; Gharbi, Anis; Louly, Mohamed Aly
2014-01-01
We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures. PMID:25610911
Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems
NASA Technical Reports Server (NTRS)
Minton, Steve; Johnston, Mark; Philips, Andrew; Laird, Phil
1992-01-01
This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n-queens problem, a technique based on this approach performs orders of magnitude better than traditional backtracking techniques. We also describe a scheduling application where the approach has been used successfully. A theoretical analysis is presented both to explain why this method works well on certain types of problems and to predict when it is likely to be most effective.
Single-machine group scheduling problems with deteriorating and learning effect
NASA Astrophysics Data System (ADS)
Xingong, Zhang; Yong, Wang; Shikun, Bai
2016-07-01
The concepts of deteriorating jobs and learning effects have been individually studied in many scheduling problems. However, most studies considering the deteriorating and learning effects ignore the fact that production efficiency can be increased by grouping various parts and products with similar designs and/or production processes. This phenomenon is known as 'group technology' in the literature. In this paper, a new group scheduling model with deteriorating and learning effects is proposed, where learning effect depends not only on job position, but also on the position of the corresponding job group; deteriorating effect depends on its starting time of the job. This paper shows that the makespan and the total completion time problems remain polynomial optimal solvable under the proposed model. In addition, a polynomial optimal solution is also presented to minimise the maximum lateness problem under certain agreeable restriction.
Genetic Algorithm to minimize flowtime in a no-wait flowshop scheduling problem
NASA Astrophysics Data System (ADS)
Chaudhry, Imran A.; Ahmed, Riaz; Munem Khan, Abdul
2014-07-01
No-wait flowshop is an important scheduling environment having application in many industries. This paper addresses a no-wait flowshop scheduling problem, where the objective function is to minimise total flowtime. A Genetic Algorithm (GA) optimization approach implemented in a spreadsheet environment is suggested to solve this important class of problem. The proposed algorithm employs a general purpose genetic algorithm which can be customised with ease to address any objective function without modifying the optimization routine. Performance of the proposed approach is compared with eight previously reported algorithms for two sets of benchmark problems. Experimental analysis shows that the performance of the suggested approach is comparable with earlier approaches in terms of quality of solution.
A Solution Method of Scheduling Problem with Worker Allocation by a Genetic Algorithm
NASA Astrophysics Data System (ADS)
Osawa, Akira; Ida, Kenichi
In a scheduling problem with worker allocation (SPWA) proposed by Iima et al, the worker's skill level to each machine is all the same. However, each worker has a different skill level for each machine in the real world. For that reason, we propose a new model of SPWA in which a worker has the different skill level to each machine. To solve the problem, we propose a new GA for SPWA consisting of the following new three procedures, shortening of idle time, modifying infeasible solution to feasible solution, and a new selection method for GA. The effectiveness of the proposed algorithm is clarified by numerical experiments using benchmark problems for job-shop scheduling.
NASA Astrophysics Data System (ADS)
Chang, Yung-Chia; Li, Vincent C.; Chiang, Chia-Ju
2014-04-01
Make-to-order or direct-order business models that require close interaction between production and distribution activities have been adopted by many enterprises in order to be competitive in demanding markets. This article considers an integrated production and distribution scheduling problem in which jobs are first processed by one of the unrelated parallel machines and then distributed to corresponding customers by capacitated vehicles without intermediate inventory. The objective is to find a joint production and distribution schedule so that the weighted sum of total weighted job delivery time and the total distribution cost is minimized. This article presents a mathematical model for describing the problem and designs an algorithm using ant colony optimization. Computational experiments illustrate that the algorithm developed is capable of generating near-optimal solutions. The computational results also demonstrate the value of integrating production and distribution in the model for the studied problem.
Manipulating Tabu List to Handle Machine Breakdowns in Job Shop Scheduling Problems
NASA Astrophysics Data System (ADS)
Nababan, Erna Budhiarti; SalimSitompul, Opim
2011-06-01
Machine breakdowns in a production schedule may occur on a random basis that make the well-known hard combinatorial problem of Job Shop Scheduling Problems (JSSP) becomes more complex. One of popular techniques used to solve the combinatorial problems is Tabu Search. In this technique, moves that will be not allowed to be revisited are retained in a tabu list in order to avoid in gaining solutions that have been obtained previously. In this paper, we propose an algorithm to employ a second tabu list to keep broken machines, in addition to the tabu list that keeps the moves. The period of how long the broken machines will be kept on the list is categorized using fuzzy membership function. Our technique are tested to the benchmark data of JSSP available on the OR library. From the experiment, we found that our algorithm is promising to help a decision maker to face the event of machine breakdowns.
48 CFR 552.236-78 - Shop Drawings, Coordination Drawings, and Schedules.
Code of Federal Regulations, 2010 CFR
2010-10-01
... coordination drawing shall have a blank area 5 by 5 inches, located adjacent to the title block. The title block shall display the following: Number and title of drawing Date of drawing or revision Name...
ERIC Educational Resources Information Center
Waters, Melissa B.; Lerman, Dorothea C.; Hovanetz, Alyson N.
2009-01-01
The separate and combined effects of visual schedules and extinction plus differential reinforcement of other behavior (DRO) were evaluated to decrease transition-related problem behavior of 2 children diagnosed with autism. Visual schedules alone were ineffective in reducing problem behavior when transitioning from preferred to nonpreferred…
NASA Astrophysics Data System (ADS)
Ramli, Razamin; Tein, Lim Huai
2016-08-01
A good work schedule can improve hospital operations by providing better coverage with appropriate staffing levels in managing nurse personnel. Hence, constructing the best nurse work schedule is the appropriate effort. In doing so, an improved selection operator in the Evolutionary Algorithm (EA) strategy for a nurse scheduling problem (NSP) is proposed. The smart and efficient scheduling procedures were considered. Computation of the performance of each potential solution or schedule was done through fitness evaluation. The best so far solution was obtained via special Maximax&Maximin (MM) parent selection operator embedded in the EA, which fulfilled all constraints considered in the NSP.
Enhancements of evolutionary algorithm for the complex requirements of a nurse scheduling problem
NASA Astrophysics Data System (ADS)
Tein, Lim Huai; Ramli, Razamin
2014-12-01
Over the years, nurse scheduling is a noticeable problem that is affected by the global nurse turnover crisis. The more nurses are unsatisfied with their working environment the more severe the condition or implication they tend to leave. Therefore, the current undesirable work schedule is partly due to that working condition. Basically, there is a lack of complimentary requirement between the head nurse's liability and the nurses' need. In particular, subject to highly nurse preferences issue, the sophisticated challenge of doing nurse scheduling is failure to stimulate tolerance behavior between both parties during shifts assignment in real working scenarios. Inevitably, the flexibility in shifts assignment is hard to achieve for the sake of satisfying nurse diverse requests with upholding imperative nurse ward coverage. Hence, Evolutionary Algorithm (EA) is proposed to cater for this complexity in a nurse scheduling problem (NSP). The restriction of EA is discussed and thus, enhancement on the EA operators is suggested so that the EA would have the characteristic of a flexible search. This paper consists of three types of constraints which are the hard, semi-hard and soft constraints that can be handled by the EA with enhanced parent selection and specialized mutation operators. These operators and EA as a whole contribute to the efficiency of constraint handling, fitness computation as well as flexibility in the search, which correspond to the employment of exploration and exploitation principles.
Meta-RaPS Algorithm for the Aerial Refueling Scheduling Problem
NASA Technical Reports Server (NTRS)
Kaplan, Sezgin; Arin, Arif; Rabadi, Ghaith
2011-01-01
The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for each fighter aircraft (job) on multiple tankers (machines). ARSP assumes that jobs have different release times and due dates, The total weighted tardiness is used to evaluate schedule's quality. Therefore, ARSP can be modeled as a parallel machine scheduling with release limes and due dates to minimize the total weighted tardiness. Since ARSP is NP-hard, it will be more appropriate to develop a pproimate or heuristic algorithm to obtain solutions in reasonable computation limes. In this paper, Meta-Raps-ATC algorithm is implemented to create high quality solutions. Meta-RaPS (Meta-heuristic for Randomized Priority Search) is a recent and promising meta heuristic that is applied by introducing randomness to a construction heuristic. The Apparent Tardiness Rule (ATC), which is a good rule for scheduling problems with tardiness objective, is used to construct initial solutions which are improved by an exchanging operation. Results are presented for generated instances.
NASA Astrophysics Data System (ADS)
Wang, Deyun; Grunder, Olivier; EL Moudni, Abdellah
2014-08-01
This paper considers an integrated lot sizing and scheduling problem for a production-distribution environment with arbitrary job volumes and distinct due dates considerations. In the problem, jobs are firstly batch processed on a batching machine at production stage and then delivered to a pre-specified customer at the subsequent delivery stage by a capacitated vehicle. Each job is associated with a distinct due date and a distinct volume, and has to be delivered to the customer before its due date, i.e. delay is not allowed. The processing time of a batch is a constant independent of the jobs it contains. In production, a constant set-up time as well as a constant set-up cost is required before the first job of this batch is processed. In delivery, a constant delivery time as well as a constant delivery cost is needed for each round-trip delivery between the factory and the customer. Moreover, it is supposed that a job that arrives at the customer before its due date will incur a customer inventory cost. The objective is to find a coordinated lot sizing and scheduling scheme such that the total cost is minimised while guaranteeing a certain customer service level. A mixed integer formulation is proposed for this problem, and then a genetic algorithm is developed to solve it. To evaluate the performance of the proposed genetic algorithm, a lower bound on the objective value is established. Computational experiments show that the proposed genetic algorithm performs well on randomly generated problem instances.
de Chaves, Raquel Nichele; Bustamante Valdívia, Alcibíades; Nevill, Alan; Freitas, Duarte; Tani, Go; Katzmarzyk, Peter T; Maia, José António Ribeiro
2016-01-01
The aims of this cross-sectional study were to examine the developmental characteristics (biological maturation and body size) associated with gross motor coordination problems in 5193 Peruvian children (2787 girls) aged 6-14 years from different geographical locations, and to investigate how the probability that children suffer with gross motor coordination problems varies with physical fitness. Children with gross motor coordination problems were more likely to have lower flexibility and explosive strength levels, having adjusted for age, sex, maturation and study site. Older children were more likely to suffer from gross motor coordination problems, as were those with greater body mass index. However, more mature children were less likely to have gross motor coordination problems, although children who live at sea level or at high altitude were more likely to suffer from gross motor coordination problems than children living in the jungle. Our results provide evidence that children and adolescents with lower physical fitness are more likely to have gross motor coordination difficulties. The identification of youths with gross motor coordination problems and providing them with effective intervention programs is an important priority in order to overcome such developmental problems, and help to improve their general health status. PMID:26871464
Duan, Qian-Qian; Yang, Gen-Ke; Pan, Chang-Chun
2014-01-01
A hybrid optimization algorithm combining finite state method (FSM) and genetic algorithm (GA) is proposed to solve the crude oil scheduling problem. The FSM and GA are combined to take the advantage of each method and compensate deficiencies of individual methods. In the proposed algorithm, the finite state method makes up for the weakness of GA which is poor at local searching ability. The heuristic returned by the FSM can guide the GA algorithm towards good solutions. The idea behind this is that we can generate promising substructure or partial solution by using FSM. Furthermore, the FSM can guarantee that the entire solution space is uniformly covered. Therefore, the combination of the two algorithms has better global performance than the existing GA or FSM which is operated individually. Finally, a real-life crude oil scheduling problem from the literature is used for conducting simulation. The experimental results validate that the proposed method outperforms the state-of-art GA method. PMID:24772031
Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem
Molla-Alizadeh-Zavardehi, S.; Tavakkoli-Moghaddam, R.; Lotfi, F. Hosseinzadeh
2014-01-01
This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA), variable neighborhood search (VNS), and simulated annealing (SA) frameworks. Besides, we propose three fuzzy earliest due date heuristics to solve the given problem. Through computational experiments with several random test problems, a robust calibration is applied on the parameters. Finally, computational results on different-scale test problems are presented to compare the proposed algorithms. PMID:24883359
A Novel Joint Problem of Routing, Scheduling, and Variable-Width Channel Allocation in WMNs
Liu, Wan-Yu; Chou, Chun-Hung
2014-01-01
This paper investigates a novel joint problem of routing, scheduling, and channel allocation for single-radio multichannel wireless mesh networks in which multiple channel widths can be adjusted dynamically through a new software technology so that more concurrent transmissions and suppressed overlapping channel interference can be achieved. Although the previous works have studied this joint problem, their linear programming models for the problem were not incorporated with some delicate constraints. As a result, this paper first constructs a linear programming model with more practical concerns and then proposes a simulated annealing approach with a novel encoding mechanism, in which the configurations of multiple time slots are devised to characterize the dynamic transmission process. Experimental results show that our approach can find the same or similar solutions as the optimal solutions for smaller-scale problems and can efficiently find good-quality solutions for a variety of larger-scale problems. PMID:24982990
Hybrid metaheuristics for solving a fuzzy single batch-processing machine scheduling problem.
Molla-Alizadeh-Zavardehi, S; Tavakkoli-Moghaddam, R; Lotfi, F Hosseinzadeh
2014-01-01
This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA), variable neighborhood search (VNS), and simulated annealing (SA) frameworks. Besides, we propose three fuzzy earliest due date heuristics to solve the given problem. Through computational experiments with several random test problems, a robust calibration is applied on the parameters. Finally, computational results on different-scale test problems are presented to compare the proposed algorithms. PMID:24883359
NASA Astrophysics Data System (ADS)
Bai, Danyu; Zhang, Zhihai
2014-08-01
This article investigates the open-shop scheduling problem with the optimal criterion of minimising the sum of quadratic completion times. For this NP-hard problem, the asymptotic optimality of the shortest processing time block (SPTB) heuristic is proven in the sense of limit. Moreover, three different improvements, namely, the job-insert scheme, tabu search and genetic algorithm, are introduced to enhance the quality of the original solution generated by the SPTB heuristic. At the end of the article, a series of numerical experiments demonstrate the convergence of the heuristic, the performance of the improvements and the effectiveness of the quadratic objective.
NASA Astrophysics Data System (ADS)
Zhu, Li; He, Yongxiang; Xue, Haidong; Chen, Leichen
Traditional genetic algorithms (GA) displays a disadvantage of early-constringency in dealing with scheduling problem. To improve the crossover operators and mutation operators self-adaptively, this paper proposes a self-adaptive GA at the target of multitask scheduling optimization under limited resources. The experiment results show that the proposed algorithm outperforms the traditional GA in evolutive ability to deal with complex task scheduling optimization.
NASA Astrophysics Data System (ADS)
Jafari, Hamed; Salmasi, Nasser
2015-04-01
The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital's demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses' preferences for working shifts and weekends off by considering several important factors such as hospital's policies, labor laws, governmental regulations, and the status of nurses at the end of the previous planning horizon in one of the largest hospitals in Iran i.e., Milad Hospital. Due to the shortage of available nurses, at first, the minimum total number of required nurses is determined. Then, a mathematical programming model is proposed to solve the problem optimally. Since the proposed research problem is NP-hard, a meta-heuristic algorithm based on simulated annealing (SA) is applied to heuristically solve the problem in a reasonable time. An initial feasible solution generator and several novel neighborhood structures are applied to enhance performance of the SA algorithm. Inspired from our observations in Milad hospital, random test problems are generated to evaluate the performance of the SA algorithm. The results of computational experiments indicate that the applied SA algorithm provides solutions with average percentage gap of 5.49 % compared to the upper bounds obtained from the mathematical model. Moreover, the applied SA algorithm provides significantly better solutions in a reasonable time than the schedules provided by the head nurses.
Laplace Boundary-Value Problem in Paraboloidal Coordinates
ERIC Educational Resources Information Center
Duggen, L.; Willatzen, M.; Voon, L. C. Lew Yan
2012-01-01
This paper illustrates both a problem in mathematical physics, whereby the method of separation of variables, while applicable, leads to three ordinary differential equations that remain fully coupled via two separation constants and a five-term recurrence relation for series solutions, and an exactly solvable problem in electrostatics, as a…
Preserving spherical symmetry in axisymmetric coordinates for diffusion problems
Brunner, T. A.; Kolev, T. V.; Bailey, T. S.; Till, A. T.
2013-07-01
Persevering symmetric solutions, even in the under-converged limit, is important to the robustness of production simulation codes. We explore the symmetry preservation in both a continuous nodal and a mixed finite element method. In their standard formulation, neither method preserves spherical solution symmetry in axisymmetric (RZ) coordinates. We propose two methods, one for each family of finite elements, that recover spherical symmetry for low-order finite elements on linear or curvilinear meshes. This is a first step toward understanding achieving symmetry for higher-order elements. (authors)
Coordinated Observations of Space Debris as Optimisation Problem of Inter-Dependent Metrics
NASA Astrophysics Data System (ADS)
Sciotti, M.; Charlish, A.
2013-08-01
Optimal allocation of sensor resources is addressed in this paper in the frame of space surveillance application. Inspiration is taken from the optimal management of multi-functional sensors and netted surveillance sensors, for which the Sensor Management problem is often addressed as a Markov Decision Process. This approach allows determining the optimal decision at each discrete time instant by quantifying the expected payoff coming from the selected action. An action might be the assignment of the i -th surveillance task to the m -th sensor in the network ('tasking'), the selection of the i -th task at the k -th time slot ('scheduling'), or the activation of a specific sensor configuration for the completion of the i -th task ('resource allocation'). The common objective is the maximization of the global reward coming from the selected sequence of actions over a finite or infinite time horizon. This leads to a sequence of coordinated observations carried out by the sensor(s), which are determined statically or dynamically by the Sensor Manager. In this paper, the allocation of space surveillance resources is analysed as a management problem for sensor(s) with finite resources. The proposed allocation is driven by the operational requirements for space objects cataloguing, such as the object population coverage and the track accuracy. A sequential resource allocation strategy is formulated in order to cope with such inter-dependent, concurring performance metrics. The approach can be also extended to multiple sensors with different performance or nature. Promising results are demonstrated over a phased array radar case study.
A Hybrid Cellular Genetic Algorithm for Multi-objective Crew Scheduling Problem
NASA Astrophysics Data System (ADS)
Jolai, Fariborz; Assadipour, Ghazal
Crew scheduling is one of the important problems of the airline industry. This problem aims to cover a number of flights by crew members, such that all the flights are covered. In a robust scheduling the assignment should be so that the total cost, delays, and unbalanced utilization are minimized. As the problem is NP-hard and the objectives are in conflict with each other, a multi-objective meta-heuristic called CellDE, which is a hybrid cellular genetic algorithm, is implemented as the optimization method. The proposed algorithm provides the decision maker with a set of non-dominated or Pareto-optimal solutions, and enables them to choose the best one according to their preferences. A set of problems of different sizes is generated and solved using the proposed algorithm. Evaluating the performance of the proposed algorithm, three metrics are suggested, and the diversity and the convergence of the achieved Pareto front are appraised. Finally a comparison is made between CellDE and PAES, another meta-heuristic algorithm. The results show the superiority of CellDE.
NASA Astrophysics Data System (ADS)
Guo, Peng; Cheng, Wenming; Wang, Yi
2014-10-01
The quay crane scheduling problem (QCSP) determines the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the vessel's service time is minimized. A number of heuristics or meta-heuristics have been proposed to obtain the near-optimal solutions to overcome the NP-hardness of the problem. In this article, the idea of generalized extremal optimization (GEO) is adapted to solve the QCSP with respect to various interference constraints. The resulting GEO is termed the modified GEO. A randomized searching method for neighbouring task-to-QC assignments to an incumbent task-to-QC assignment is developed in executing the modified GEO. In addition, a unidirectional search decoding scheme is employed to transform a task-to-QC assignment to an active quay crane schedule. The effectiveness of the developed GEO is tested on a suite of benchmark problems introduced by K.H. Kim and Y.M. Park in 2004 (European Journal of Operational Research, Vol. 156, No. 3). Compared with other well-known existing approaches, the experiment results show that the proposed modified GEO is capable of obtaining the optimal or near-optimal solution in a reasonable time, especially for large-sized problems.
A Two-Stage Stochastic Mixed-Integer Programming Approach to the Smart House Scheduling Problem
NASA Astrophysics Data System (ADS)
Ozoe, Shunsuke; Tanaka, Yoichi; Fukushima, Masao
A “Smart House” is a highly energy-optimized house equipped with photovoltaic systems (PV systems), electric battery systems, fuel cell cogeneration systems (FC systems), electric vehicles (EVs) and so on. Smart houses are attracting much attention recently thanks to their enhanced ability to save energy by making full use of renewable energy and by achieving power grid stability despite an increased power draw for installed PV systems. Yet running a smart house's power system, with its multiple power sources and power storages, is no simple task. In this paper, we consider the problem of power scheduling for a smart house with a PV system, an FC system and an EV. We formulate the problem as a mixed integer programming problem, and then extend it to a stochastic programming problem involving recourse costs to cope with uncertain electricity demand, heat demand and PV power generation. Using our method, we seek to achieve the optimal power schedule running at the minimum expected operation cost. We present some results of numerical experiments with data on real-life demands and PV power generation to show the effectiveness of our method.
Solving a Production Scheduling Problem by Means of Two Biobjective Metaheuristic Procedures
NASA Astrophysics Data System (ADS)
Toncovich, Adrián; Oliveros Colay, María José; Moreno, José María; Corral, Jiménez; Corral, Rafael
2009-11-01
Production planning and scheduling problems emphasize the need for the availability of management tools that can help to assure proper service levels to customers, maintaining, at the same time, the production costs at acceptable levels and maximizing the utilization of the production facilities. In this case, a production scheduling problem that arises in the context of the activities of a company dedicated to the manufacturing of furniture for children and teenagers is addressed. Two bicriteria metaheuristic procedures are proposed to solve the sequencing problem in a production equipment that constitutes the bottleneck of the production process of the company. The production scheduling problem can be characterized as a general flow shop with sequence dependant setup times and additional inventory constraints. Two objectives are simultaneously taken into account when the quality of the candidate solutions is evaluated: the minimization of completion time of all jobs, or makespan, and the minimization of the total flow time of all jobs. Both procedures are based on a local search strategy that responds to the structure of the simulated annealing metaheuristic. In this case, both metaheuristic approaches generate a set of solutions that provides an approximation to the optimal Pareto front. In order to evaluate the performance of the proposed techniques a series of experiments was conducted. After analyzing the results, it can be said that the solutions provided by both approaches are adequate from the viewpoint of the quality as well as the computational effort involved in their generation. Nevertheless, a further refinement of the proposed procedures should be implemented with the aim of facilitating a quasi-automatic definition of the solution parameters.
ERIC Educational Resources Information Center
Earnest, Darrell
2015-01-01
This article reports on students' problem-solving approaches across three representations--number lines, coordinate planes, and function graphs--the axes of which conventional mathematics treats in terms of consistent geometric and numeric coordinations. I consider these representations to be a part of a "hierarchical representational…
Three-Stage Tabu Search for Solving Large-Scale Flow Shop Scheduling Problems
NASA Astrophysics Data System (ADS)
Xu, Yuedong; Tian, Yajie; Sannomiya, Nobuo
Tabu search is a meta-heuristic approach designed skillfully for finding a suboptimal solution of combinatorial optimization problems. In this paper the tabu search with three stages is proposed for solving large-scale flow shop scheduling problems. In order to obtain a better suboptimal solution in a short computation time, three different candidate lists are used to determine the incumbent solution in the respective search stages. The candidate lists are constructed by restricting the moving of each job. Test problems with four kinds of job data are examined. Based on analyzing the relationship between the candidate list and the suboptimal solution for each job data, a common parameter is given to construct the candidate list during the search process. Comparison of the computation result is made with the genetic algorithm and the basic tabu search, from which it is shown that the proposed tabu search outperforms two others.
NASA Astrophysics Data System (ADS)
Ohno, Akiyoshi; Nishi, Tatsushi; Inuiguchi, Masahiro; Takahashi, Satoru; Ueda, Kenji
In this paper, we propose a column generation for the train-set scheduling problem with regular maintenance constraints. The problem is to allocate the minimum train-set to the train operations required to operate a given train timetable. In the proposed method, a tight lower bound can be obtained from the continuous relaxation for Dantzig-Wolfe reformulation by column generation. The subproblem for the column generation is an elementary shortest path problem with resource constraints. A labeling algorithm is applied to solve the subproblem. In order to reduce the computational effort for solving subproblems, a new state space relaxation of the subproblem is developed in the labeling algorithm. An upper bound is computed by a heuristic algorithm. Computational results demonstrate the effectiveness of the proposed method.
A network flow model for short-term hydro-dominated hydrothermal scheduling problems
Franco, P.E.C. ); Carvalho, M.F. ); Soares, S. )
1994-05-01
This paper is concerned with the Short-Term Hydrothermal Scheduling (STHS) of hydro-dominated power systems. The problem's formulation includes the representation of operational constraints such as the hydraulic coupling between hydro plants in cascade and the transmission limits in the electric network. In order to allow the problem's decomposition into hydraulic and electric subproblems, a linear-quadratic penalty approach is applied to enforce the coupling between hydro and electric variables. As a result, the problem's natural network flow structure is fully exploited through special-purposed network flow algorithms. The technique has been implemented in FORTRAN in a SUN SPARCstation IPX and tested in a 440 KV subsystem of the main interconnected Brazilian power system.
An estimation of distribution algorithm (EDA) variant with QGA for Flowshop scheduling problem
NASA Astrophysics Data System (ADS)
Latif, Muhammad Shahid; Hong, Zhou; Ali, Amir
2014-04-01
In this research article, a hybrid approach is presented which based on well-known meta-heuristics algorithms. This study based on integration of Quantum Genetic Algorithm (QGA) and Estimation of Distribution Algorithm, EDA, (for simplicity we use Q-EDA) for flowshop scheduling, a well-known NP hard Problem, while focusing on the total flow time minimization criterion. A relatively new method has been adopted for the encoding of jobs sequence in flowshop known as angel rotations instead of random keys, so QGA become more efficient. Further, EDA has been integrated to update the population of QGA by making a probability model. This probabilistic model is built and used to generate new candidate solutions which comprised on best individuals, obtained after several repetitions of proposed (Q-EDA) approach. As both heuristics based on probabilistic characteristics, so exhibits excellent learning capability and have minimum chances of being trapped in local optima. The results obtained during this study are presented and compared with contemporary approaches in literature. The current hybrid Q-EDA has implemented on different benchmark problems. The experiments has showed better convergence and results. It is concluded that hybrid Q-EDA algorithm can generally produce better results while implemented for Flowshop Scheduling Problem (FSSP).
Internal or shape coordinates in the {ital n}-body problem
Littlejohn, R.G.; Reinsch, M.
1995-09-01
The construction of global shape coordinates for the {ital n}-body problem is considered. Special attention is given to the three- and four-body problems. Quantities, including candidates for coordinates, are organized according to their transformation properties under so-called democracy transformations (orthogonal transformations of Jacobi vectors). Important submanifolds of shape space are identified and their topology studied, including the manifolds upon which shapes are coplanar or collinear, and the manifolds upon which the moment of inertia tensor is degenerate.
NASA Astrophysics Data System (ADS)
Li, Kai; Yang, Shan-Lin; Ren, Ming-Lun
2011-10-01
This article considers the single-machine scheduling problem to minimise the total resource consumption under the constraint that the makespan does not exceed a given limit, in which the release date of a job is a linear decreasing continuous function of the resource consumption. This problem is NP-hard in the strong sense. We design a simulated annealing (SA) algorithm to obtain the near-optimal solution with high quality. Two operators, right-move and left-move, are defined and their influences on the resource consumption are analysed. We use two operations, insert and swap, to generate the neighbourhood, and discuss how to calculate the change of total resource consumption. To evaluate the performance of the proposed algorithm, we relax the problem to an assignment problem, and obtain a lower bound by the Hungary method. And then, we improve its quality by Chu's method. Based on the settings that Janiak provided, we generate the random test data in our experiments to simulate the ingot preheating and hot-rolling process in steel mills. The accuracy and efficiency of the proposed SA algorithm are tested based on those data with problem sizes varying from 50 to 200 jobs. The computational results indicate that the SA approach is promising and capable of solving large-scale problems in a reasonable time.
Xu, Zhenzhen; Zou, Yongxing; Kong, Xiangjie
2015-01-01
To our knowledge, this paper investigates the first application of meta-heuristic algorithms to tackle the parallel machines scheduling problem with weighted late work criterion and common due date ([Formula: see text]). Late work criterion is one of the performance measures of scheduling problems which considers the length of late parts of particular jobs when evaluating the quality of scheduling. Since this problem is known to be NP-hard, three meta-heuristic algorithms, namely ant colony system, genetic algorithm, and simulated annealing are designed and implemented, respectively. We also propose a novel algorithm named LDF (largest density first) which is improved from LPT (longest processing time first). The computational experiments compared these meta-heuristic algorithms with LDF, LPT and LS (list scheduling), and the experimental results show that SA performs the best in most cases. However, LDF is better than SA in some conditions, moreover, the running time of LDF is much shorter than SA. PMID:26702371
NASA Astrophysics Data System (ADS)
Xu, Ye; Wang, Ling; Wang, Shengyao; Liu, Min
2014-09-01
In this article, an effective hybrid immune algorithm (HIA) is presented to solve the distributed permutation flow-shop scheduling problem (DPFSP). First, a decoding method is proposed to transfer a job permutation sequence to a feasible schedule considering both factory dispatching and job sequencing. Secondly, a local search with four search operators is presented based on the characteristics of the problem. Thirdly, a special crossover operator is designed for the DPFSP, and mutation and vaccination operators are also applied within the framework of the HIA to perform an immune search. The influence of parameter setting on the HIA is investigated based on the Taguchi method of design of experiment. Extensive numerical testing results based on 420 small-sized instances and 720 large-sized instances are provided. The effectiveness of the HIA is demonstrated by comparison with some existing heuristic algorithms and the variable neighbourhood descent methods. New best known solutions are obtained by the HIA for 17 out of 420 small-sized instances and 585 out of 720 large-sized instances.
A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem
NASA Technical Reports Server (NTRS)
Montoya, Justin Vincent; Wood, Zachary Paul; Rathinam, Sivakumar; Malik, Waqar Ahmad
2010-01-01
Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.
NASA Astrophysics Data System (ADS)
Gao, Qian
For both the conventional radio frequency and the comparably recent optical wireless communication systems, extensive effort from the academia had been made in improving the network spectrum efficiency and/or reducing the error rate. To achieve these goals, many fundamental challenges such as power efficient constellation design, nonlinear distortion mitigation, channel training design, network scheduling and etc. need to be properly addressed. In this dissertation, novel schemes are proposed accordingly to deal with specific problems falling in category of these challenges. Rigorous proofs and analyses are provided for each of our work to make a fair comparison with the corresponding peer works to clearly demonstrate the advantages. The first part of this dissertation considers a multi-carrier optical wireless system employing intensity modulation (IM) and direct detection (DD). A block-wise constellation design is presented, which treats the DC-bias that conventionally used solely for biasing purpose as an information basis. Our scheme, we term it MSM-JDCM, takes advantage of the compactness of sphere packing in a higher dimensional space, and in turn power efficient constellations are obtained by solving an advanced convex optimization problem. Besides the significant power gains, the MSM-JDCM has many other merits such as being capable of mitigating nonlinear distortion by including a peak-to-power ratio (PAPR) constraint, minimizing inter-symbol-interference (ISI) caused by frequency-selective fading with a novel precoder designed and embedded, and further reducing the bit-error-rate (BER) by combining with an optimized labeling scheme. The second part addresses several optimization problems in a multi-color visible light communication system, including power efficient constellation design, joint pre-equalizer and constellation design, and modeling of different structured channels with cross-talks. Our novel constellation design scheme, termed CSK-Advanced, is
NASA Astrophysics Data System (ADS)
Izah Anuar, Nurul; Saptari, Adi
2016-02-01
This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representation procedures in Particle Swarm Optimization (PSO) in the case of solving Job-shop Scheduling Problems (JSP). Particle representation procedures refer to the mapping between the particle position in PSO and the scheduling solution in JSP. It is an important step to be carried out so that each particle in PSO can represent a schedule in JSP. Three procedures such as Operation and Particle Position Sequence (OPPS), random keys representation and random-key encoding scheme are used in this study. These procedures have been tested on FT06 and FT10 benchmark problems available in the OR-Library, where the objective function is to minimize the makespan by the use of MATLAB software. Based on the experimental results, it is discovered that OPPS gives the best performance in solving both benchmark problems. The contribution of this paper is the fact that it demonstrates to the practitioners involved in complex scheduling problems that different particle representation procedures can have significant effects on the performance of PSO in solving JSP.
Scheduling of flow shop problems on 3 machines in fuzzy environment with double transport facility
NASA Astrophysics Data System (ADS)
Sathish, Shakeela; Ganesan, K.
2016-06-01
Flow shop scheduling is a decision making problem in production and manufacturing field which has a significant impact on the performance of an organization. When the machines on which jobs are to be processed are placed at different places, the transportation time plays a significant role in production. Further two different transport agents where 1st takes the job from 1st machine to 2nd machine and then returns back to the first machine and the 2nd takes the job from 2nd machine to 3rd machine and then returns back to the 2nd machine are also considered. We propose a method to minimize the total make span; without converting the fuzzy processing time to classical numbers by using a new type of fuzzy arithmetic and a fuzzy ranking method. A numerical example is provided to explain the proposed method.
An extended abstract: A heuristic repair method for constraint-satisfaction and scheduling problems
NASA Technical Reports Server (NTRS)
Minton, Steven; Johnston, Mark D.; Philips, Andrew B.; Laird, Philip
1992-01-01
The work described in this paper was inspired by a surprisingly effective neural network developed for scheduling astronomical observations on the Hubble Space Telescope. Our heuristic constraint satisfaction problem (CSP) method was distilled from an analysis of the network. In the process of carrying out the analysis, we discovered that the effectiveness of the network has little to do with its connectionist implementation. Furthermore, the ideas employed in the network can be implemented very efficiently within a symbolic CSP framework. The symbolic implementation is extremely simple. It also has the advantage that several different search strategies can be employed, although we have found that hill-climbing methods are particularly well-suited for the applications that we have investigated. We begin the paper with a brief review of the neural network. Following this, we describe our symbolic method for heuristic repair.
Three hybridization models based on local search scheme for job shop scheduling problem
NASA Astrophysics Data System (ADS)
Balbi Fraga, Tatiana
2015-05-01
This work presents three different hybridization models based on the general schema of Local Search Heuristics, named Hybrid Successive Application, Hybrid Neighborhood, and Hybrid Improved Neighborhood. Despite similar approaches might have already been presented in the literature in other contexts, in this work these models are applied to analyzes the solution of the job shop scheduling problem, with the heuristics Taboo Search and Particle Swarm Optimization. Besides, we investigate some aspects that must be considered in order to achieve better solutions than those obtained by the original heuristics. The results demonstrate that the algorithms derived from these three hybrid models are more robust than the original algorithms and able to get better results than those found by the single Taboo Search.
Decision theory for computing variable and value ordering decisions for scheduling problems
NASA Technical Reports Server (NTRS)
Linden, Theodore A.
1993-01-01
Heuristics that guide search are critical when solving large planning and scheduling problems, but most variable and value ordering heuristics are sensitive to only one feature of the search state. One wants to combine evidence from all features of the search state into a subjective probability that a value choice is best, but there has been no solid semantics for merging evidence when it is conceived in these terms. Instead, variable and value ordering decisions should be viewed as problems in decision theory. This led to two key insights: (1) The fundamental concept that allows heuristic evidence to be merged is the net incremental utility that will be achieved by assigning a value to a variable. Probability distributions about net incremental utility can merge evidence from the utility function, binary constraints, resource constraints, and other problem features. The subjective probability that a value is the best choice is then derived from probability distributions about net incremental utility. (2) The methods used for rumor control in Bayesian Networks are the primary way to prevent cycling in the computation of probable net incremental utility. These insights lead to semantically justifiable ways to compute heuristic variable and value ordering decisions that merge evidence from all available features of the search state.
NASA Astrophysics Data System (ADS)
Ausaf, Muhammad Farhan; Gao, Liang; Li, Xinyu
2015-12-01
For increasing the overall performance of modern manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling (IPPS) problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS (MOIPPS) problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatching rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.
Li, Shanlin; Li, Maoqin
2015-01-01
We consider an integrated production and distribution scheduling problem faced by a typical make-to-order manufacturer which relies on a third-party logistics (3PL) provider for finished product delivery to customers. In the beginning of a planning horizon, the manufacturer has received a set of orders to be processed on a single production line. Completed orders are delivered to customers by a finite number of vehicles provided by the 3PL company which follows a fixed daily or weekly shipping schedule such that the vehicles have fixed departure dates which are not part of the decisions. The problem is to find a feasible schedule that minimizes one of the following objective functions when processing times and weights are oppositely ordered: (1) the total weight of late orders and (2) the number of vehicles used subject to the condition that the total weight of late orders is minimum. We show that both problems are solvable in polynomial time. PMID:25785285
Li, Shanlin; Li, Maoqin
2015-01-01
We consider an integrated production and distribution scheduling problem faced by a typical make-to-order manufacturer which relies on a third-party logistics (3PL) provider for finished product delivery to customers. In the beginning of a planning horizon, the manufacturer has received a set of orders to be processed on a single production line. Completed orders are delivered to customers by a finite number of vehicles provided by the 3PL company which follows a fixed daily or weekly shipping schedule such that the vehicles have fixed departure dates which are not part of the decisions. The problem is to find a feasible schedule that minimizes one of the following objective functions when processing times and weights are oppositely ordered: (1) the total weight of late orders and (2) the number of vehicles used subject to the condition that the total weight of late orders is minimum. We show that both problems are solvable in polynomial time. PMID:25785285
Duan, Qianqian; Yang, Genke; Xu, Guanglin; Pan, Changchun
2014-01-01
This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand uncertainty is treated by specifying proximity level on the satisfaction of product demands. However, the joint chance constraints usually hold strong nonlinearity and consequently, it is still hard to handle it directly. In this paper, an approximation method combines a relax-and-tight technique to approximately transform the joint chance constraints to a serial of parameterized linear constraints so that the complicated problem can be attacked iteratively. The basic idea behind this approach is to approximate, as much as possible, nonlinear constraints by a lot of easily handled linear constraints which will lead to a well balance between the problem complexity and tractability. Case studies are conducted to demonstrate the proposed methods. Results show that the operation cost can be reduced effectively compared with the case without considering the demand correlation. PMID:24757433
NASA Astrophysics Data System (ADS)
Tang, Dunbing; Dai, Min
2015-09-01
The traditional production planning and scheduling problems consider performance indicators like time, cost and quality as optimization objectives in manufacturing processes. However, environmentally-friendly factors like energy consumption of production have not been completely taken into consideration. Against this background, this paper addresses an approach to modify a given schedule generated by a production planning and scheduling system in a job shop floor, where machine tools can work at different cutting speeds. It can adjust the cutting speeds of the operations while keeping the original assignment and processing sequence of operations of each job fixed in order to obtain energy savings. First, the proposed approach, based on a mixed integer programming mathematical model, changes the total idle time of the given schedule to minimize energy consumption in the job shop floor while accepting the optimal solution of the scheduling objective, makespan. Then, a genetic-simulated annealing algorithm is used to explore the optimal solution due to the fact that the problem is strongly NP-hard. Finally, the effectiveness of the approach is performed smalland large-size instances, respectively. The experimental results show that the approach can save 5%-10% of the average energy consumption while accepting the optimal solution of the makespan in small-size instances. In addition, the average maximum energy saving ratio can reach to 13%. And it can save approximately 1%-4% of the average energy consumption and approximately 2.4% of the average maximum energy while accepting the near-optimal solution of the makespan in large-size instances. The proposed research provides an interesting point to explore an energy-aware schedule optimization for a traditional production planning and scheduling problem.
High Order Finite Difference Methods, Multidimensional Linear Problems and Curvilinear Coordinates
NASA Technical Reports Server (NTRS)
Nordstrom, Jan; Carpenter, Mark H.
1999-01-01
Boundary and interface conditions are derived for high order finite difference methods applied to multidimensional linear problems in curvilinear coordinates. The boundary and interface conditions lead to conservative schemes and strict and strong stability provided that certain metric conditions are met.
A Solution Method of Job-shop Scheduling Problems by the Idle Time Shortening Type Genetic Algorithm
NASA Astrophysics Data System (ADS)
Ida, Kenichi; Osawa, Akira
In this paper, we propose a new idle time shortening method for Job-shop scheduling problems (JSPs). We insert its method into a genetic algorithm (GA). The purpose of JSP is to find a schedule with the minimum makespan. We suppose that it is effective to reduce idle time of a machine in order to improve the makespan. The left shift is a famous algorithm in existing algorithms for shortening idle time. The left shift can not arrange the work to idle time. For that reason, some idle times are not shortened by the left shift. We propose two kinds of algorithms which shorten such idle time. Next, we combine these algorithms and the reversal of a schedule. We apply GA with its algorithm to benchmark problems and we show its effectiveness.
NASA Astrophysics Data System (ADS)
He, Yong; Sun, Li
2015-05-01
In this paper, we introduce a group scheduling model with general deteriorating jobs and learning effects in which deteriorating jobs and learning effects are both considered simultaneously. This means that the actual processing time of a job depends not only on the processing time of the jobs already processed, but also on its scheduled position. In our model, the group setup times are general linear functions of their starting times and the jobs in the same group have general position-dependent learning effects and time-dependent deterioration. The objective of scheduling problems is to minimise the makespan and the sum of completion times, respectively. We show that the problems remain solvable in polynomial time under the proposed model.
Finite element method formulation in polar coordinates for transient heat conduction problems
NASA Astrophysics Data System (ADS)
Duda, Piotr
2016-04-01
The aim of this paper is the formulation of the finite element method in polar coordinates to solve transient heat conduction problems. It is hard to find in the literature a formulation of the finite element method (FEM) in polar or cylindrical coordinates for the solution of heat transfer problems. This document shows how to apply the most often used boundary conditions. The global equation system is solved by the Crank-Nicolson method. The proposed algorithm is verified in three numerical tests. In the first example, the obtained transient temperature distribution is compared with the temperature obtained from the presented analytical solution. In the second numerical example, the variable boundary condition is assumed. In the last numerical example the component with the shape different than cylindrical is used. All examples show that the introduction of the polar coordinate system gives better results than in the Cartesian coordinate system. The finite element method formulation in polar coordinates is valuable since it provides a higher accuracy of the calculations without compacting the mesh in cylindrical or similar to tubular components. The proposed method can be applied for circular elements such as boiler drums, outlet headers, flux tubes. This algorithm can be useful during the solution of inverse problems, which do not allow for high density grid. This method can calculate the temperature distribution in the bodies of different properties in the circumferential and the radial direction. The presented algorithm can be developed for other coordinate systems. The examples demonstrate a good accuracy and stability of the proposed method.
NASA Astrophysics Data System (ADS)
Trunfio, Roberto
2015-06-01
In a recent article, Guo, Cheng and Wang proposed a randomized search algorithm, called modified generalized extremal optimization (MGEO), to solve the quay crane scheduling problem for container groups under the assumption that schedules are unidirectional. The authors claim that the proposed algorithm is capable of finding new best solutions with respect to a well-known set of benchmark instances taken from the literature. However, as shown in this note, there are some errors in their work that can be detected by analysing the Gantt charts of two solutions provided by MGEO. In addition, some comments on the method used to evaluate the schedule corresponding to a task-to-quay crane assignment and on the search scheme of the proposed algorithm are provided. Finally, to assess the effectiveness of the proposed algorithm, the computational experiments are repeated and additional computational experiments are provided.
NASA Astrophysics Data System (ADS)
Joo, Cheol Min; Kim, Byung Soo
2012-09-01
This article considers a parallel machine scheduling problem with ready times, due times and sequence-dependent setup times. The objective of this problem is to determine the allocation policy of jobs and the scheduling policy of machines to minimize the weighted sum of setup times, delay times and tardy times. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain optimal solutions as the problem size becomes large. Therefore, two meta-heuristics, genetic algorithm (GA) and a new population-based evolutionary meta-heuristic called self-evolution algorithm (SEA), are proposed. The performances of the meta-heuristic algorithms are evaluated through comparison with optimal solutions using several randomly generated examples.
A Local Coordinate Approach in the MLPG Method for Beam Problems
NASA Technical Reports Server (NTRS)
Raju, Ivatury S.; Phillips, Dawn R.
2002-01-01
System matrices for Euler-Bernoulli beam problems for the meshless local Petrov-Galerkin (MLPG) method deteriorate as the number of nodes in the beam models are consistently increased. The reason for this behavior is explained. To overcome this difficulty and improve the accuracy of the solutions, a local coordinate approach for the evaluation of the generalized moving least squares shape functions and their derivatives is proposed. The proposed approach retains the accuracy of the MLPG methods.
Regularization of the circular restricted three-body problem using `similar' coordinate systems
NASA Astrophysics Data System (ADS)
Roman, R.; Szücs-Csillik, I.
2012-04-01
The regularization of a new problem, namely the three-body problem, using `similar' coordinate system is proposed. For this purpose we use the relation of `similarity', which has been introduced as an equivalence relation in a previous paper (see Roman in Astrophys. Space Sci. doi:10.1007/s10509-011-0747-1, 2011). First we write the Hamiltonian function, the equations of motion in canonical form, and then using a generating function, we obtain the transformed equations of motion. After the coordinates transformations, we introduce the fictitious time, to regularize the equations of motion. Explicit formulas are given for the regularization in the coordinate systems centered in the more massive and the less massive star of the binary system. The `similar' polar angle's definition is introduced, in order to analyze the regularization's geometrical transformation. The effect of Levi-Civita's transformation is described in a geometrical manner. Using the resulted regularized equations, we analyze and compare these canonical equations numerically, for the Earth-Moon binary system.
A multi-objective scatter search for a bi-criteria no-wait flow shop scheduling problem
NASA Astrophysics Data System (ADS)
Rahimi-Vahed, A. R.; Javadi, B.; Rabbani, M.; Tavakkoli-Moghaddam, R.
2008-04-01
The flow shop problem as a typical manufacturing challenge has gained wide attention in academic fields. This article considers a bi-criteria no-wait flow shop scheduling problem (FSSP) in which weighted mean completion time and weighted mean tardiness are to be minimized simultaneously. Since a FSSP has been proved to be NP-hard in a strong sense, a new multi-objective scatter search (MOSS) is designed for finding the locally Pareto-optimal frontier of the problem. To prove the efficiency of the proposed algorithm, various test problems are solved and the reliability of the proposed algorithm, based on some comparison metrics, is compared with a distinguished multi-objective genetic algorithm (GA), i.e. SPEA-II. The computational results show that the proposed MOSS performs better than the above GA, especially for the large-sized problems.
Personalized Education; Solving a Group Formation and Scheduling Problem for Educational Content
ERIC Educational Resources Information Center
Bahargam, Sanaz; Erdos, Dóra; Bestavros, Azer; Terzi, Evimaria
2015-01-01
Whether teaching in a classroom or a Massive Online Open Course it is crucial to present the material in a way that benefits the audience as a whole. We identify two important tasks to solve towards this objective; (1) group students so that they can maximally benefit from peer interaction and (2) find an optimal schedule of the educational…
NASA Technical Reports Server (NTRS)
Gaspin, Christine
1989-01-01
How a neural network can work, compared to a hybrid system based on an operations research and artificial intelligence approach, is investigated through a mission scheduling problem. The characteristic features of each system are discussed.
A Study on Machine Maintenance Scheduling Using Distributed Cooperative Approach
NASA Astrophysics Data System (ADS)
Tsujibe, Akihisa; Kaihara, Toshiya; Fujii, Nobutada; Nonaka, Youichi
In this study, we propose a distributed cooperative scheduling method, and apply the method into a machine maintenance scheduling problem in re-entrant production systems. As one of the distributed cooperative scheduling methods, we focus on Lagrangian decomposition and coordination (LDC) method, and formulate the machine maintenance scheduling problem with LDC so as to improve computational efficiency by decomposing an original scheduling problem into several sub-problems. The derived solutions by solving the decomposed dual problem are converted into feasible solutions with a heuristic procedure applied in this study. The proposed approach regards maintenance as job with starting and finishing time constraints, so that product and maintenance schedule can realize proper maintenance operations without losing productivity. We show the effectiveness of the proposed method in several simulation experiments.
NASA Astrophysics Data System (ADS)
Liou, Cheng-Dar; Hsieh, Yi-Chih; Chen, Yin-Yann
2013-01-01
This article investigates the two-machine flow-shop group scheduling problem (GSP) with sequence-dependent setup and removal times, and job transportation times between machines. The objective is to minimise the total completion time. As known, this problem is an NP-hard problem and generalises the typical two-machine GSPs. In this article, a new encoding scheme based on permutation representation is proposed to transform a random job permutation to a feasible permutation for GSPs. The proposed encoding scheme simultaneously determines both the sequence of jobs in each group and the sequence of groups. By reasonably combining particle swarm optimisation (PSO) and genetic algorithm (GA), we develop a fast and easily implemented hybrid algorithm (HA) for solving the considered problems. The effectiveness and efficiency of the proposed HA are demonstrated and compared with those of standard PSO and GA by numerical results of various tested instances with group numbers up to 20. In addition, three different lower bounds are developed to evaluate the solution quality of the HA. Limited numerical results indicate that the proposed HA is a viable and effective approach for the studied two-machine flow-shop group scheduling problem.
NASA Astrophysics Data System (ADS)
Bai, Danyu
2015-08-01
This paper discusses the flow shop scheduling problem to minimise the total quadratic completion time (TQCT) with release dates in offline and online environments. For this NP-hard problem, the investigation is focused on the performance of two online algorithms based on the Shortest Processing Time among Available jobs rule. Theoretical results indicate the asymptotic optimality of the algorithms as the problem scale is sufficiently large. To further enhance the quality of the original solutions, the improvement scheme is provided for these algorithms. A new lower bound with performance guarantee is provided, and computational experiments show the effectiveness of these heuristics. Moreover, several results of the single-machine TQCT problem with release dates are also obtained for the deduction of the main theorem.
NASA Astrophysics Data System (ADS)
Xu, Ye; Wang, Ling; Wang, Shengyao; Liu, Min
2013-12-01
In this article, an effective shuffled frog-leaping algorithm (SFLA) is proposed to solve the hybrid flow-shop scheduling problem with identical parallel machines (HFSP-IPM). First, some novel heuristic decoding rules for both job order decision and machine assignment are proposed. Then, three hybrid decoding schemes are designed to decode job order sequences to schedules. A special bi-level crossover and multiple local search operators are incorporated in the searching framework of the SFLA to enrich the memetic searching behaviour and to balance the exploration and exploitation capabilities. Meanwhile, some theoretical analysis for the local search operators is provided for guiding the local search. The parameter setting of the algorithm is also investigated based on the Taguchi method of design of experiments. Finally, numerical testing based on well-known benchmarks and comparisons with some existing algorithms are carried out to demonstrate the effectiveness of the proposed algorithm.
NASA Astrophysics Data System (ADS)
Wang, Hongfeng; Fu, Yaping; Huang, Min; Wang, Junwei
2016-03-01
The operation process design is one of the key issues in the manufacturing and service sectors. As a typical operation process, the scheduling with consideration of the deteriorating effect has been widely studied; however, the current literature only studied single function requirement and rarely considered the multiple function requirements which are critical for a real-world scheduling process. In this article, two function requirements are involved in the design of a scheduling process with consideration of the deteriorating effect and then formulated into two objectives of a mathematical programming model. A novel multiobjective evolutionary algorithm is proposed to solve this model with combination of three strategies, i.e. a multiple population scheme, a rule-based local search method and an elitist preserve strategy. To validate the proposed model and algorithm, a series of randomly-generated instances are tested and the experimental results indicate that the model is effective and the proposed algorithm can achieve the satisfactory performance which outperforms the other state-of-the-art multiobjective evolutionary algorithms, such as nondominated sorting genetic algorithm II and multiobjective evolutionary algorithm based on decomposition, on all the test instances.
Exploring the separability of the three-body Coulomb problem in hyperspherical elliptic coordinates
NASA Astrophysics Data System (ADS)
Tolstikhin, Oleg I.; Matsuzawa, Michio
2001-06-01
An approximate symmetry of the three-body Coulomb problem which reveals itself via approximate separability of the hyperspherical adiabatic (HSA) eigenvalue problem in hyperspherical elliptic (HSE) coordinates (η,ξ) and thus is intimately related to the HSA approximation is discussed. The additional integral of motion responsible for this separability is specific to the Coulomb interaction and generalizes the Laplace-Runge-Lentz vector known from the two-body Coulomb problem and the integral of separation constant of the two-center Coulomb problem. In the zeroth approximation, this symmetry leads to a completely separable representation of the three-body wave function, where each state is labeled by a pair of HSE quantum numbers (nη,nξ) that generalize the spheroidal quantum numbers for diatomic molecules, on the one hand, and the Herrick-Lin quantum numbers for two-electron atoms, on the other. This approximation is illustrated by calculations for a number of three-body Coulomb systems for states with zero total angular momentum. Taking into account the nonadiabatic couplings as well as the nonseparable part of the Coulomb potential by mixing a few separable states permits one to obtain accurate results for systems with arbitrary masses and charges of particles and for a wide spectrum below the three-body breakup threshold.
NASA Technical Reports Server (NTRS)
Lee, Paul U.; Smith, Nancy M.; Bienert, Nancy; Brasil, Connie; Buckley, Nathan; Chevalley, Eric; Homola, Jeffrey; Omar, Faisal; Parke, Bonny; Yoo, Hyo-Sang
2016-01-01
LaGuardia (LGA) departure delay was identified by the stakeholders and subject matter experts as a significant bottleneck in the New York metropolitan area. Departure delay at LGA is primarily due to dependency between LGA's arrival and departure runways: LGA departures cannot begin takeoff until arrivals have cleared the runway intersection. If one-in one-out operations are not maintained and a significant arrival-to-departure imbalance occurs, the departure backup can persist through the rest of the day. At NASA Ames Research Center, a solution called "Departure-sensitive Arrival Spacing" (DSAS) was developed to maximize the departure throughput without creating significant delays in the arrival traffic. The concept leverages a Terminal Sequencing and Spacing (TSS) operations that create and manage the arrival schedule to the runway threshold and added an interface enhancement to the traffic manager's timeline to provide the ability to manually adjust inter-arrival spacing to build precise gaps for multiple departures between arrivals. A more complete solution would include a TSS algorithm enhancement that could automatically build these multi-departure gaps. With this set of capabilities, inter-arrival spacing could be controlled for optimal departure throughput. The concept was prototyped in a human-in-the- loop (HITL) simulation environment so that operational requirements such as coordination procedures, timing and magnitude of TSS schedule adjustments, and display features for Tower, TRACON and Traffic Management Unit could be determined. A HITL simulation was conducted in August 2014 to evaluate the concept in terms of feasibility, controller workload impact, and potential benefits. Three conditions were tested, namely a Baseline condition without scheduling, TSS condition that schedules the arrivals to the runway threshold, and TSS+DSAS condition that adjusts the arrival schedule to maximize the departure throughput. The results showed that during high
NASA Astrophysics Data System (ADS)
Han, Yu-Yan; Gong, Dunwei; Sun, Xiaoyan
2015-07-01
A flow-shop scheduling problem with blocking has important applications in a variety of industrial systems but is underrepresented in the research literature. In this study, a novel discrete artificial bee colony (ABC) algorithm is presented to solve the above scheduling problem with a makespan criterion by incorporating the ABC with differential evolution (DE). The proposed algorithm (DE-ABC) contains three key operators. One is related to the employed bee operator (i.e. adopting mutation and crossover operators of discrete DE to generate solutions with good quality); the second is concerned with the onlooker bee operator, which modifies the selected solutions using insert or swap operators based on the self-adaptive strategy; and the last is for the local search, that is, the insert-neighbourhood-based local search with a small probability is adopted to improve the algorithm's capability in exploitation. The performance of the proposed DE-ABC algorithm is empirically evaluated by applying it to well-known benchmark problems. The experimental results show that the proposed algorithm is superior to the compared algorithms in minimizing the makespan criterion.
NASA Astrophysics Data System (ADS)
Basri, Azyanzuhaila Hasan; Zainuddin, Zaitul Marlizawati
2014-09-01
High efficiency of port operation is required to succeed in the competition between port container terminals. Berth Allocation and Quay Crane Scheduling are the most important part in container terminal operations. The integrated model is formulated as a MIP problem with the objective to minimize the sum of the dwell times, where a vessel's dwell time is measured between arrival and departure including both times waiting to be berthed and servicing time while berthed. The construction of suitable mathematical model is formulated by considering various practical constraints.
Germain, Shawn St; Farris, Ronald; Whaley, April M; Medema, Heather; Gertman, David
2014-09-01
This research effort is a part of the Light-Water Reactor Sustainability (LWRS) Program, which is a research and development (R&D) program sponsored by Department of Energy (DOE) and performed in close collaboration with industry R&D programs that provide the technical foundations for licensing and managing the long-term, safe, and economical operation of current nuclear power plants. The LWRS program serves to help the U.S. nuclear industry adopt new technologies and engineering solutions that facilitate the continued safe operation of the plants and extension of the current operating licenses. Managing NPP outages is a complex and difficult task due to the large number of maintenance and repair activities that are accomplished in a short period of time. During an outage, the outage control center (OCC) is the temporary command center for outage managers and provides several critical functions for the successful execution of the outage schedule. Essentially, the OCC functions to facilitate information inflow, assist outage management in processing information, and to facilitate the dissemination of information to stakeholders. Currently, outage management activities primarily rely on telephone communication, face to face reports of status, and periodic briefings in the OCC. It is a difficult task to maintain current the information related to outage progress and discovered conditions. Several advanced communication and collaboration technologies have shown promise for facilitating the information flow into, across, and out of the OCC. The use of these technologies will allow information to be shared electronically, providing greater amounts of real-time information to the decision makers and allowing OCC coordinators to meet with supporting staff remotely. Passively monitoring status electronically through advances in the areas of mobile worker technologies, computer-based procedures, and automated work packages will reduce the current reliance on manually
Agnetis, Alessandro; Coppi, Alberto; Corsini, Matteo; Dellino, Gabriella; Meloni, Carlo; Pranzo, Marco
2014-03-01
This research aims at supporting hospital management in making prompt Operating Room (OR) planning decisions, when either unpredicted events occur or alternative scenarios or configurations need to be rapidly evaluated. We design and test a planning tool enabling managers to efficiently analyse several alternatives to the current OR planning and scheduling. To this aim, we propose a decomposition approach. More specifically, we first focus on determining the Master Surgical Schedule (MSS) on a weekly basis, by assigning the different surgical disciplines to the available sessions. Next, we allocate surgeries to each session, focusing on elective patients only. Patients are selected from the waiting lists according to several parameters, including surgery duration, waiting time and priority class of the operations. We performed computational experiments to compare the performance of our decomposition approach with an (exact) integrated approach. The case study selected for our simulations is based on the characteristics of the operating theatre (OT) of a medium-size public Italian hospital. Scalability of the method is tested for different OT sizes. A pilot example is also proposed to highlight the usefulness of our approach for decision support. The proposed decomposition approach finds satisfactory solutions with significant savings in computation time. PMID:23783452
Learning to integrate reactivity and deliberation in uncertain planning and scheduling problems
NASA Technical Reports Server (NTRS)
Chien, Steve A.; Gervasio, Melinda T.; Dejong, Gerald F.
1992-01-01
This paper describes an approach to planning and scheduling in uncertain domains. In this approach, a system divides a task on a goal by goal basis into reactive and deliberative components. Initially, a task is handled entirely reactively. When failures occur, the system changes the reactive/deliverative goal division by moving goals into the deliberative component. Because our approach attempts to minimize the number of deliberative goals, we call our approach Minimal Deliberation (MD). Because MD allows goals to be treated reactively, it gains some of the advantages of reactive systems: computational efficiency, the ability to deal with noise and non-deterministic effects, and the ability to take advantage of unforseen opportunities. However, because MD can fall back upon deliberation, it can also provide some of the guarantees of classical planning, such as the ability to deal with complex goal interactions. This paper describes the Minimal Deliberation approach to integrating reactivity and deliberation and describe an ongoing application of the approach to an uncertain planning and scheduling domain.
NASA Technical Reports Server (NTRS)
Phillips, K.
1976-01-01
A mathematical model for job scheduling in a specified context is presented. The model uses both linear programming and combinatorial methods. While designed with a view toward optimization of scheduling of facility and plant operations at the Deep Space Communications Complex, the context is sufficiently general to be widely applicable. The general scheduling problem including options for scheduling objectives is discussed and fundamental parameters identified. Mathematical algorithms for partitioning problems germane to scheduling are presented.
The study of atomic three-body problems in hyperspherical coordinates
Lin, C.D.
1985-08-01
In this review the application of hyperspherical coordinates is discussed for the solution of some of the typical atomic and molecular problems, and the new physical insights obtained from such studies are shown. In particular, it is shown how correlations between two excited electrons can be conveniently understood in terms of the surface harmonics at a constant hyperradius and visualized by displaying the surface charge densities on the angular coordinates that describe radial and angular correlations. It is shown that a new set of correlation quantum numbers K, T and A for any two-electron states can be deduced by analyzing the surface harmonics; here K and T describe angular correlation and A = +1, -1 or 0) describes radial correlation. Because of the isomorphic correlations, states which have A = +1 or -1 are shown to exhibit supermultiplet structure while states which have A = 0 are shown to behave like singly excited states. Therefore this classification scheme includes the independent particle approximation as a subset. The relations of these quantum numbers to the collective vibrations and rotations of molecule-like normal modes are also discussed. Applications of hyperspherical harmonics to the three-body breakup and linear triatomic collisions are also discussed briefly. 57 refs., 15 figs.
NASA Astrophysics Data System (ADS)
Li, Jinsha; Li, Junmin
2016-07-01
In this paper, the adaptive fuzzy iterative learning control scheme is proposed for coordination problems of Mth order (M ≥ 2) distributed multi-agent systems. Every follower agent has a higher order integrator with unknown nonlinear dynamics and input disturbance. The dynamics of the leader are a higher order nonlinear systems and only available to a portion of the follower agents. With distributed initial state learning, the unified distributed protocols combined time-domain and iteration-domain adaptive laws guarantee that the follower agents track the leader uniformly on [0, T]. Then, the proposed algorithm extends to achieve the formation control. A numerical example and a multiple robotic system are provided to demonstrate the performance of the proposed approach.
NASA Astrophysics Data System (ADS)
Cram, Ana Catalina
As worldwide environmental awareness grow, alternative sources of energy have become important to mitigate climate change. Biogas in particular reduces greenhouse gas emissions that contribute to global warming and has the potential of providing 25% of the annual demand for natural gas in the U.S. In 2011, 55,000 metric tons of methane emissions were reduced and 301 metric tons of carbon dioxide emissions were avoided through the use of biogas alone. Biogas is produced by anaerobic digestion through the fermentation of organic material. It is mainly composed of methane with a rage of 50 to 80% in its concentration. Carbon dioxide covers 20 to 50% and small amounts of hydrogen, carbon monoxide and nitrogen. The biogas production systems are anaerobic digestion facilities and the optimal operation of an anaerobic digester requires the scheduling of all batches from multiple feedstocks during a specific time horizon. The availability times, biomass quantities, biogas production rates and storage decay rates must all be taken into account for maximal biogas production to be achieved during the planning horizon. Little work has been done to optimize the scheduling of different types of feedstock in anaerobic digestion facilities to maximize the total biogas produced by these systems. Therefore, in the present thesis, a new genetic algorithm is developed with the main objective of obtaining the optimal sequence in which different feedstocks will be processed and the optimal time to allocate to each feedstock in the digester with the main objective of maximizing the production of biogas considering different types of feedstocks, arrival times and decay rates. Moreover, all batches need to be processed in the digester in a specified time with the restriction that only one batch can be processed at a time. The developed algorithm is applied to 3 different examples and a comparison with results obtained in previous studies is presented.
Numerical solution of flow problems using body-fitted coordinate systems
NASA Technical Reports Server (NTRS)
Thompson, J. F.
1980-01-01
The paper deals with numerically generated boundary-fitted coordinate systems. This procedure eliminates the shape of the boundaries as a complicating factor and allows the flow about arbitrary boundaries to be treated essentially as easily as that about simple boundaries. The technique of boundary-fitted coordinate systems is based on a method of automatic numerical generation of a general curvilinear coordinate system having a coordinate line coincident with each boundary of a general multiconnected region involving any number of arbitrarily shaped boundaries. Once the curvilinear coordinate system is generated, any partial differential system of interest may be solved on the coordinate system by transforming the equations and solving the resulting system in finite-difference approximation on the rectangular transformed plane. Attention is given to the types of boundary-fitted coordinate systems, coordinate system control, operation of the coordinate codes, solution of partial differential equations, application to free-surface flow, and other applications of interest.
Integrated scheduling and resource management. [for Space Station Information System
NASA Technical Reports Server (NTRS)
Ward, M. T.
1987-01-01
This paper examines the problem of integrated scheduling during the Space Station era. Scheduling for Space Station entails coordinating the support of many distributed users who are sharing common resources and pursuing individual and sometimes conflicting objectives. This paper compares the scheduling integration problems of current missions with those anticipated for the Space Station era. It examines the facilities and the proposed operations environment for Space Station. It concludes that the pattern of interdependecies among the users and facilities, which are the source of the integration problem is well structured, allowing a dividing of the larger problem into smaller problems. It proposes an architecture to support integrated scheduling by scheduling efficiently at local facilities as a function of dependencies with other facilities of the program. A prototype is described that is being developed to demonstrate this integration concept.
The Block Scheduling Handbook.
ERIC Educational Resources Information Center
Queen, J. Allen
Block scheduling encourages increased comprehensive immersion into subject matter, improved teacher-student relationships, and decreased disciplinary problems. While block scheduling may offer many advantages, moving to a block schedule from conventional scheduling can be a major adjustment for both students and teachers. This guide is intended to…
NASA Technical Reports Server (NTRS)
Richards, Stephen F.
1991-01-01
Although computerized operations have significant gains realized in many areas, one area, scheduling, has enjoyed few benefits from automation. The traditional methods of industrial engineering and operations research have not proven robust enough to handle the complexities associated with the scheduling of realistic problems. To address this need, NASA has developed the computer-aided scheduling system (COMPASS), a sophisticated, interactive scheduling tool that is in wide-spread use within NASA and the contractor community. Therefore, COMPASS provides no explicit support for the large class of problems in which several people, perhaps at various locations, build separate schedules that share a common pool of resources. This research examines the issue of distributing scheduling, as applied to application domains characterized by the partial ordering of tasks, limited resources, and time restrictions. The focus of this research is on identifying issues related to distributed scheduling, locating applicable problem domains within NASA, and suggesting areas for ongoing research. The issues that this research identifies are goals, rescheduling requirements, database support, the need for communication and coordination among individual schedulers, the potential for expert system support for scheduling, and the possibility of integrating artificially intelligent schedulers into a network of human schedulers.
NASA Astrophysics Data System (ADS)
Yamamoto, Satoru
2005-07-01
A preconditioned flux-vector splitting (PFVS) scheme in general curvilinear coordinates which can be applied to condensate fluid and solid coupling problems is presented and some typical calculated results are shown to prove the availability of the present method. This method is based on the preconditioning method applied to compressible Navier-Stokes (NS) equations with additional equations and source terms for condensate flows. Since the present PFVS terms composed of the convective and pressure terms of the NS equations are completely reduced to only the pressure terms when the velocities are set to zero, the present scheme can further applied to the calculation not only for a dynamic field but also for a static field including a transitional field from the dynamic region to the static region. In this paper, as a first stage of the present study, coupling problems between a condensate flow in a flow field and heat conduction in a solid structure are simultaneously calculated by using the present method. As numerical examples, transonic and low speed flows around the NACA0012 airfoil, nonequilibrium condensate flows in a nozzle, and natural convection with condensation around a pipe at 1g and zero gravity are simulated with heat conduction in the solid structure.
Distributed project scheduling at NASA: Requirements for manual protocols and computer-based support
NASA Technical Reports Server (NTRS)
Richards, Stephen F.
1992-01-01
The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of Space Shuttle mission planning.
Revealing hot executive function in children with motor coordination problems: What's the go?
Rahimi-Golkhandan, S; Steenbergen, B; Piek, J P; Caeyenberghs, K; Wilson, P H
2016-07-01
Recent research suggests that children with Developmental Coordination Disorder (DCD) often show deficits in executive functioning (EF) and, more specifically, the ability to use inhibitory control in 'hot', emotionally rewarding contexts. This study optimized the assessment of sensitivity of children with DCD to emotionally significant stimuli by using easily discriminable emotional expressions in a go/no-go task. Thirty-six children (12 with DCD), aged 7-12years, completed an emotional go/no-go task in which neutral facial expressions were paired with either happy or sad ones. Each expression was used as both, a go and no-go target in different runs of the task. There were no group differences in omission errors; however, the DCD group made significantly more commission errors to happy no-go faces. The particular pattern of performance in DCD confirms earlier reports of (hot) EF deficits. Specifically, a problem of inhibitory control appears to underlie the atypical pattern of performance seen in DCD on both cold and hot EF tasks. Disrupted coupling between cognitive control and emotion processing networks, such as fronto-parietal and fronto-striatal networks, may contribute to reduced inhibitory control in DCD. The implications for a broader theoretical account of DCD are discussed, as are implications for intervention. PMID:27254817
NASA Technical Reports Server (NTRS)
Rash, James
2014-01-01
NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial
Non-clairvoyant Scheduling Games
NASA Astrophysics Data System (ADS)
Dürr, Christoph; Nguyen, Kim Thang
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of each player is the completion time of its own job. In the game, players may follow selfish strategies to optimize their cost and therefore their behaviors do not necessarily lead the game to an equilibrium. Even in the case there is an equilibrium, its makespan might be much larger than the social optimum, and this inefficiency is measured by the price of anarchy - the worst ratio between the makespan of an equilibrium and the optimum. Coordination mechanisms aim to reduce the price of anarchy by designing scheduling policies that specify how jobs assigned to a same machine are to be scheduled. Typically these policies define the schedule according to the processing times as announced by the jobs. One could wonder if there are policies that do not require this knowledge, and still provide a good price of anarchy. This would make the processing times be private information and avoid the problem of truthfulness. In this paper we study these so-called non-clairvoyant policies. In particular, we study the RANDOM policy that schedules the jobs in a random order without preemption, and the EQUI policy that schedules the jobs in parallel using time-multiplexing, assigning each job an equal fraction of CPU time.
Reinforcement learning in scheduling
NASA Technical Reports Server (NTRS)
Dietterich, Tom G.; Ok, Dokyeong; Zhang, Wei; Tadepalli, Prasad
1994-01-01
The goal of this research is to apply reinforcement learning methods to real-world problems like scheduling. In this preliminary paper, we show that learning to solve scheduling problems such as the Space Shuttle Payload Processing and the Automatic Guided Vehicle (AGV) scheduling can be usefully studied in the reinforcement learning framework. We discuss some of the special challenges posed by the scheduling domain to these methods and propose some possible solutions we plan to implement.
The home health care routing and scheduling problem with interdependent services.
Mankowska, Dorota Slawa; Meisel, Frank; Bierwirth, Christian
2014-03-01
This paper presents a model for the daily planning of health care services carried out at patients' homes by staff members of a home care company. The planning takes into account individual service requirements of the patients, individual qualifications of the staff and possible interdependencies between different service operations. Interdependencies of services can include, for example, a temporal separation of two services as is required if drugs have to be administered a certain time before providing a meal. Other services like handling a disabled patient may require two staff members working together at a patient's home. The time preferences of patients are included in terms of given time windows. In this paper, we propose a planning approach for the described problem, which can be used for optimizing economical and service oriented measures of performance. A mathematical model formulation is proposed together with a powerful heuristic based on a sophisticated solution representation. PMID:23780750
Integrated resource scheduling in a distributed scheduling environment
NASA Technical Reports Server (NTRS)
Zoch, David; Hall, Gardiner
1988-01-01
The Space Station era presents a highly-complex multi-mission planning and scheduling environment exercised over a highly distributed system. In order to automate the scheduling process, customers require a mechanism for communicating their scheduling requirements to NASA. A request language that a remotely-located customer can use to specify his scheduling requirements to a NASA scheduler, thus automating the customer-scheduler interface, is described. This notation, Flexible Envelope-Request Notation (FERN), allows the user to completely specify his scheduling requirements such as resource usage, temporal constraints, and scheduling preferences and options. The FERN also contains mechanisms for representing schedule and resource availability information, which are used in the inter-scheduler inconsistency resolution process. Additionally, a scheduler is described that can accept these requests, process them, generate schedules, and return schedule and resource availability information to the requester. The Request-Oriented Scheduling Engine (ROSE) was designed to function either as an independent scheduler or as a scheduling element in a network of schedulers. When used in a network of schedulers, each ROSE communicates schedule and resource usage information to other schedulers via the FERN notation, enabling inconsistencies to be resolved between schedulers. Individual ROSE schedules are created by viewing the problem as a constraint satisfaction problem with a heuristically guided search strategy.
NASA Astrophysics Data System (ADS)
Hasani, Keramat; Kravchenko, Svetlana A.; Werner, Frank
2016-01-01
This article considers the problem of scheduling a given set of n jobs on two identical parallel machines with a single server. Each job must be processed on one of the machines. Before processing, the server has to set up the relevant machine. The objective is to minimize the makespan. For this unary NP-hard problem, two fast constructive algorithms with a complexity of O(n2) are presented. The performance of these algorithms is evaluated for instances with up to 10,000 jobs. Computational results indicate that the algorithms have an excellent performance for very large instances so that the obtained objective function values are very close to a lower bound, and in many cases even an optimal solution is achieved. Superiority over all existing algorithms is obtained by sequencing the jobs on the two machines so that the machine idle time and the server waiting time are minimized. In doing so, the characteristics of an optimal solution resulting from its relevant lower bound are taken into account.
The Ames-Lockheed orbiter processing scheduling system
NASA Technical Reports Server (NTRS)
Zweben, Monte; Gargan, Robert
1991-01-01
A general purpose scheduling system and its application to Space Shuttle Orbiter Processing at the Kennedy Space Center (KSC) are described. Orbiter processing entails all the inspection, testing, repair, and maintenance necessary to prepare the Shuttle for launch and takes place within the Orbiter Processing Facility (OPF) at KSC, the Vehicle Assembly Building (VAB), and on the launch pad. The problems are extremely combinatoric in that there are thousands of tasks, resources, and other temporal considerations that must be coordinated. Researchers are building a scheduling tool that they hope will be an integral part of automating the planning and scheduling process at KSC. The scheduling engine is domain independent and is also being applied to Space Shuttle cargo processing problems as well as wind tunnel scheduling problems.
NASA Astrophysics Data System (ADS)
Kaplan, Sezgin; Rabadi, Ghaith
2013-01-01
This article addresses the aerial refuelling scheduling problem (ARSP), where a set of fighter jets (jobs) with certain ready times must be refuelled from tankers (machines) by their due dates; otherwise, they reach a low fuel level (deadline) incurring a high cost. ARSP is an identical parallel machine scheduling problem with release times and due date-to-deadline windows to minimize the total weighted tardiness. A simulated annealing (SA) and metaheuristic for randomized priority search (Meta-RaPS) with the newly introduced composite dispatching rule, apparent piecewise tardiness cost with ready times (APTCR), are applied to the problem. Computational experiments compared the algorithms' solutions to optimal solutions for small problems and to each other for larger problems. To obtain optimal solutions, a mixed integer program with a piecewise weighted tardiness objective function was solved for up to 12 jobs. The results show that Meta-RaPS performs better in terms of average relative error but SA is more efficient.
ERIC Educational Resources Information Center
Davis, Harold S.; Bechard, Joseph E.
A flexible schedule allows teachers to change group size, group composition, and class length according to the purpose of the lesson. This pamphlet presents various "master" schedules for flexible scheduling: (1) Simple block schedules, (2) back-to-back schedules, (3) interdisciplinary schedules, (4) school-wide block schedules, (5) open-lab…
NASA Technical Reports Server (NTRS)
Rash, James L.
2010-01-01
NASA's space data-communications infrastructure, the Space Network and the Ground Network, provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft via orbiting relay satellites and ground stations. An implementation of the methods and algorithms disclosed herein will be a system that produces globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary search, a class of probabilistic strategies for searching large solution spaces, constitutes the essential technology in this disclosure. Also disclosed are methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithm itself. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally, with applicability to a very broad class of combinatorial optimization problems.
Parallel scheduling algorithms
Dekel, E.; Sahni, S.
1983-01-01
Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms. 26 references.
NASA Astrophysics Data System (ADS)
Iñarrea, Manuel; Lanchares, Víctor; Palacián, Jesús F.; Pascual, Ana I.; Salas, J. Pablo; Yanguas, Patricia
In order to analyse the dynamics of a given Hamiltonian system in the space defined as the Cartesian product of two spheres, we propose to combine Delaunay coordinates with Poincaré-like coordinates. The coordinates are of local character and have to be selected accordingly with the type of motions one has to take into consideration, so we distinguish the following types: (i) rectilinear motions; (ii) circular and equatorial motions; (iii) circular non-equatorial motions; (iv) non-circular equatorial motions; and (v) non-circular and non-equatorial motions. We apply the theory to study the dynamics of the reduced flow of a generalised Størmer problem that is modelled as a perturbation of the Kepler problem. After using averaging and reduction theories, the corresponding flow is analysed on the manifold S×S, calculating the occurring equilibria and their stability. Finally, the flow of the original problem is reconstructed, concluding the existence of some families of periodic solutions and KAM tori.
Analyzing Group Coordination when Solving Geometry Problems with Dynamic Geometry Software
ERIC Educational Resources Information Center
Oner, Diler
2013-01-01
In CSCL research, collaborative activity is conceptualized along various yet intertwined dimensions. When functioning within these multiple dimensions, participants make use of several resources, which can be social or content-related (and sometimes temporal) in nature. It is the effective coordination of these resources that appears to…
Preventing Alcohol-Related Problems on Campus: Acquaintance Rape. A Guide for Program Coordinators.
ERIC Educational Resources Information Center
Finn, Peter
This is a guide for college and university program coordinators and planning committees on how to establish, expand, or improve a program on the prevention of acquaintance rape. Information is given for Presidents, Vice Presidents, and Deans on the relationship between acquaintance rape and alcohol, reasons for top administrators to become…
Scaling Up Coordinate Descent Algorithms for Large ℓ1 Regularization Problems
Scherrer, Chad; Halappanavar, Mahantesh; Tewari, Ambuj; Haglin, David J.
2012-07-03
We present a generic framework for parallel coordinate descent (CD) algorithms that has as special cases the original sequential algorithms of Cyclic CD and Stochastic CD, as well as the recent parallel Shotgun algorithm of Bradley et al. We introduce two novel parallel algorithms that are also special cases---Thread-Greedy CD and Coloring-Based CD---and give performance measurements for an OpenMP implementation of these.
Tao, Liang; McCurdy, C.W.; Rescigno, T.N.
2008-11-25
We show how to combine finite elements and the discrete variable representation in prolate spheroidal coordinates to develop a grid-based approach for quantum mechanical studies involving diatomic molecular targets. Prolate spheroidal coordinates are a natural choice for diatomic systems and have been used previously in a variety of bound-state applications. The use of exterior complex scaling in the present implementation allows for a transparently simple way of enforcing Coulomb boundary conditions and therefore straightforward application to electronic continuum problems. Illustrative examples involving the bound and continuum states of H2+, as well as the calculation of photoionization cross sections, show that the speed and accuracy of the present approach offer distinct advantages over methods based on single-center expansions.
Scheduling Jobs with Genetic Algorithms
NASA Astrophysics Data System (ADS)
Ferrolho, António; Crisóstomo, Manuel
Most scheduling problems are NP-hard, the time required to solve the problem optimally increases exponentially with the size of the problem. Scheduling problems have important applications, and a number of heuristic algorithms have been proposed to determine relatively good solutions in polynomial time. Recently, genetic algorithms (GA) are successfully used to solve scheduling problems, as shown by the growing numbers of papers. GA are known as one of the most efficient algorithms for solving scheduling problems. But, when a GA is applied to scheduling problems various crossovers and mutations operators can be applicable. This paper presents and examines a new concept of genetic operators for scheduling problems. A software tool called hybrid and flexible genetic algorithm (HybFlexGA) was developed to examine the performance of various crossover and mutation operators by computing simulations of job scheduling problems.
Investigations in the problem of pion condensation using generator co-ordinate methods
NASA Astrophysics Data System (ADS)
Chattopadhyay, P.; Da Providencia, J.
1981-11-01
Pion condensation in neutron matter has been investigated using the generator coordinate method and a simple p-wave interaction. The assumption of a condensed mode corresponding to one pion momentum (determined variationally) helps evaluate all the necessary matrix elements exactly. The technique of charge projection from a coherent state of negative pions is discussed, and calculations have been carried out for the cases of average charge conservation, charge projection before variation and for a charge conserving trial function. The ground-state energies and the lowest excitations of the system are obtained from numerical solutions of the Hill-Wheeler equation.
A note on problems in 3D boundary layer computations in streamline coordinates
NASA Astrophysics Data System (ADS)
Scholtysik, M.; Bettelini, M.; Fanneløp, T. K.
1994-01-01
Turbulent boundary layers with convergent and divergent external streamlines over a flat plate in the neighbourhood of a plane of symmetry have been computed using a finite-difference method based on streamline coordinates. While the results for the divergent case are generally satisfactory, error growth has been observed for the convergent flowfield. This is most pronounced near the lateral boundary of the computational domain, but also occurs in the plane of symmetry. As an ad-hoc engineering solution, a modified and more restrictive definition of the domain of dependence is proposed, which eliminates the part of the computational domain where the largest error growth occurs. The observed tendency to instability in the convergent case is confirmed by a simplified stability analysis after von Neumann of the uncoupled governing equations.
A Comparison of Techniques for Scheduling Earth-Observing Satellites
NASA Technical Reports Server (NTRS)
Globus, Al; Crawford, James; Lohn, Jason; Pryor, Anna
2004-01-01
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks, conditions where evolutionary and related algorithms are often effective. However, there are many such algorithms and the best one to use is not clear. Here we compare multiple variants of the genetic algorithm: stochastic hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on ten realistically-sized EOS scheduling problems. Schedules are represented by a permutation (non-temperal ordering) of the observation requests. A simple deterministic scheduler assigns times and resources to each observation request in the order indicated by the permutation, discarding those that violate the constraints created by previously scheduled observations. Simulated annealing performs best. Random mutation outperform a more 'intelligent' mutator. Furthermore, the best mutator, by a small margin, was a novel approach we call temperature dependent random sampling that makes large changes in the early stages of evolution and smaller changes towards the end of search.
Preventing Alcohol-Related Problems on Campus: Impaired Driving. A Guide for Program Coordinators.
ERIC Educational Resources Information Center
DeJong, William
This guide presents detailed descriptions of potentially effective approaches to preventing impaired driving by college students due to alcohol abuse. Chapter 1 provides an overview of alcohol-impaired driving and discusses changes in public attitudes, the scope of the problem, involvement of teens and young adults, and the challenge of reaching…
Jelsma, Dorothee; Geuze, Reint H; Mombarg, Remo; Smits-Engelsman, Bouwien C M
2014-02-01
The aim of this study was to examine differences in the performance of children with probable Developmental Coordination Disorder (p-DCD) and balance problems (BP) and typical developing children (TD) on a Wii Fit task and to measure the effect on balance skills after a Wii Fit intervention. Twenty-eight children with BP and 20 TD-children participated in the study. Motor performance was assessed with the Movement Assessment Battery for Children (MABC2), three subtests of the Bruininks Oseretsky Test (BOT2): Bilateral Coordination, Balance and Running Speed & Agility, and a Wii Fit ski slalom test. The TD children and half of the children in the BP group were tested before and after a 6weeks non-intervention period. All children with BP received 6weeks of Wii Fit intervention (with games other than the ski game) and were tested before and afterwards. Children with BP were less proficient than TD children in playing the Wii Fit ski slalom game. Training with the Wii Fit improved their motor performance. The improvement was significantly larger after intervention than after a period of non-intervention. Therefore the change cannot solely be attributed to spontaneous development or test-retest effect. Nearly all children enjoyed participation during the 6weeks of intervention. Our study shows that Wii Fit intervention is effective and is potentially a method to support treatment of (dynamic) balance control problems in children. PMID:24444657
NASA Technical Reports Server (NTRS)
Messing, Fredric
1993-01-01
This paper provides an analytical formulation to predict scheduling success for a class of problems frequently referred to as activity scheduling. Space Network communications scheduling is an example of activity scheduling. The principal assumption is that the activity start times are randomly distributed over the available time in the time line. The formulation makes it possible to estimate how much of the demand can be scheduled as a function of the demand, number of resources, activity duration, and activity flexibility. The paper includes computed results for a variety of resource and demand conditions. The results demonstrate that even with highly flexible activities, it is difficult to schedule demand greater than 60 percent of resources without the use of optimization and conflict resolution capabilities in the scheduling system.
van den Heuvel, Meta; Jansen, Danielle E M C; Reijneveld, Sijmen A; Flapper, Boudien C T; Smits-Engelsman, Bouwien C M
2016-01-01
Current evidence on the co-occurrence of Developmental Coordination Disorder (DCD) and psychosocial problems mainly concerns parent-reported information, but rarely includes teacher information. The aim of this study was (1) to investigate the teachers' identification of emotional and behavioral problems in children with DCD and (2) to examine the performance of the teacher version of the Strengths and Difficulties Questionnaire (SDQ-T) compared with the Teacher Report Form (TRF) in children with DCD. We assessed primary school children (202 boys, 200 girls, range 4-10.8 years, mean age 7.2 years) for DCD following the DSM IV-TR criteria. Emotional and behavioral problems were measured with the TRF (n=327) and the SDQ-T (n=361). DCD was established in 23 (5.7%) children, 16 boys and 7 girls (mean age 7.0 years). Children with DCD had a higher proportion of clinical scores on both the TRF Total Problem Scale (TRF TPS) and SDQ-T Total Difficulties Score (SDQ-T TDS). Children with DCD had increased odds on the TRF domains Thought (odds ratio, OR: 5.39), Externalizing (OR: 4.12) and Internalizing (OR: 4.42) problems, and on all SDQ-T-domains and Total Difficulties score (OR: 7.30). In the DCD group the SDQ-T TDS correlated strongly (Spearman's rho 0.80) with the TRF TPS and demonstrated a moderate agreement (Cohen's Kappa 0.53). In conclusion, teachers identified significantly more emotional and behavioral problems in children with DCD compared with their peers. The SDQ-T showed moderate agreement with the TRF in identifying emotional and behavioral problems in children with DCD. PMID:26780353
Automated Scheduling Via Artificial Intelligence
NASA Technical Reports Server (NTRS)
Biefeld, Eric W.; Cooper, Lynne P.
1991-01-01
Artificial-intelligence software that automates scheduling developed in Operations Mission Planner (OMP) research project. Software used in both generation of new schedules and modification of existing schedules in view of changes in tasks and/or available resources. Approach based on iterative refinement. Although project focused upon scheduling of operations of scientific instruments and other equipment aboard spacecraft, also applicable to such terrestrial problems as scheduling production in factory.
Scheduling Earth Observing Satellites with Evolutionary Algorithms
NASA Technical Reports Server (NTRS)
Globus, Al; Crawford, James; Lohn, Jason; Pryor, Anna
2003-01-01
We hypothesize that evolutionary algorithms can effectively schedule coordinated fleets of Earth observing satellites. The constraints are complex and the bottlenecks are not well understood, a condition where evolutionary algorithms are often effective. This is, in part, because evolutionary algorithms require only that one can represent solutions, modify solutions, and evaluate solution fitness. To test the hypothesis we have developed a representative set of problems, produced optimization software (in Java) to solve them, and run experiments comparing techniques. This paper presents initial results of a comparison of several evolutionary and other optimization techniques; namely the genetic algorithm, simulated annealing, squeaky wheel optimization, and stochastic hill climbing. We also compare separate satellite vs. integrated scheduling of a two satellite constellation. While the results are not definitive, tests to date suggest that simulated annealing is the best search technique and integrated scheduling is superior.
NASA Technical Reports Server (NTRS)
Wang, Yeou-Fang; Baldwin, John
2007-01-01
TIGRAS is client-side software, which provides tracking-station equipment planning, allocation, and scheduling services to the DSMS (Deep Space Mission System). TIGRAS provides functions for schedulers to coordinate the DSN (Deep Space Network) antenna usage time and to resolve the resource usage conflicts among tracking passes, antenna calibrations, maintenance, and system testing activities. TIGRAS provides a fully integrated multi-pane graphical user interface for all scheduling operations. This is a great improvement over the legacy VAX VMS command line user interface. TIGRAS has the capability to handle all DSN resource scheduling aspects from long-range to real time. TIGRAS assists NASA mission operations for DSN tracking of station equipment resource request processes from long-range load forecasts (ten years or longer), to midrange, short-range, and real-time (less than one week) emergency tracking plan changes. TIGRAS can be operated by NASA mission operations worldwide to make schedule requests for the DSN station equipment.
Whitley, L. Darrell; Watson, Jean-Paul; Howe, Adele E.
2005-06-01
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art performance levels on a range of academic and real-world problems. Yet, despite these successes, remarkably little research has been devoted to developing an understanding of why tabu search is so effective on this problem class. In this paper, we report results that provide significant progress in this direction. We consider Nowicki and Smutnicki's i-TSAB tabu search algorithm, which represents the current state-of-the-art for the makespan-minimization form of the classical jobshop scheduling problem. Via a series of controlled experiments, we identify those components of i-TSAB that enable it to achieve state-of-the-art performance levels. In doing so, we expose a number of misconceptions regarding the behavior and/or benefits of tabu search and other local search metaheuristics for the job-shop problem. Our results also serve to focus future research, by identifying those specific directions that are most likely to yield further improvements in performance.
Ostojić, Ljerka; Clayton, Nicola S
2014-03-01
The process of domestication has arguably provided dogs (Canis familiaris) with decreased emotional reactivity (reduced fear and aggression) and increased socio-cognitive skills adaptive for living with humans. It has been suggested that dogs are uniquely equipped with abilities that have been identified as crucial in cooperative problem-solving, namely social tolerance and the ability to attend to other individuals' behaviour. Accordingly, dogs might be hypothesised to perform well in tasks in which they have to work together with a human partner. Recently, researchers have found that dogs successfully solved a simple cooperative task with another dog. Due to the simplicity of the task, this study was, however, unable to provide clear evidence as to whether the dogs' successful performance was based on the cognitive ability of behavioural coordination, namely the capacity to link task requirements to the necessity of adjusting one's actions to the partner's behaviour. Here, we tested dogs with the most commonly used cooperative task, appropriate to test behavioural coordination. In addition, we paired dogs with both a conspecific and a human partner. Although dogs had difficulties in inhibiting the necessary action when required to wait for their partner, they successfully attended to the two cues that predicted a successful outcome, namely their partner's behaviour and the incremental movement of rewards towards themselves. This behavioural coordination was shown with both a conspecific and a human partner, in line with the recent findings suggesting that dogs exhibit highly developed socio-cognitive skills in interactions with both humans and other dogs. PMID:23995845
Constrained Task Assignment and Scheduling On Networks of Arbitrary Topology
NASA Astrophysics Data System (ADS)
Jackson, Justin Patrick
This dissertation develops a framework to address centralized and distributed constrained task assignment and task scheduling problems. This framework is used to prove properties of these problems that can be exploited, develop effective solution algorithms, and to prove important properties such as correctness, completeness and optimality. The centralized task assignment and task scheduling problem treated here is expressed as a vehicle routing problem with the goal of optimizing mission time subject to mission constraints on task precedence and agent capability. The algorithm developed to solve this problem is able to coordinate vehicle (agent) timing for task completion. This class of problems is NP-hard and analytical guarantees on solution quality are often unavailable. This dissertation develops a technique for determining solution quality that can be used on a large class of problems and does not rely on traditional analytical guarantees. For distributed problems several agents must communicate to collectively solve a distributed task assignment and task scheduling problem. The distributed task assignment and task scheduling algorithms developed here allow for the optimization of constrained military missions in situations where the communication network may be incomplete and only locally known. Two problems are developed. The distributed task assignment problem incorporates communication constraints that must be satisfied; this is the Communication-Constrained Distributed Assignment Problem. A novel distributed assignment algorithm, the Stochastic Bidding Algorithm, solves this problem. The algorithm is correct, probabilistically complete, and has linear average-case time complexity. The distributed task scheduling problem addressed here is to minimize mission time subject to arbitrary predicate mission constraints; this is the Minimum-time Arbitrarily-constrained Distributed Scheduling Problem. The Optimal Distributed Non-sequential Backtracking Algorithm
Completable scheduling: An integrated approach to planning and scheduling
NASA Technical Reports Server (NTRS)
Gervasio, Melinda T.; Dejong, Gerald F.
1992-01-01
The planning problem has traditionally been treated separately from the scheduling problem. However, as more realistic domains are tackled, it becomes evident that the problem of deciding on an ordered set of tasks to achieve a set of goals cannot be treated independently of the problem of actually allocating resources to the tasks. Doing so would result in losing the robustness and flexibility needed to deal with imperfectly modeled domains. Completable scheduling is an approach which integrates the two problems by allowing an a priori planning module to defer particular planning decisions, and consequently the associated scheduling decisions, until execution time. This allows a completable scheduling system to maximize plan flexibility by allowing runtime information to be taken into consideration when making planning and scheduling decision. Furthermore, through the criteria of achievability placed on deferred decision, a completable scheduling system is able to retain much of the goal-directedness and guarantees of achievement afforded by a priori planning. The completable scheduling approach is further enhanced by the use of contingent explanation-based learning, which enables a completable scheduling system to learn general completable plans from example and improve its performance through experience. Initial experimental results show that completable scheduling outperforms classical scheduling as well as pure reactive scheduling in a simple scheduling domain.
NASA Astrophysics Data System (ADS)
Lai, Pik-Yin
Methods of statistical mechanics are applied to two important NP-complete combinatorial optimization problems. The first is the chromatic number problem which seeks the minimal number of colors necessary to color a graph such that no two sites connected by an edge have the same color. The second is partitioning of a graph into q equal subgraphs so as to minimize inter-subgraph connections. Both models are mapped into a frustrated Potts model which is related to the q-state Potts spin glass. For the first problem, we obtain very good agreement with numerical simulations and theoretical bounds using the annealed approximation. The quenched model is also discussed. For the second problem we obtain analytic and numerical results by evaluating the ground state energy of the q = 3 and 4 Potts spin glass using Parisi's replica symmetry breaking. We also performed some numerical simulations to test the theoretical result and obtained very good agreement. In the second part of the thesis, we simulate the Ising spin-glass model on a random lattice with a finite (average) coordination number and also on the Bethe lattice with various different boundary conditions. In particular, we calculate the overlap function P(q) for two independent samples. For the random lattice, the results are consistent with a spin-glass transition above which P(q) converges to a Dirac delta -function for large N (number of sites) and below which P(q) has in addition a long tail similar to previous results obtained for the infinite ranged model. For the Bethe lattice, we obtain results in the interior by discarding the two outer shells of the Cayley tree when calculating the thermal averages. For fixed (uncorrelated) boundary conditions, P(q) seems to converge to a delta -function even below the spin-glass transition whereas for a "closed" lattice (correlated boundary conditions) P(q) has a long tail similar to its behavior in the random lattice case.
NASA Technical Reports Server (NTRS)
Tanner, Steve; Hughes, Angi; Byrd, Jim
1987-01-01
Resupply scheduling for the Space Station presents some formidable logistics problems. One of the most basic problems is assigning supplies to a series of shuttle resupply missions. A prototype logistics expert system which constructs resupply schedules was developed. This prototype is able to reconstruct feasible resupply plans. In addition, analysts can use the system to evaluate the impact of adding, deleting or modifying launches, cargo space, experiments, etc.
Daveson, Barbara A.; Harding, Richard; Shipman, Cathy; Mason, Bruce L.; Epiphaniou, Eleni; Higginson, Irene J.; Ellis-Smith, Clare; Henson, Lesley; Munday, Dan; Nanton, Veronica; Dale, Jeremy R.; Boyd, Kirsty; Worth, Allison; Barclay, Stephen; Donaldson, Anne; Murray, Scott
2014-01-01
Objectives To develop a model of care coordination for patients living with advanced progressive illness and their unpaid caregivers, and to understand their perspective regarding care coordination. Design A prospective longitudinal, multi-perspective qualitative study involving a case-study approach. Methods Serial in-depth interviews were conducted, transcribed verbatim and then analyzed through open and axial coding in order to construct categories for three cases (sites). This was followed by continued thematic analysis to identify underlying conceptual coherence across all cases in order to produce one coherent care coordination model. Participants Fifty-six purposively sampled patients and 27 case-linked unpaid caregivers. Settings Three cases from contrasting primary, secondary and tertiary settings within Britain. Results Coordination is a deliberate cross-cutting action that involves high-quality, caring and well-informed staff, patients and unpaid caregivers who must work in partnership together across health and social care settings. For coordination to occur, it must be adequately resourced with efficient systems and services that communicate. Patients and unpaid caregivers contribute substantially to the coordination of their care, which is sometimes volunteered at a personal cost to them. Coordination is facilitated through flexible and patient-centered care, characterized by accurate and timely information communicated in a way that considers patients’ and caregivers’ needs, preferences, circumstances and abilities. Conclusions Within the midst of advanced progressive illness, coordination is a shared and complex intervention involving relational, structural and information components. Our study is one of the first to extensively examine patients’ and caregivers’ views about coordination, thus aiding conceptual fidelity. These findings can be used to help avoid oversimplifying a real-world problem, such as care coordination. Avoiding
State-based scheduling: An architecture for telescope observation scheduling
NASA Technical Reports Server (NTRS)
Muscettola, Nicola; Smith, Stephen F.
1989-01-01
The applicability of constraint-based scheduling, a methodology previously developed and validated in the domain of factory scheduling, is extended to problem domains that require attendance to a wider range of state-dependent constraints. The problem of constructing and maintaining a short-term observation schedule for the Hubble Space Telescope (HST), which typifies this type of domain is the focus of interest. The nature of the constraints encountered in the HST domain is examined, system requirements are discussed with respect to utilization of a constraint-based scheduling methodology in such domains, and a general framework for state-based scheduling is presented.
... Labor & birth > Scheduling a c-section Scheduling a c-section E-mail to a friend Please fill ... develop before she’s born. Why can scheduling a c-section for non-medical reasons be a problem? ...
Sun, Yan; Lang, Maoxiang; Wang, Danzhu
2016-01-01
The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing-Tianjin-Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study. PMID:27483294
Sun, Yan; Lang, Maoxiang; Wang, Danzhu
2016-01-01
The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing–Tianjin–Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study. PMID:27483294
Adaptive Parallel Job Scheduling with Flexible CoScheduling
Frachtenberg, Eitan; Feitelson, Dror; Petrini, Fabrizio; Fernandez, Juan
2005-11-01
Abstract—Many scientific and high-performance computing applications consist of multiple processes running on different processors that communicate frequently. Because of their synchronization needs, these applications can suffer severe performance penalties if their processes are not all coscheduled to run together. Two common approaches to coscheduling jobs are batch scheduling, wherein nodes are dedicated for the duration of the run, and gang scheduling, wherein time slicing is coordinated across processors. Both work well when jobs are load-balanced and make use of the entire parallel machine. However, these conditions are rarely met and most realistic workloads consequently suffer from both internal and external fragmentation, in which resources and processors are left idle because jobs cannot be packed with perfect efficiency. This situation leads to reduced utilization and suboptimal performance. Flexible CoScheduling (FCS) addresses this problem by monitoring each job’s computation granularity and communication pattern and scheduling jobs based on their synchronization and load-balancing requirements. In particular, jobs that do not require stringent synchronization are identified, and are not coscheduled; instead, these processes are used to reduce fragmentation. FCS has been fully implemented on top of the STORM resource manager on a 256-processor Alpha cluster and compared to batch, gang, and implicit coscheduling algorithms. This paper describes in detail the implementation of FCS and its performance evaluation with a variety of workloads, including large-scale benchmarks, scientific applications, and dynamic workloads. The experimental results show that FCS saturates at higher loads than other algorithms (up to 54 percent higher in some cases), and displays lower response times and slowdown than the other algorithms in nearly all scenarios.
NASA Astrophysics Data System (ADS)
Pei, Jun; Liu, Xinbao; Pardalos, Panos M.; Fan, Wenjuan; Wang, Ling; Yang, Shanlin
2016-03-01
Motivated by applications in manufacturing industry, we consider a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times. The objective is to minimise the makespan by making batching and sequencing decisions. The problem is formalised as a mixed integer programming model and proved to be strongly NP-hard. Some structural properties are presented for both the general case and a special case. Based on these properties, a lower bound is derived, and a novel two-phase heuristic (TP-H) is developed to solve the problem, which guarantees to obtain a worst case performance ratio of ?. Computational experiments with a set of different sizes of random instances are conducted to evaluate the proposed approach TP-H, which is superior to another two heuristics proposed in the literature. Furthermore, the experimental results indicate that TP-H can effectively and efficiently solve large-size problems in a reasonable time.
NASA Schedule Management Handbook
NASA Technical Reports Server (NTRS)
2011-01-01
The purpose of schedule management is to provide the framework for time-phasing, resource planning, coordination, and communicating the necessary tasks within a work effort. The intent is to improve schedule management by providing recommended concepts, processes, and techniques used within the Agency and private industry. The intended function of this handbook is two-fold: first, to provide guidance for meeting the scheduling requirements contained in NPR 7120.5, NASA Space Flight Program and Project Management Requirements, NPR 7120.7, NASA Information Technology and Institutional Infrastructure Program and Project Requirements, NPR 7120.8, NASA Research and Technology Program and Project Management Requirements, and NPD 1000.5, Policy for NASA Acquisition. The second function is to describe the schedule management approach and the recommended best practices for carrying out this project control function. With regards to the above project management requirements documents, it should be noted that those space flight projects previously established and approved under the guidance of prior versions of NPR 7120.5 will continue to comply with those requirements until project completion has been achieved. This handbook will be updated as needed, to enhance efficient and effective schedule management across the Agency. It is acknowledged that most, if not all, external organizations participating in NASA programs/projects will have their own internal schedule management documents. Issues that arise from conflicting schedule guidance will be resolved on a case by case basis as contracts and partnering relationships are established. It is also acknowledged and understood that all projects are not the same and may require different levels of schedule visibility, scrutiny and control. Project type, value, and complexity are factors that typically dictate which schedule management practices should be employed.
ERIC Educational Resources Information Center
van Waelvelde, Hilde; Oostra, Ann; DeWitte, Griet; van den Broeck, Christine; Jongmans, Marian J.
2010-01-01
Aim: The aim of this study was to investigate the stability of motor problems in a clinically referred sample of children with, or at risk of, autism spectrum disorders (ASDs), attention-deficit-hyperactivity disorder (ADHD), and/or developmental coordination disorder (DCD). Method: Participants were 49 children (39 males, 10 females; mean age 5y…
Planning and Scheduling for Environmental Sensor Networks
NASA Astrophysics Data System (ADS)
Frank, J. D.
2005-12-01
resources and to reduce the costs of communication. Planning and scheduling is generally a heavy consumer of time, memory and energy resources. This means careful thought must be given to how much planning and scheduling should be done on the sensors themselves, and how much to do elsewhere. The difficulty of planning and scheduling is exacerbated when reasoning about uncertainty. More time, memory and energy is needed to solve such problems, leading either to more expensive sensors, or suboptimal plans. For example, scientifically interesting events may happen at random times, making it difficult to ensure that sufficient resources are availanble. Since uncertainty is usually lowest in proximity to the sensors themselves, this argues for planning and scheduling onboard the sensors. However, cost minimization dictates sensors be kept as simple as possible, reducing the amount of planning and scheduling they can do themselves. Furthermore, coordinating each sensor's independent plans can be difficult. In the full presentation, we will critically review the planning and scheduling systems used by previously fielded sensor networks. We do so primarily from the perspective of the computational sciences, with a focus on taming computational complexity when operating sensor networks. The case studies are derived from sensor networks based on UAVs, satellites, and planetary rovers. Planning and scheduling considerations include multi-sensor coordination, optimizing science value, onboard power management, onboard memory, planning movement actions to acquire data, and managing communications.These case studies offer lessons for future designs of environmental sensor networks.
Artificial intelligence approaches to astronomical observation scheduling
NASA Technical Reports Server (NTRS)
Johnston, Mark D.; Miller, Glenn
1988-01-01
Automated scheduling will play an increasing role in future ground- and space-based observatory operations. Due to the complexity of the problem, artificial intelligence technology currently offers the greatest potential for the development of scheduling tools with sufficient power and flexibility to handle realistic scheduling situations. Summarized here are the main features of the observatory scheduling problem, how artificial intelligence (AI) techniques can be applied, and recent progress in AI scheduling for Hubble Space Telescope.
Zhang, Weizhe; Bai, Enci; He, Hui; Cheng, Albert M.K.
2015-01-01
Reducing energy consumption is becoming very important in order to keep battery life and lower overall operational costs for heterogeneous real-time multiprocessor systems. In this paper, we first formulate this as a combinatorial optimization problem. Then, a successful meta-heuristic, called Shuffled Frog Leaping Algorithm (SFLA) is proposed to reduce the energy consumption. Precocity remission and local optimal avoidance techniques are proposed to avoid the precocity and improve the solution quality. Convergence acceleration significantly reduces the search time. Experimental results show that the SFLA-based energy-aware meta-heuristic uses 30% less energy than the Ant Colony Optimization (ACO) algorithm, and 60% less energy than the Genetic Algorithm (GA) algorithm. Remarkably, the running time of the SFLA-based meta-heuristic is 20 and 200 times less than ACO and GA, respectively, for finding the optimal solution. PMID:26110406
Zhang, Weizhe; Bai, Enci; He, Hui; Cheng, Albert M K
2015-01-01
Reducing energy consumption is becoming very important in order to keep battery life and lower overall operational costs for heterogeneous real-time multiprocessor systems. In this paper, we first formulate this as a combinatorial optimization problem. Then, a successful meta-heuristic, called Shuffled Frog Leaping Algorithm (SFLA) is proposed to reduce the energy consumption. Precocity remission and local optimal avoidance techniques are proposed to avoid the precocity and improve the solution quality. Convergence acceleration significantly reduces the search time. Experimental results show that the SFLA-based energy-aware meta-heuristic uses 30% less energy than the Ant Colony Optimization (ACO) algorithm, and 60% less energy than the Genetic Algorithm (GA) algorithm. Remarkably, the running time of the SFLA-based meta-heuristic is 20 and 200 times less than ACO and GA, respectively, for finding the optimal solution. PMID:26110406
DTS: Building custom, intelligent schedulers
NASA Technical Reports Server (NTRS)
Hansson, Othar; Mayer, Andrew
1994-01-01
DTS is a decision-theoretic scheduler, built on top of a flexible toolkit -- this paper focuses on how the toolkit might be reused in future NASA mission schedulers. The toolkit includes a user-customizable scheduling interface, and a 'Just-For-You' optimization engine. The customizable interface is built on two metaphors: objects and dynamic graphs. Objects help to structure problem specifications and related data, while dynamic graphs simplify the specification of graphical schedule editors (such as Gantt charts). The interface can be used with any 'back-end' scheduler, through dynamically-loaded code, interprocess communication, or a shared database. The 'Just-For-You' optimization engine includes user-specific utility functions, automatically compiled heuristic evaluations, and a postprocessing facility for enforcing scheduling policies. The optimization engine is based on BPS, the Bayesian Problem-Solver (1,2), which introduced a similar approach to solving single-agent and adversarial graph search problems.
Kleck, W
1982-04-01
Structuring a schedule - whether by Critical Path Method (CPM) or Precedence Charting System (PCS) - involves estimating the duration of one or more activities and arranging them in the most logical sequence. Given the start date, the completion date is relatively simple to determine. What is then so complicated about the process. It is complicated by the people involved - the people who make the schedules and the people who attempt to follow them. Schedules are an essential part of project management and construction contract administration. Much of the material available pertains to the mechanics of schedules, the types of logic networks, the ways that data can be generated and presented. This paper sheds light on other facets of the subject - the statistical and philosophical fundamentals involved in scheduling.
Automated Platform Management System Scheduling
NASA Technical Reports Server (NTRS)
Hull, Larry G.
1990-01-01
The Platform Management System was established to coordinate the operation of platform systems and instruments. The management functions are split between ground and space components. Since platforms are to be out of contact with the ground more than the manned base, the on-board functions are required to be more autonomous than those of the manned base. Under this concept, automated replanning and rescheduling, including on-board real-time schedule maintenance and schedule repair, are required to effectively and efficiently meet Space Station Freedom mission goals. In a FY88 study, we developed several promising alternatives for automated platform planning and scheduling. We recommended both a specific alternative and a phased approach to automated platform resource scheduling. Our recommended alternative was based upon use of exactly the same scheduling engine in both ground and space components of the platform management system. Our phased approach recommendation was based upon evolutionary development of the platform. In the past year, we developed platform scheduler requirements and implemented a rapid prototype of a baseline platform scheduler. Presently we are rehosting this platform scheduler rapid prototype and integrating the scheduler prototype into two Goddard Space Flight Center testbeds, as the ground scheduler in the Scheduling Concepts, Architectures, and Networks Testbed and as the on-board scheduler in the Platform Management System Testbed. Using these testbeds, we will investigate rescheduling issues, evaluate operational performance and enhance the platform scheduler prototype to demonstrate our evolutionary approach to automated platform scheduling. The work described in this paper was performed prior to Space Station Freedom rephasing, transfer of platform responsibility to Code E, and other recently discussed changes. We neither speculate on these changes nor attempt to predict the impact of the final decisions. As a consequence some of our
NASA Technical Reports Server (NTRS)
Zweben, Monte
1991-01-01
The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.
NASA Technical Reports Server (NTRS)
Zweben, Monte
1993-01-01
The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.
NASA Technical Reports Server (NTRS)
Zweben, Monte
1991-01-01
The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocations for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its applications to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.
Enhanced Memetic Algorithm for Task Scheduling
NASA Astrophysics Data System (ADS)
Padmavathi, S.; Shalinie, S. Mercy; Someshwar, B. C.; Sasikumar, T.
Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelization. Due to the NP-hardness of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. This paper proposes a Memetic algorithm with Tabu search and Simulated Annealing as local search for solving Task scheduling problem considering communication contention. This problem consists of finding a schedule for a general task graph to be executed on a cluster of workstations and hence the schedule length can be minimized. Our approach combines local search (by self experience) and global search (by neighboring experience) possessing high search efficiency. The proposed approach is compared with existing list scheduling heuristics. The numerical results clearly indicate that our proposed approach produces solutions which are closer to optimality and/or better quality than the existing list scheduling heuristics.
Scheduling: A guide for program managers
NASA Technical Reports Server (NTRS)
1994-01-01
The following topics are discussed concerning scheduling: (1) milestone scheduling; (2) network scheduling; (3) program evaluation and review technique; (4) critical path method; (5) developing a network; (6) converting an ugly duckling to a swan; (7) network scheduling problem; (8) (9) network scheduling when resources are limited; (10) multi-program considerations; (11) influence on program performance; (12) line-of-balance technique; (13) time management; (14) recapitulization; and (15) analysis.
Training and Operations Integrated Calendar Scheduler - TROPICS
J.E. Oppenlander; A.J. Levy; V.A. Arbige; A.H. Shoop
2003-01-27
TROPICS is a rule-based scheduling system that optimizes the training experience for students in a power (note this change should be everywhere, i.e. Not reactor) plant environment. The problem is complicated by the condition that plant resources and users' time must be simultaneously scheduled to make best use of both. The training facility is highly constrained in how it is used, and, as in many similar environments, subject to dynamic change with little or no advance notice. The flexibility required extends to changes resulting from students' actions such as absences. Even though the problem is highly constrained by plant usage and student objectives, the large number of possible schedules is a concern. TROPICS employs a control strategy for rule firing to prune the possibility tree and avoid combinatorial explosion. The application has been in use since 1996, first as a prototype for testing and then in production. Training Coordinators have a philosophical aspect to teaching students that has made the rule-based approach much more verifiable and satisfying to the domain experts than other forms of capturing expertise.
ERIC Educational Resources Information Center
Berteotti, Carol R.; And Others
Using an evaluation of a hospital-based hospice as a case study, this paper analyzes problematic issues surrounding health care teams (HCTs) in light of findings revealed in the literature concerning HCT structures and processes. The factors of coordination and role definitions in HCTs and their manifestations in a particular hospice HCT in terms…
Amirghasemi, Mehrdad; Zamani, Reza
2014-01-01
This paper presents an effective procedure for solving the job shop problem. Synergistically combining small and large neighborhood schemes, the procedure consists of four components, namely (i) a construction method for generating semi-active schedules by a forward-backward mechanism, (ii) a local search for manipulating a small neighborhood structure guided by a tabu list, (iii) a feedback-based mechanism for perturbing the solutions generated, and (iv) a very large-neighborhood local search guided by a forward-backward shifting bottleneck method. The combination of shifting bottleneck mechanism and tabu list is used as a means of the manipulation of neighborhood structures, and the perturbation mechanism employed diversifies the search. A feedback mechanism, called repeat-check, detects consequent repeats and ignites a perturbation when the total number of consecutive repeats for two identical makespan values reaches a given threshold. The results of extensive computational experiments on the benchmark instances indicate that the combination of these four components is synergetic, in the sense that they collectively make the procedure fast and robust. PMID:24808999
User requirements for a patient scheduling system
NASA Technical Reports Server (NTRS)
Zimmerman, W.
1979-01-01
A rehabilitation institute's needs and wants from a scheduling system were established by (1) studying the existing scheduling system and the variables that affect patient scheduling, (2) conducting a human-factors study to establish the human interfaces that affect patients' meeting prescribed therapy schedules, and (3) developing and administering a questionnaire to the staff which pertains to the various interface problems in order to identify staff requirements to minimize scheduling problems and other factors that may limit the effectiveness of any new scheduling system.
Tao, Liang; McCurdy, Bill; Rescigno, Tom
2010-06-10
Our previously developed finite-element/ discrete variable representation in prolate spheroidal coordinates is extended to two-electron systems with a study of double ionization of H$_2$ with fixed-nuclei. Particular attention is paid to the development of fast and accurate methods for treating the electron-electron interaction. The use of exterior complex scaling in the implementation offers a simple way of enforcing Coulomb boundary conditions for the electronic double continuum. While the angular distributions calculated in this study are found to be completely consistent with our earlier treatments that employed single-center expansions in spherical coordinates, we find that the magnitude of the integrated cross sections are sensitive to small changes in the initial-state wave function. The present formulation offers significant advantages with respect to convergence and efficiency and opens the way to calculations on more complicated diatomic targets.
ERIC Educational Resources Information Center
Iversen, Synnove; Knivsberg, Ann-Mari; Ellertsen, Bjorn; Nodland, Magne; Larsen, Tommy Bade
2006-01-01
Incidence, severity and types of motor difficulties in children with severe behavioural and emotional problems were evaluated. A group of 6-year-olds (n = 29) with such problems and controls (n = 29) were compared on the Movement Assessment Battery for Children (M-ABC). The groups were compared on total scores as well as manual dexterity, ball…
Coordinating Shared Activities
NASA Technical Reports Server (NTRS)
Clement, Bradley
2004-01-01
Shared Activity Coordination (ShAC) is a computer program for planning and scheduling the activities of an autonomous team of interacting spacecraft and exploratory robots. ShAC could also be adapted to such terrestrial uses as helping multiple factory managers work toward competing goals while sharing such common resources as floor space, raw materials, and transports. ShAC iteratively invokes the Continuous Activity Scheduling Planning Execution and Replanning (CASPER) program to replan and propagate changes to other planning programs in an effort to resolve conflicts. A domain-expert specifies which activities and parameters thereof are shared and reports the expected conditions and effects of these activities on the environment. By specifying these conditions and effects differently for each planning program, the domain-expert subprogram defines roles that each spacecraft plays in a coordinated activity. The domain-expert subprogram also specifies which planning program has scheduling control over each shared activity. ShAC enables sharing of information, consensus over the scheduling of collaborative activities, and distributed conflict resolution. As the other planning programs incorporate new goals and alter their schedules in the changing environment, ShAC continually coordinates to respond to unexpected events.
Scheduling with genetic algorithms
NASA Technical Reports Server (NTRS)
Fennel, Theron R.; Underbrink, A. J., Jr.; Williams, George P. W., Jr.
1994-01-01
In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.
Development of Watch Schedule Using Rules Approach
NASA Astrophysics Data System (ADS)
Jurkevicius, Darius; Vasilecas, Olegas
The software for schedule creation and optimization solves a difficult, important and practical problem. The proposed solution is an online employee portal where administrator users can create and manage watch schedules and employee requests. Each employee can login with his/her own account and see his/her assignments, manage requests, etc. Employees set as administrators can perform the employee scheduling online, manage requests, etc. This scheduling software allows users not only to see the initial and optimized watch schedule in a simple and understandable form, but also to create special rules and criteria and input their business. The system using rules automatically will generate watch schedule.
NASA Astrophysics Data System (ADS)
Li, Chen; Lu, Zhiqiang; Han, Xiaole; Zhang, Yuejun; Wang, Li
2016-03-01
The integrated scheduling of container handling systems aims to optimize the coordination and overall utilization of all handling equipment, so as to minimize the makespan of a given set of container tasks. A modified disjunctive graph is proposed and a mixed 0-1 programming model is formulated. A heuristic algorithm is presented, in which the original problem is divided into two subproblems. In the first subproblem, contiguous bay crane operations are applied to obtain a good quay crane schedule. In the second subproblem, proper internal truck and yard crane schedules are generated to match the given quay crane schedule. Furthermore, a genetic algorithm based on the heuristic algorithm is developed to search for better solutions. The computational results show that the proposed algorithm can efficiently find high-quality solutions. They also indicate the effectiveness of simultaneous loading and discharging operations compared with separate ones.
Intelligent perturbation algorithms for space scheduling optimization
NASA Technical Reports Server (NTRS)
Kurtzman, Clifford R.
1991-01-01
Intelligent perturbation algorithms for space scheduling optimization are presented in the form of the viewgraphs. The following subject areas are covered: optimization of planning, scheduling, and manifesting; searching a discrete configuration space; heuristic algorithms used for optimization; use of heuristic methods on a sample scheduling problem; intelligent perturbation algorithms are iterative refinement techniques; properties of a good iterative search operator; dispatching examples of intelligent perturbation algorithm and perturbation operator attributes; scheduling implementations using intelligent perturbation algorithms; major advances in scheduling capabilities; the prototype ISF (industrial Space Facility) experiment scheduler; optimized schedule (max revenue); multi-variable optimization; Space Station design reference mission scheduling; ISF-TDRSS command scheduling demonstration; and example task - communications check.
Scheduler Design Criteria: Requirements and Considerations
NASA Technical Reports Server (NTRS)
Lee, Hanbong
2016-01-01
This presentation covers fundamental requirements and considerations for developing schedulers in airport operations. We first introduce performance and functional requirements for airport surface schedulers. Among various optimization problems in airport operations, we focus on airport surface scheduling problem, including runway and taxiway operations. We then describe a basic methodology for airport surface scheduling such as node-link network model and scheduling algorithms previously developed. Next, we explain how to design a mathematical formulation in more details, which consists of objectives, decision variables, and constraints. Lastly, we review other considerations, including optimization tools, computational performance, and performance metrics for evaluation.
Decomposability and scalability in space-based observatory scheduling
NASA Technical Reports Server (NTRS)
Muscettola, Nicola; Smith, Stephen F.
1992-01-01
In this paper, we discuss issues of problem and model decomposition within the HSTS scheduling framework. HSTS was developed and originally applied in the context of the Hubble Space Telescope (HST) scheduling problem, motivated by the limitations of the current solution and, more generally, the insufficiency of classical planning and scheduling approaches in this problem context. We first summarize the salient architectural characteristics of HSTS and their relationship to previous scheduling and AI planning research. Then, we describe some key problem decomposition techniques supported by HSTS and underlying our integrated planning and scheduling approach, and we discuss the leverage they provide in solving space-based observatory scheduling problems.
ASTER Scheduling Prioritization Function
NASA Technical Reports Server (NTRS)
Cohen, Ron
1996-01-01
ASTER schedules are generated by an automated scheduling system. This scheduler will generate psuedo-optimal schedules based on a priority scheme. This priority scheme is controlled by the Science Team.
Scheduling for indoor visible light communication based on graph theory.
Tao, Yuyang; Liang, Xiao; Wang, Jiaheng; Zhao, Chunming
2015-02-01
Visible light communication (VLC) has drawn much attention in the field of high-rate indoor wireless communication. While most existing works focused on point-to-point VLC technologies, few studies have concerned multiuser VLC, where multiple optical access points (APs) transmit data to multiple user receivers. In such scenarios, inter-user interference constitutes the major factor limiting the system performance. Therefore, a proper scheduling scheme has to be proposed to coordinate the interference and optimize the whole system performance. In this work, we aim to maximize the sum rate of the system while taking into account user fairness by appropriately assigning LED lamps to multiple users. The formulated scheduling problem turns out to be a maximum weighted independent set problem. We then propose a novel and efficient resource allocation method based on graph theory to achieve high sum rates. Moreover, we also introduce proportional fairness into our scheduling scheme to ensure the user fairness. Our proposed scheduling scheme can, with low complexity, achieve more multiplexing gains, higher sum rate, and better fairness than the existing works. PMID:25836136
Scheduling Software for Complex Scenarios
NASA Technical Reports Server (NTRS)
2006-01-01
Preparing a vehicle and its payload for a single launch is a complex process that involves thousands of operations. Because the equipment and facilities required to carry out these operations are extremely expensive and limited in number, optimal assignment and efficient use are critically important. Overlapping missions that compete for the same resources, ground rules, safety requirements, and the unique needs of processing vehicles and payloads destined for space impose numerous constraints that, when combined, require advanced scheduling. Traditional scheduling systems use simple algorithms and criteria when selecting activities and assigning resources and times to each activity. Schedules generated by these simple decision rules are, however, frequently far from optimal. To resolve mission-critical scheduling issues and predict possible problem areas, NASA historically relied upon expert human schedulers who used their judgment and experience to determine where things should happen, whether they will happen on time, and whether the requested resources are truly necessary.
41 CFR 101-5.104-4 - Scheduling feasibility studies.
Code of Federal Regulations, 2013 CFR
2013-07-01
... 41 Public Contracts and Property Management 2 2013-07-01 2012-07-01 true Scheduling feasibility... FEDERAL BUILDINGS AND COMPLEXES 5.1-General § 101-5.104-4 Scheduling feasibility studies. The schedule of feasibility studies will be coordinated by GSA with its construction, space management, and...
41 CFR 101-5.104-4 - Scheduling feasibility studies.
Code of Federal Regulations, 2014 CFR
2014-07-01
... 41 Public Contracts and Property Management 2 2014-07-01 2012-07-01 true Scheduling feasibility... FEDERAL BUILDINGS AND COMPLEXES 5.1-General § 101-5.104-4 Scheduling feasibility studies. The schedule of feasibility studies will be coordinated by GSA with its construction, space management, and...
41 CFR 101-5.104-4 - Scheduling feasibility studies.
Code of Federal Regulations, 2012 CFR
2012-07-01
... 41 Public Contracts and Property Management 2 2012-07-01 2012-07-01 false Scheduling feasibility... FEDERAL BUILDINGS AND COMPLEXES 5.1-General § 101-5.104-4 Scheduling feasibility studies. The schedule of feasibility studies will be coordinated by GSA with its construction, space management, and...
Satellite mission scheduling algorithm based on GA
NASA Astrophysics Data System (ADS)
Sun, Baolin; Mao, Lifei; Wang, Wenxiang; Xie, Xing; Qin, Qianqing
2007-11-01
The Satellite Mission Scheduling problem (SMS) involves scheduling tasks to be performed by a satellite, where new task requests can arrive at any time, non-deterministically, and must be scheduled in real-time. This paper describes a new Satellite Mission Scheduling problem based on Genetic Algorithm (SMSGA). In this paper, it investigates algorithmic approaches for determining an optimal or near-optimal sequence of tasks, allocated to a satellite payload over time, with dynamic tasking considerations. The simulation results show that the proposed approach is effective and efficient in applications to the real problems.
Gang scheduling a parallel machine
Gorda, B.C.; Brooks, E.D. III.
1991-12-01
Program development on parallel machines can be a nightmare of scheduling headaches. We have developed a portable time sharing mechanism to handle the problem of scheduling gangs of processes. User programs and their gangs of processes are put to sleep and awakened by the gang scheduler to provide a time sharing environment. Time quantum are adjusted according to priority queues and a system of fair share accounting. The initial platform for this software is the 128 processor BBN TC2000 in use in the Massively Parallel Computing Initiative at the Lawrence Livermore National Laboratory.
Gang scheduling a parallel machine
Gorda, B.C.; Brooks, E.D. III.
1991-03-01
Program development on parallel machines can be a nightmare of scheduling headaches. We have developed a portable time sharing mechanism to handle the problem of scheduling gangs of processors. User program and their gangs of processors are put to sleep and awakened by the gang scheduler to provide a time sharing environment. Time quantums are adjusted according to priority queues and a system of fair share accounting. The initial platform for this software is the 128 processor BBN TC2000 in use in the Massively Parallel Computing Initiative at the Lawrence Livermore National Laboratory. 2 refs., 1 fig.
NASA Astrophysics Data System (ADS)
Holota, Petr; Nesvadba, Otakar
2015-04-01
In this paper the reciprocal distance is used for generating Galerkin's approximations in the weak solution of Neumann's problem that has an important role in Earth's gravity field studies. The reciprocal distance has a natural tie to the fundamental solution of Laplace's partial differential equation and in the paper it is represented by means of an expansion into a series of oblate spheroidal harmonics. Subsequently, the gradient vector of the reciprocal distance is constructed. In the computation of its components the expansion mentioned above is employed. The paper then focuses on the scalar product of reciprocal distance gradients in two different points and in particular on a series representation of a volume integral of the scalar product spread over an unbounded domain given by the exterior of an oblate spheroid (oblate ellipsoid of revolution). The integral yields the entries of Galerkin's matrix. The numerical interpretation of all the expansions used as well as the respective software implementation within the OpenCL framework is treated, which concerns also a numerical evaluation of Legendre functions of a real and an imaginary argument. In parallel an approximate closed formula expressing the entries of Galerkin's matrix (with an accuracy up to terms multiplied by the square of numerical eccentricity) is derived for convenience and comparison. The paper is added extensive numerical examples that illustrate the approach applied and demonstrate the accuracy of the derived formulas. Aspects related to practical applications are discussed.
Adventures in Coordinate Space
NASA Astrophysics Data System (ADS)
Chambers, J. E.
2003-08-01
A variety of coordinate systems have been used to study the N-body problem for cases involving a dominant central mass. These include the traditional Keplerian orbital elements and the canonical Delaunay variables, which both incorporate conserved quantities of the two-body problem. Recently, Cartesian coordinate systems have returned to favour with the rise of mixed-variable symplectic integrators, since these coordinates prove to be more efficient than using orbital elements. Three sets of canonical Cartesian coordinates are well known, each with its own advantages and disadvantages. Inertial coordinates (which include barycentric coordinates as a special case) are the simplest and easiest to implement. However, they suffer from the disadvantage that the motion of the central body must be calculated explicitly, leading to relatively large errors in general. Jacobi coordinates overcome this problem by replacing the coordinates and momenta of the central body with those of the system as a whole, so that momentum is conserved exactly. This leads to substantial improvements in accuracy, but has the disadvantage that every object is treated differently, and interactions between each pair of bodies are now expressed in a complicated manner involving the coordinates of many bodies. Canonical heliocentric coordinates (also known as democratic heliocentric coordinates) treat all bodies equally, and conserve the centre of mass motion, but at the cost of introducing momentum cross terms into the kinetic energy. This complicates the development of higher order symplectic integrators and symplectic correctors, as well as the development of methods used to resolve close encounters with the central body. Here I will re-examine the set of possible canonical Cartesian coordinate systems to determine if it is possible to (a) conserve the centre of mass motion, (b) treat all bodies equally, and (c) eliminate the momentum cross terms. I will demonstrate that this is indeed possible
Bridging the Gap Between Planning and Scheduling
NASA Technical Reports Server (NTRS)
Smith, David E.; Frank, Jeremy; Jonsson, Ari K.; Norvig, Peter (Technical Monitor)
2000-01-01
Planning research in Artificial Intelligence (AI) has often focused on problems where there are cascading levels of action choice and complex interactions between actions. In contrast. Scheduling research has focused on much larger problems where there is little action choice, but the resulting ordering problem is hard. In this paper, we give an overview of M planning and scheduling techniques, focusing on their similarities, differences, and limitations. We also argue that many difficult practical problems lie somewhere between planning and scheduling, and that neither area has the right set of tools for solving these vexing problems.
NASA Technical Reports Server (NTRS)
Chien, Steve A.; Tran, Daniel Q.; Rabideau, Gregg R.; Schaffer, Steven R.
2011-01-01
Software has been designed to schedule remote sensing with the Earth Observing One spacecraft. The software attempts to satisfy as many observation requests as possible considering each against spacecraft operation constraints such as data volume, thermal, pointing maneuvers, and others. More complex constraints such as temperature are approximated to enable efficient reasoning while keeping the spacecraft within safe limits. Other constraints are checked using an external software library. For example, an attitude control library is used to determine the feasibility of maneuvering between pairs of observations. This innovation can deal with a wide range of spacecraft constraints and solve large scale scheduling problems like hundreds of observations and thousands of combinations of observation sequences.
Future aircraft networks and schedules
NASA Astrophysics Data System (ADS)
Shu, Yan
2011-07-01
Because of the importance of air transportation scheduling, the emergence of small aircraft and the vision of future fuel-efficient aircraft, this thesis has focused on the study of aircraft scheduling and network design involving multiple types of aircraft and flight services. It develops models and solution algorithms for the schedule design problem and analyzes the computational results. First, based on the current development of small aircraft and on-demand flight services, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. This thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch under the model. In the first step, both a frequency assignment model for scheduled flights that incorporates a passenger path choice model and a frequency assignment model for on-demand flights that incorporates a passenger mode choice model are created. In the second step, a rough fleet assignment model that determines a set of flight legs, each of which is assigned an aircraft type and a rough departure time is constructed. In the third step, a timetable model that determines an exact departure time for each flight leg is developed. Based on the models proposed in the three steps, this thesis creates schedule design instances that involve almost all the major airports and markets in the United States. The instances of the frequency assignment model created in this thesis are large-scale non-convex mixed-integer programming problems, and this dissertation develops an overall network structure and proposes iterative algorithms for solving these instances. The instances of both the rough fleet assignment model and the timetable model created in this thesis are large-scale mixed-integer programming problems, and this dissertation develops subproblem schemes for solving these instances. Based on these solution algorithms, this dissertation also presents
Implementation of a Relay Coordination System for the Mars Network
NASA Technical Reports Server (NTRS)
Allard, Daniel A.
2010-01-01
Mars network relay operations involve the coordination of lander and orbiter teams through long-term and short-term planning, tactical changes and post-pass analysis. Much of this coordination is managed through email traffic and point-to-point file data exchanges. It is often difficult to construct a complete and accurate picture of the relay situation at any given moment, as there is no centralized store of correlated relay data. The Mars Relay Operations Service (MaROS) is being implemented to address the problem of relay coordination for current and next-generation relay missions. The service is provided for the purpose of coordinating communications sessions between landed spacecraft assets and orbiting spacecraft assets at Mars. The service centralizes a set of functions previously distributed across multiple spacecraft operations teams, and as such greatly improves visibility into the end-to-end strategic coordination process. Most of the process revolves around the scheduling of communications sessions between the spacecraft during periods of time when a landed asset on Mars is geometrically visible by an orbiting spacecraft. These "relay" sessions are used to transfer data both to and from the landed asset via the orbiting asset on behalf of Earth-based spacecraft operators. This paper will discuss the relay coordination problem space, overview the architecture and design selected to meet system requirements, and describe the first phase of system implementation
Developmental coordination disorder
Physical causes and other types of learning disabilities must be ruled out before the diagnosis can be confirmed. ... Developmental coordination disorder can lead to: Learning problems ... wanting to participate in physical activities (such as sports)
The Neural Network In Coordinate Transformation
NASA Astrophysics Data System (ADS)
Urusan, Ahmet Yucel
2011-12-01
In international literature, Coordinate operations is divided into two categories. They are coordinate conversion and coordinate transformation. Coordinates converted from coordinate system A to coordinate system B in the same datum (mean origine, scale and axis directions are same) by coordinate conversion. There are two different datum in coordinate transformation. The basis of each datum to a different coordinate reference system. In Coordinate transformation, coordinates are transformed from coordinate reference system A to coordinate referance system B. Geodetic studies based on physical measurements. Coordinate transformation needs identical points which were measured in each coordinate reference system (A and B). However it is difficult (and need a big reserved budget) to measure in some places like as top of mountain, boundry of countries and seaside. In this study, this sample problem solution was researched. The method of learning which is one of the neural network methods, was used for solution of this problem.
Dawn Usage, Scheduling, and Governance Model
Louis, S
2009-11-02
This document describes Dawn use, scheduling, and governance concerns. Users started running full-machine science runs in early April 2009 during the initial open shakedown period. Scheduling Dawn while in the Open Computing Facility (OCF) was controlled and coordinated via phone calls, emails, and a small number of controlled banks. With Dawn moving to the Secure Computing Facility (SCF) in fall of 2009, a more detailed scheduling and governance model is required. The three major objectives are: (1) Ensure Dawn resources are allocated on a program priority-driven basis; (2) Utilize Dawn resources on the job mixes for which they were intended; and (3) Minimize idle cycles through use of partitions, banks and proper job mix. The SCF workload for Dawn will be inherently different than Purple or BG/L, and therefore needs a different approach. Dawn's primary function is to permit adequate access for tri-lab code development in preparation for Sequoia, and in particular for weapons multi-physics codes in support of UQ. A second purpose is to provide time allocations for large-scale science runs and for UQ suite calculations to advance SSP program priorities. This proposed governance model will be the basis for initial time allocation of Dawn computing resources for the science and UQ workloads that merit priority on this class of resource, either because they cannot be reasonably attempted on any other resources due to size of problem, or because of the unavailability of sizable allocations on other ASC capability or capacity platforms. This proposed model intends to make the most effective use of Dawn as possible, but without being overly constrained by more formal proposal processes such as those now used for Purple CCCs.
A System for Automatically Generating Scheduling Heuristics
NASA Technical Reports Server (NTRS)
Morris, Robert
1996-01-01
The goal of this research is to improve the performance of automated schedulers by designing and implementing an algorithm by automatically generating heuristics by selecting a schedule. The particular application selected by applying this method solves the problem of scheduling telescope observations, and is called the Associate Principal Astronomer. The input to the APA scheduler is a set of observation requests submitted by one or more astronomers. Each observation request specifies an observation program as well as scheduling constraints and preferences associated with the program. The scheduler employs greedy heuristic search to synthesize a schedule that satisfies all hard constraints of the domain and achieves a good score with respect to soft constraints expressed as an objective function established by an astronomer-user.
Scheduling Reconsidered (Again!)
ERIC Educational Resources Information Center
Hentschke, Guilbert C.; Fowler, William J.
1974-01-01
Computer technicians bring to school scheduling a certain naivete regarding the operation of schools. School administrators play a fundamental role of informing technicians about education scheduling needs. (Author)
Intelligent perturbation algorithms to space scheduling optimization
NASA Technical Reports Server (NTRS)
Kurtzman, Clifford R.
1991-01-01
The limited availability and high cost of crew time and scarce resources make optimization of space operations critical. Advances in computer technology coupled with new iterative search techniques permit the near optimization of complex scheduling problems that were previously considered computationally intractable. Described here is a class of search techniques called Intelligent Perturbation Algorithms. Several scheduling systems which use these algorithms to optimize the scheduling of space crew, payload, and resource operations are also discussed.
Scheduling of an aircraft fleet
NASA Technical Reports Server (NTRS)
Paltrinieri, Massimo; Momigliano, Alberto; Torquati, Franco
1992-01-01
Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.
Optimization-based manufacturing scheduling with multiple resources and setup requirements
NASA Astrophysics Data System (ADS)
Chen, Dong; Luh, Peter B.; Thakur, Lakshman S.; Moreno, Jack, Jr.
1998-10-01
The increasing demand for on-time delivery and low price forces manufacturer to seek effective schedules to improve coordination of multiple resources and to reduce product internal costs associated with labor, setup and inventory. This study describes the design and implementation of a scheduling system for J. M. Product Inc. whose manufacturing is characterized by the need to simultaneously consider machines and operators while an operator may attend several operations at the same time, and the presence of machines requiring significant setup times. The scheduling problem with these characteristics are typical for many manufacturers, very difficult to be handled, and have not been adequately addressed in the literature. In this study, both machine and operators are modeled as resources with finite capacities to obtain efficient coordination between them, and an operator's time can be shared by several operations at the same time to make full use of the operator. Setups are explicitly modeled following our previous work, with additional penalties on excessive setups to reduce setup costs and avoid possible scraps. An integer formulation with a separable structure is developed to maximize on-time delivery of products, low inventory and small number of setups. Within the Lagrangian relaxation framework, the problem is decomposed into individual subproblems that are effectively solved by using dynamic programming with additional penalties embedded in state transitions. Heuristics is then developed to obtain a feasible schedule following on our previous work with new mechanism to satisfy operator capacity constraints. The method has been implemented using the object-oriented programming language C++ with a user-friendly interface, and numerical testing shows that the method generates high quality schedules in a timely fashion. Through simultaneous consideration of machines and operators, machines and operators are well coordinated to facilitate the smooth flow of
Optimal randomized scheduling by replacement
Saias, I.
1996-05-01
In the replacement scheduling problem, a system is composed of n processors drawn from a pool of p. The processors can become faulty while in operation and faulty processors never recover. A report is issued whenever a fault occurs. This report states only the existence of a fault but does not indicate its location. Based on this report, the scheduler can reconfigure the system and choose another set of n processors. The system operates satisfactorily as long as, upon report of a fault, the scheduler chooses n non-faulty processors. We provide a randomized protocol maximizing the expected number of faults the system can sustain before the occurrence of a crash. The optimality of the protocol is established by considering a closely related dual optimization problem. The game-theoretic technical difficulties that we solve in this paper are very general and encountered whenever proving the optimality of a randomized algorithm in parallel and distributed computation.
NASA Technical Reports Server (NTRS)
Smith, Greg
2003-01-01
Schedule risk assessments determine the likelihood of finishing on time. Each task in a schedule has a varying degree of probability of being finished on time. A schedule risk assessment quantifies these probabilities by assigning values to each task. This viewgraph presentation contains a flow chart for conducting a schedule risk assessment, and profiles applicable several methods of data analysis.
A simple neural network scheduler for real-time machine task scheduling
Gritzo, R.E.
1991-01-01
The recent development of a new generation of automated radionuclide assay equipment in our facility requires embedded software at each machine for the scheduling of tasks. The execution time requirements of real-time embedded software limit the complexity of the scheduler design. By representing the scheduling problem properly, a simple backpropagation neural network performs the scheduling function within the imposed requirements. Operational tests have demonstrated that the neural network scheduler has met all development goals and is superior to the previous approaches. 3 refs., 1 tab.
A scheduling algorithm for Spacelab telescope observations
NASA Technical Reports Server (NTRS)
Grone, B.
1982-01-01
An algorithm is developed for sequencing and scheduling of observations of stellar targets by equipment on Spacelab. The method is a general one. The scheduling problem is defined and examined. The method developed for its solution is documented. Suggestions for further development and implementation of this method are made.
Scheduling Sanity in the Elementary Schools.
ERIC Educational Resources Information Center
Curatilo, Joseph S.
1983-01-01
Use of the music block schedule for elementary band, chorus, and orchestra programs has many advantages. For example, it eliminates the need to pull students from class and abates classroom teacher and music teacher friction. Solutions to other problems often encountered in scheduling are also discussed. (RM)
Optimizing Operating Room Scheduling.
Levine, Wilton C; Dunn, Peter F
2015-12-01
This article reviews the management of an operating room (OR) schedule and use of the schedule to add value to an organization. We review the methodology of an OR block schedule, daily OR schedule management, and post anesthesia care unit patient flow. We discuss the importance of a well-managed OR schedule to ensure smooth patient care, not only in the OR, but throughout the entire hospital. PMID:26610624
[Vaccination schedule of the Spanish Association of Paediatrics: recommendations 2011].
Marès Bermúdez, J; van Esso Arbolave, D; Moreno-Pérez, D; Merino Moína, M; Alvarez García, F J; Cilleruelo Ortega, M J; Arístegui Fernández, J; Ortigosa del Castillo, L; Ruiz-Contreras, J; Barrio Corrales, F; González-Hachero, J
2011-02-01
The Advisory Committee on Vaccines of the Spanish Paediatric Association updates annually the immunization schedule, taking into account epidemiological data as well as evidence of the effectiveness and efficiency of vaccines. This vaccination schedule includes grades of recommendation. The committee has graded as universal vaccines those that all children should receive, as recommended, those with a profile of universal vaccines of childhood and as are desirable those that all children may receive, but that can be prioritized based on public funding resources and for risk groups, targeting those groups of people in epidemiological situations of risk. The Committee considers as a priority to achieve a common immunization schedule for Spain. The Committee reaffirms the recommendation to include pneumococcal vaccination in the routine vaccination schedule. Vaccination against varicella in the second year of life is an effective strategy and therefore a desirable goal. Given the morbidity and high burden on the health care system, vaccination against rotavirus is recommended for all infants. Due to the current problems of availability of both vaccines, associated with the recent finding of circovirus, the committee urges that rotavirus vaccination is restarted as soon as possible as it is considered a desirable health benefit for all children in our country. The Committee adheres to the recommendations of the National Health Coordination Council in reference to routine vaccination against HPV for all girls aged 11 to 14 years and stresses the need to vaccinate all patients with risk factors for these diseases against influenza and hepatitis A. Finally, it stresses the need to update incomplete immunizations using accelerated immunization schedules. PMID:21215719
Four barges mobilized for job: Indian offshore pipeline work demands comprehensive coordination
Schmidt, J. )
1994-02-01
This paper describes the design, installation, and commissioning timeframe developed for the Oil and Natural Gas Commission of India. Offshore Hyundai International Inc. and Offshore Pipelines International have completed the installation of 47 pipelines, six platforms, and a single-point mooring system in the Arabian Sea. The coordination and work scheduling problems are described along with the engineered placement of the pipelines in an already congested area.
Production scheduling and rescheduling with genetic algorithms.
Bierwirth, C; Mattfeld, D C
1999-01-01
A general model for job shop scheduling is described which applies to static, dynamic and non-deterministic production environments. Next, a Genetic Algorithm is presented which solves the job shop scheduling problem. This algorithm is tested in a dynamic environment under different workload situations. Thereby, a highly efficient decoding procedure is proposed which strongly improves the quality of schedules. Finally, this technique is tested for scheduling and rescheduling in a non-deterministic environment. It is shown by experiment that conventional methods of production control are clearly outperformed at reasonable run-time costs. PMID:10199993
Flexible shift scheduling of physicians.
Brunner, Jens O; Bard, Jonathan F; Kolisch, Rainer
2009-09-01
This research addresses a shift scheduling problem in which physicians at a German university hospital are assigned to demand periods over a planning horizon that can extend up to several weeks. When performing the scheduling it is necessary to take into account a variety of legal and institutional constraints that are imposed by a national labor agreement, which governs all physicians in German university hospitals. Currently, most medical departments develop their staff schedules manually at great cost and time. To solve the problem, a new modeling approach is developed that requires shifts to be generated implicitly. Rather than beginning with a predetermined number of shift types and start times, shifts are allowed to start at every pre-defined period in the planning horizon and extend up to 13 h with an hour-long break included. The objective is to find an assignment such that the total hours that have to be paid out as overtime are minimal under the restrictions given by the labor agreement. The problem is formulated as a mixed-integer program and solved with CPLEX. During the solution process individual lines-of-work are constructed for each physician. Using data from an anesthesia department, computational results indicate that high quality schedules can be obtained much more quickly than by current practice. PMID:19739361
48 CFR 38.201 - Coordination requirements.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 48 Federal Acquisition Regulations System 1 2011-10-01 2011-10-01 false Coordination requirements. 38.201 Section 38.201 Federal Acquisition Regulations System FEDERAL ACQUISITION REGULATION SPECIAL... Schedules 38.201 Coordination requirements. (a) Subject to interagency agreements, contracting...
48 CFR 38.201 - Coordination requirements.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Coordination requirements. 38.201 Section 38.201 Federal Acquisition Regulations System FEDERAL ACQUISITION REGULATION SPECIAL... Schedules 38.201 Coordination requirements. (a) Subject to interagency agreements, contracting...
NASA Astrophysics Data System (ADS)
Novoselova, Anna V.; Chernavina, Mariya L.; Berezin, Kirill V.; Berezin, Valentin I.
2015-03-01
This article describes the algorithm and the creation of programs for the input process automate the scaling factors of quantum mechanical force fields calculated in the natural coordinates using ab initio methods and the density functional theory (DFT-methods).
Multicore job scheduling in the Worldwide LHC Computing Grid
NASA Astrophysics Data System (ADS)
Forti, A.; Pérez-Calero Yzquierdo, A.; Hartmann, T.; Alef, M.; Lahiff, A.; Templon, J.; Dal Pra, S.; Gila, M.; Skipsey, S.; Acosta-Silva, C.; Filipcic, A.; Walker, R.; Walker, C. J.; Traynor, D.; Gadrat, S.
2015-12-01
After the successful first run of the LHC, data taking is scheduled to restart in Summer 2015 with experimental conditions leading to increased data volumes and event complexity. In order to process the data generated in such scenario and exploit the multicore architectures of current CPUs, the LHC experiments have developed parallelized software for data reconstruction and simulation. However, a good fraction of their computing effort is still expected to be executed as single-core tasks. Therefore, jobs with diverse resources requirements will be distributed across the Worldwide LHC Computing Grid (WLCG), making workload scheduling a complex problem in itself. In response to this challenge, the WLCG Multicore Deployment Task Force has been created in order to coordinate the joint effort from experiments and WLCG sites. The main objective is to ensure the convergence of approaches from the different LHC Virtual Organizations (VOs) to make the best use of the shared resources in order to satisfy their new computing needs, minimizing any inefficiency originated from the scheduling mechanisms, and without imposing unnecessary complexities in the way sites manage their resources. This paper describes the activities and progress of the Task Force related to the aforementioned topics, including experiences from key sites on how to best use different batch system technologies, the evolution of workload submission tools by the experiments and the knowledge gained from scale tests of the different proposed job submission strategies.
Integrating Reservations and Queuing in Remote Laboratory Scheduling
ERIC Educational Resources Information Center
Lowe, D.
2013-01-01
Remote laboratories (RLs) have become increasingly seen as a useful tool in supporting flexible shared access to scarce laboratory resources. An important element in supporting shared access is coordinating the scheduling of the laboratory usage. Optimized scheduling can significantly decrease access waiting times and improve the utilization level…
41 CFR 101-5.104-4 - Scheduling feasibility studies.
Code of Federal Regulations, 2010 CFR
2010-07-01
... studies. 101-5.104-4 Section 101-5.104-4 Public Contracts and Property Management Federal Property... FEDERAL BUILDINGS AND COMPLEXES 5.1-General § 101-5.104-4 Scheduling feasibility studies. The schedule of feasibility studies will be coordinated by GSA with its construction, space management, and...
41 CFR 101-5.104-4 - Scheduling feasibility studies.
Code of Federal Regulations, 2011 CFR
2011-07-01
... studies. 101-5.104-4 Section 101-5.104-4 Public Contracts and Property Management Federal Property... FEDERAL BUILDINGS AND COMPLEXES 5.1-General § 101-5.104-4 Scheduling feasibility studies. The schedule of feasibility studies will be coordinated by GSA with its construction, space management, and...
7 CFR 1927.56 - Scheduling loan closing.
Code of Federal Regulations, 2013 CFR
2013-01-01
... 7 Agriculture 12 2013-01-01 2013-01-01 false Scheduling loan closing. 1927.56 Section 1927.56... REGULATIONS TITLE CLEARANCE AND LOAN CLOSING Real Estate Title Clearance and Loan Closing § 1927.56 Scheduling loan closing. The agency, in coordination with the closing agent, will arrange a loan closing and...
Dedicated heterogeneous node scheduling including backfill scheduling
Wood, Robert R.; Eckert, Philip D.; Hommes, Gregg
2006-07-25
A method and system for job backfill scheduling dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes are grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule (FNS) is created so that the number of to chart the free nodes over time. For each prioritized job, using the FNS of sub-pools having nodes useable by a particular job, to determine the earliest time range (ETR) capable of running the job. Once determined for a particular job, scheduling the job to run in that ETR. If the ETR determined for a lower priority job (LPJ) has a start time earlier than a higher priority job (HPJ), then the LPJ is scheduled in that ETR if it would not disturb the anticipated start times of any HPJ previously scheduled for a future time. Thus, efficient utilization and throughput of such computing environments may be increased by utilizing resources otherwise remaining idle.
Batch Scheduling a Fresh Approach
NASA Technical Reports Server (NTRS)
Cardo, Nicholas P.; Woodrow, Thomas (Technical Monitor)
1994-01-01
The Network Queueing System (NQS) was designed to schedule jobs based on limits within queues. As systems obtain more memory, the number of queues increased to take advantage of the added memory resource. The problem now becomes too many queues. Having a large number of queues provides users with the capability to gain an unfair advantage over other users by tailoring their job to fit in an empty queue. Additionally, the large number of queues becomes confusing to the user community. The High Speed Processors group at the Numerical Aerodynamics Simulation (NAS) Facility at NASA Ames Research Center developed a new approach to batch job scheduling. This new method reduces the number of queues required by eliminating the need for queues based on resource limits. The scheduler examines each request for necessary resources before initiating the job. Also additional user limits at the complex level were added to provide a fairness to all users. Additional tools which include user job reordering are under development to work with the new scheduler. This paper discusses the objectives, design and implementation results of this new scheduler
Scheduling hydro power systems with restricted operating zones and discharge ramping constraints
Guan, X.; Svoboda, Al; Li, C.
1999-02-01
An optimization-based algorithm is presented for scheduling hydro power systems with restricted operating zones and discharge ramping constraints. Hydro watershed scheduling problems are difficult to solve because many constraints, continuous and discrete, including hydraulic coupling of cascaded reservoirs have to be considered. Restricted or forbidden operating zones as well as minimum generation limits of hydro units result in discontinuous preferred operating regions, and hinder direct applications of efficient continuous optimization methods such as network flow algorithms. Discharge ramping constraints due to navigational, environmental and recreational requirements in a hydro system add another dimension of difficulty since they couple generation or water discharge across time horizon. The key idea of this paper is to use additional sets of multipliers to relax discontinuous operating region and discharge ramping constraints on individual hydro units so that a two-level optimization structure is formed. The low level consists of a continuous discharge scheduling subproblem determining the generation levels of all units in the entire watershed, and a number of pure integer scheduling subproblems determining the hydro operating states, one for each unit. The discharge subproblem is solved by a network flow algorithm, and the integer scheduling problems are solved by dynamic programming with a small number of states and well-structured transitions. The two sets of subproblems are coordinated through multipliers updated at the high level by using a modified subgradient algorithm. After the dual problem converges, a feasible hydro schedule is obtained by using the same network flow algorithm with the operating states obtained, and operating ranges modified to guarantee satisfaction of ramping constraints.
Immunization Schedules for Adults
... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedules for Adults in Easy-to-read Formats ... previous immunizations. View or Print a Schedule Recommended Immunizations for Adults (19 Years and Older) by Age ...
Childhood Immunization Schedule
... Recommendations Why Immunize? Vaccines: The Basics Instant Childhood Immunization Schedule Recommend on Facebook Tweet Share Compartir Get ... date. See Disclaimer for additional details. Based on Immunization Schedule for Children 0 through 6 Years of ...
Gorman, Jamie C; Amazeen, Polemnia G; Cooke, Nancy J
2010-07-01
Team coordination consists of both the dynamics of team member interaction and the environmental dynamics to which a team is subjected. Focusing on dynamics, an approach is developed that contrasts with traditional aggregate-static concepts of team coordination as characterized by the shared mental model approach. A team coordination order parameter was developed to capture momentary fluctuations in coordination. Team coordination was observed in three-person uninhabited air vehicle teams across two experimental sessions. The dynamics of the order parameter were observed under changes of a team familiarity control parameter. Team members returned for the second session to either the same (Intact) or different (Mixed) team. 'Roadblock' perturbations, or novel changes in the task environment, were introduced in order to probe the stability of team coordination. Nonlinear dynamic methods revealed differences that a traditional approach did not: Intact and Mixed team coordination dynamics looked very different; Mixed teams were more stable than Intact teams and explored the space of solutions without the need for correction. Stability was positively correlated with the number of roadblock perturbations that were overcome successfully. The novel and non-intuitive contribution of a dynamical analysis was that Mixed teams, who did not have a long history working together, were more adaptive. Team coordination dynamics carries new implications for traditional problems such as training adaptive teams. PMID:20587302
NASA Technical Reports Server (NTRS)
Hartman, Steven
1992-01-01
Viewgraphs on technology coordination are provided. Topics covered include: technology coordination process to date; goals; how the Office of Aeronautics and Space Technology (OAST) can support the Office of Space Science and Applications (OSSA); how OSSA can support OAST; steps to technology transfer; and recommendations.
A Test Scheduling Algorithm Based on Two-Stage GA
NASA Astrophysics Data System (ADS)
Yu, Y.; Peng, X. Y.; Peng, Y.
2006-10-01
In this paper, we present a new algorithm to co-optimize the core wrapper design and the SOC test scheduling. The SOC test scheduling problem is first formulated into a twodimension floorplan problem and a sequence pair architecture is used to represent it. Then we propose a two-stage GA (Genetic Algorithm) to solve the SOC test scheduling problem. Experiments on ITC'02 benchmark show that our algorithm can effectively reduce test time so as to decrease SOC test cost.
Deep Space Network Scheduling Using Evolutionary Computational Methods
NASA Technical Reports Server (NTRS)
Guillaume, Alexandre; Lee, Seugnwon; Wang, Yeou-Fang; Terrile, Richard J.
2007-01-01
The paper presents the specific approach taken to formulate the problem in terms of gene encoding, fitness function, and genetic operations. The genome is encoded such that a subset of the scheduling constraints is automatically satisfied. Several fitness functions are formulated to emphasize different aspects of the scheduling problem. The optimal solutions of the different fitness functions demonstrate the trade-off of the scheduling problem and provide insight into a conflict resolution process.
NASA Technical Reports Server (NTRS)
Smith, Greg
2003-01-01
Schedule Risk Assessment needs to determine the probability of finishing on or before a given point in time. Task in a schedule should reflect the "most likely" duration for each task. IN reality, each task is different and has a varying degree of probability of finishing within or after the duration specified. Schedule risk assessment attempt to quantify these probabilities by assigning values to each task. Bridges the gap between CPM scheduling and the project's need to know the likelihood of "when".
Daily Modular Scheduling Practice at Pahranagat Valley High School. Report.
ERIC Educational Resources Information Center
Anderson, David Neil
The main topic discussed is a daily modular scheduling system initiated for the small enrollment at Pahranagat Valley High School in Alamo, Nevada, with specific reference to types of instruction, schedule procedures, and conflict problems. An evaluation of the scheduling system is also included. The report is written in dissertation format, which…
Block Scheduling. Research Brief
ERIC Educational Resources Information Center
Muir, Mike
2003-01-01
What are the effects of block scheduling? Results of transitioning from traditional to block scheduling are mixed. Some studies indicate no change in achievement results, nor change in teachers' opinions about instructional strategies. Other studies show that block scheduling doesn't work well for Advanced Placement or Music courses, that "hard to…
Distributed Scheduling Architecture for Multi-Center Time-Based Metering
NASA Technical Reports Server (NTRS)
Landry, Steven; Farley, Todd; Foster, John; Green, Steve; Hoang, Ty; Wong, Gregory L.
2003-01-01
The Traffic Management Advisor (TMA) is an air traffic control automation system currently in use in seven Air Route Traffic Control Centers (ARTCCs) to enable time based metering to busy airports within their airspace. However, this system is limited to operation within a single ARTCC, within about a 200 nautical mile radius of the airport, and on relatively simple streams of traffic. The need for coordinated metering within a greater (300+ nautical mile) radius of an airport, on streams of traffic with significant branching, and across ARTCC boundaries, has been identified. Early tests revealed that TMA could not simply be scaled up to handle such a problem. Instead, a loosely coupled hierarchy of schedules, in which constraints from downstream schedules are passed upstream, is required. Such an architecture reduces the reliance on distant projections of arrival times, making schedules robust to changes in sequence and to additions of aircraft (such as aircraft departing inside the system s scheduling horizon). This architecture is also scaleable, easily reconfigurable, and can be networked together. As such, it can be adapted for use in any size or configuration of airspace and with any number of airports delivering restrictions. An implementation of this distributed scheduling architecture is currently undergoing testing in the TMA-Multi Center system. This paper describes the architecture and its motivation.
Job Scheduling in a Heterogeneous Grid Environment
NASA Technical Reports Server (NTRS)
Shan, Hong-Zhang; Smith, Warren; Oliker, Leonid; Biswas, Rupak
2004-01-01
Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.
Job scheduling in a heterogenous grid environment
Oliker, Leonid; Biswas, Rupak; Shan, Hongzhang; Smith, Warren
2004-02-11
Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.
Multi-Objective Scheduling for the Cluster II Constellation
NASA Technical Reports Server (NTRS)
Johnston, Mark D.; Giuliano, Mark
2011-01-01
This paper describes the application of the MUSE multiobjecctive scheduling framework to the Cluster II WBD scheduling domain. Cluster II is an ESA four-spacecraft constellation designed to study the plasma environment of the Earth and it's magnetosphere. One of the instruments on each of the four spacecraft is the Wide Band Data (WBD) plasma wave experiment. We have applied the MUSE evolutionary algorithm to the scheduling problem represented by this instrument, and the result has been adopted and utilized by the WBD schedulers for nearly a year. This paper describes the WBD scheduling problem, its representation in MUSE, and some of the visualization elements that provide insight into objective value tradeoffs.
NASA Technical Reports Server (NTRS)
Clement, Bradley; Johnston, Mark; Wax, Allan; Chouinard, Caroline
2008-01-01
The DSN (Deep Space Network) Scheduling Engine targets all space missions that use DSN services. It allows clients to issue scheduling, conflict identification, conflict resolution, and status requests in XML over a Java Message Service interface. The scheduling requests may include new requirements that represent a set of tracks to be scheduled under some constraints. This program uses a heuristic local search to schedule a variety of schedule requirements, and is being infused into the Service Scheduling Assembly, a mixed-initiative scheduling application. The engine resolves conflicting schedules of resource allocation according to a range of existing and possible requirement specifications, including optional antennas; start of track and track duration ranges; periodic tracks; locks on track start, duration, and allocated antenna; MSPA (multiple spacecraft per aperture); arraying/VLBI (very long baseline interferometry)/delta DOR (differential one-way ranging); continuous tracks; segmented tracks; gap-to-track ratio; and override or block-out of requirements. The scheduling models now include conflict identification for SOA(start of activity), BOT (beginning of track), RFI (radio frequency interference), and equipment constraints. This software will search through all possible allocations while providing a best-effort solution at any time. The engine reschedules to accommodate individual emergency tracks in 0.2 second, and emergency antenna downtime in 0.2 second. The software handles doubling of one mission's track requests over one week (to 42 total) in 2.7 seconds. Further tests will be performed in the context of actual schedules.
NASA Technical Reports Server (NTRS)
Adair, Jerry R.
1994-01-01
This paper is a consolidated report on ten major planning and scheduling systems that have been developed by the National Aeronautics and Space Administration (NASA). A description of each system, its components, and how it could be potentially used in private industry is provided in this paper. The planning and scheduling technology represented by the systems ranges from activity based scheduling employing artificial intelligence (AI) techniques to constraint based, iterative repair scheduling. The space related application domains in which the systems have been deployed vary from Space Shuttle monitoring during launch countdown to long term Hubble Space Telescope (HST) scheduling. This paper also describes any correlation that may exist between the work done on different planning and scheduling systems. Finally, this paper documents the lessons learned from the work and research performed in planning and scheduling technology and describes the areas where future work will be conducted.
Rau, B.R.
1996-02-01
Modulo scheduling is a framework within which algorithms for software pipelining innermost loops may be defined. The framework specifies a set of constraints that must be met in order to achieve a legal modulo schedule. A wide variety of algorithms and heuristics can be defined within this framework. Little work has been done to evaluate and compare alternative algorithms and heuristics for modulo scheduling from the viewpoints of schedule quality as well as computational complexity. This, along with a vague and unfounded perception that modulo scheduling is computationally expensive as well as difficult to implement, have inhibited its corporation into product compilers. This paper presents iterative modulo scheduling, a practical algorithm that is capable of dealing with realistic machine models. The paper also characterizes the algorithm in terms of the quality of the generated schedules as well as the computational incurred.
ERIC Educational Resources Information Center
Cox, Gary C.
This report proposes creation of a flexible and coordinated system for delivery of comprehensive community-based services to Minnesota children with emotional and behavioral disorders. The proposal calls for the state to support multiagency Local Collaboratives with: (1) legislation that grants local communities certain powers in exchange for…
ERIC Educational Resources Information Center
Kopp, Svenny; Beckung, Eva; Gillberg, Christopher
2010-01-01
Examine the rate, predictors, and effect on daily life skills of developmental coordination disorder (DCD) and other motor control difficulties in school age girls with autism spectrum disorder (ASD) and/or attention-deficit/hyperactivity disorder (ADHD), in preschool age girls with ASD referred to a neuropsychiatric clinic, and in a community…
Yu, Chao; Sharma, Gaurav
2010-08-01
We explore camera scheduling and energy allocation strategies for lifetime optimization in image sensor networks. For the application scenarios that we consider, visual coverage over a monitored region is obtained by deploying wireless, battery-powered image sensors. Each sensor camera provides coverage over a part of the monitored region and a central processor coordinates the sensors in order to gather required visual data. For the purpose of maximizing the network operational lifetime, we consider two problems in this setting: a) camera scheduling, i.e., the selection, among available possibilities, of a set of cameras providing the desired coverage at each time instance, and b) energy allocation, i.e., the distribution of total available energy between the camera sensor nodes. We model the network lifetime as a stochastic random variable that depends upon the coverage geometry for the sensors and the distribution of data requests over the monitored region, two key characteristics that distinguish our problem from other wireless sensor network applications. By suitably abstracting this model of network lifetime and utilizing asymptotic analysis, we propose lifetime-maximizing camera scheduling and energy allocation strategies. The effectiveness of the proposed camera scheduling and energy allocation strategies is validated by simulations. PMID:20350857
ERIC Educational Resources Information Center
Sedwal, Mona; Kamat, Sangeeta
2008-01-01
The Scheduled Castes (SCs, also known as Dalits) and Scheduled Tribes (STs, also known as Adivasis) are among the most socially and educationally disadvantaged groups in India. This paper examines issues concerning school access and equity for Scheduled Caste and Scheduled Tribe communities and also highlights their unique problems, which may…
Experiments with a decision-theoretic scheduler
NASA Technical Reports Server (NTRS)
Hansson, Othar; Holt, Gerhard; Mayer, Andrew
1992-01-01
This paper describes DTS, a decision-theoretic scheduler designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems, and using probabilistic inference to aggregate this information in light of features of a given problem. BPS, the Bayesian Problem-Solver, introduced a similar approach to solving single-agent and adversarial graph search problems, yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.
Integrated online job-shop scheduling system
NASA Astrophysics Data System (ADS)
Zhao, Xing; Chen, Kuan H.; Luh, Peter B.; Chiueh, T. D.; Chang, ShihChang; Thakur, Lakshman S.
1999-11-01
The rapid development of information technology and e- commerce requires fast response form scheduling systems. Based on the Lagrangian relaxation approach for job shop scheduling, this paper present an integrated system that will generate schedules quickly. The Lagrangian relaxation approach is an iterative optimization process, where dynamic programming is solved in each iteration. Since dynamic programming is computational expensive especially for large problems, this paper develops the simplified dynamic programming, which will cut the computation time of each iteration by one order. Furthermore, a digital circuit to be embedded in PC is designed to implement the iterative optimization algorithm, leading to another order of speed improvement. The resulting integrated scheduling system consists of the hardware for optimization and the related software. It is estimated that two orders of magnitude gain in speed can be obtained, which will make on-line scheduling for practical job shops possible.
Schedule-Organizer Computer Program
NASA Technical Reports Server (NTRS)
Collazo, Fernando F.
1990-01-01
Schedule Organizer provides simple method for generating distribution lists. Contains readers' names for each task schedule defined by input files. Schedule Organizer (SO), Schedule Tracker (ST) (COSMIC program MSC-21526), and Schedule Report Generator (SRG) (COSMIC program MSC-21527) computer programs manipulating data-base files in ways advantageous in scheduling. Written in PL/1 and DEC Command Language (DCL).
Space communications scheduler: A rule-based approach to adaptive deadline scheduling
NASA Technical Reports Server (NTRS)
Straguzzi, Nicholas
1990-01-01
Job scheduling is a deceptively complex subfield of computer science. The highly combinatorial nature of the problem, which is NP-complete in nearly all cases, requires a scheduling program to intelligently transverse an immense search tree to create the best possible schedule in a minimal amount of time. In addition, the program must continually make adjustments to the initial schedule when faced with last-minute user requests, cancellations, unexpected device failures, quests, cancellations, unexpected device failures, etc. A good scheduler must be quick, flexible, and efficient, even at the expense of generating slightly less-than-optimal schedules. The Space Communication Scheduler (SCS) is an intelligent rule-based scheduling system. SCS is an adaptive deadline scheduler which allocates modular communications resources to meet an ordered set of user-specified job requests on board the NASA Space Station. SCS uses pattern matching techniques to detect potential conflicts through algorithmic and heuristic means. As a result, the system generates and maintains high density schedules without relying heavily on backtracking or blind search techniques. SCS is suitable for many common real-world applications.
Scheduling and rescheduling with iterative repair
NASA Technical Reports Server (NTRS)
Zweben, Monte; Davis, Eugene; Daun, Brian; Deale, Michael
1992-01-01
This paper describes the GERRY scheduling and rescheduling system being applied to coordinate Space Shuttle Ground Processing. The system uses constraint-based iterative repair, a technique that starts with a complete but possibly flawed schedule and iteratively improves it by using constraint knowledge within repair heuristics. In this paper we explore the tradeoff between the informedness and the computational cost of several repair heuristics. We show empirically that some knowledge can greatly improve the convergence speed of a repair-based system, but that too much knowledge, such as the knowledge embodied within the MIN-CONFLICTS lookahead heuristic, can overwhelm a system and result in degraded performance.
A scheduling model for astronomy
NASA Astrophysics Data System (ADS)
Solar, M.; Michelon, P.; Avarias, J.; Garces, M.
2016-04-01
Astronomical scheduling problem has several external conditions that change dynamically at any time during observations, like weather condition (humidity, temperature, wind speed, opacity, etc.), and target visibility conditions (target over the horizon, Sun/Moon blocking the target). Therefore, a dynamic re-scheduling is needed. An astronomical project will be scheduled as one or more Scheduling Blocks (SBs) as an atomic unit of astronomical observations. We propose a mixed integer linear programming (MILP) solution to select the best SBs, favors SBs with high scientific values, and thus maximizing the quantity of completed observation projects. The data content of Atacama Large Millimeter/Submillimeter Array (ALMA) projects of cycle 0 and cycle 1 were analyzed, and a synthetic set of tests of the real instances was created. Two configurations, one of 5000 SBs in a 3 months season and another 10,000 SBs a 6 months season were created. These instances were evaluated with excellent results. Through the testing it is showed that the MILP proposal has optimal solutions.
Quay crane scheduling with dual cycling
NASA Astrophysics Data System (ADS)
Wang, Dandan; Li, Xiaoping
2015-10-01
In this article, the dual cycling quay crane scheduling problem (D-QCSP) with hatches is addressed to minimize the operation cycles of quay cranes. The problem is decomposed into two sub-problems: the intra-group stage (sequencing stacks within each hatch) and the inter-group stage (scheduling all hatches). A new stack sequencing method is constructed for stacks of each hatch, which is modelled as a two-machine non-permutation flow shop scheduling problem. By removing inner gaps using left-shifting, the adapted hatch scheduling sub-problem is modelled as a two-machine grouped flow shop scheduling problem, which contains more precise processing times. A composite heuristic is proposed for the D-QCSP. Based on the derived lower bound, the heuristic is compared with the best existing heuristics on a large number of instances. Experimental results illustrate that the proposal outperforms the existing methods on all instances and dual cycling needs many fewer quay crane operating cycles than single cycling.
NASA Astrophysics Data System (ADS)
Muscettola, Nicola; Smith, Steven S.
1996-09-01
This final report summarizes research performed under NASA contract NCC 2-531 toward generalization of constraint-based scheduling theories and techniques for application to space telescope observation scheduling problems. Our work into theories and techniques for solution of this class of problems has led to the development of the Heuristic Scheduling Testbed System (HSTS), a software system for integrated planning and scheduling. Within HSTS, planning and scheduling are treated as two complementary aspects of the more general process of constructing a feasible set of behaviors of a target system. We have validated the HSTS approach by applying it to the generation of observation schedules for the Hubble Space Telescope. This report summarizes the HSTS framework and its application to the Hubble Space Telescope domain. First, the HSTS software architecture is described, indicating (1) how the structure and dynamics of a system is modeled in HSTS, (2) how schedules are represented at multiple levels of abstraction, and (3) the problem solving machinery that is provided. Next, the specific scheduler developed within this software architecture for detailed management of Hubble Space Telescope operations is presented. Finally, experimental performance results are given that confirm the utility and practicality of the approach.
NASA Technical Reports Server (NTRS)
Muscettola, Nicola; Smith, Steven S.
1996-01-01
This final report summarizes research performed under NASA contract NCC 2-531 toward generalization of constraint-based scheduling theories and techniques for application to space telescope observation scheduling problems. Our work into theories and techniques for solution of this class of problems has led to the development of the Heuristic Scheduling Testbed System (HSTS), a software system for integrated planning and scheduling. Within HSTS, planning and scheduling are treated as two complementary aspects of the more general process of constructing a feasible set of behaviors of a target system. We have validated the HSTS approach by applying it to the generation of observation schedules for the Hubble Space Telescope. This report summarizes the HSTS framework and its application to the Hubble Space Telescope domain. First, the HSTS software architecture is described, indicating (1) how the structure and dynamics of a system is modeled in HSTS, (2) how schedules are represented at multiple levels of abstraction, and (3) the problem solving machinery that is provided. Next, the specific scheduler developed within this software architecture for detailed management of Hubble Space Telescope operations is presented. Finally, experimental performance results are given that confirm the utility and practicality of the approach.
A coordination theory for intelligent machines
NASA Technical Reports Server (NTRS)
Wang, Fei-Yue; Saridis, George N.
1990-01-01
A formal model for the coordination level of intelligent machines is established. The framework of the coordination level investigated consists of one dispatcher and a number of coordinators. The model called coordination structure has been used to describe analytically the information structure and information flow for the coordination activities in the coordination level. Specifically, the coordination structure offers a formalism to (1) describe the task translation of the dispatcher and coordinators; (2) represent the individual process within the dispatcher and coordinators; (3) specify the cooperation and connection among the dispatcher and coordinators; (4) perform the process analysis and evaluation; and (5) provide a control and communication mechanism for the real-time monitor or simulation of the coordination process. A simple procedure for the task scheduling in the coordination structure is presented. The task translation is achieved by a stochastic learning algorithm. The learning process is measured with entropy and its convergence is guaranteed. Finally, a case study of the coordination structure with three coordinators and one dispatcher for a simple intelligent manipulator system illustrates the proposed model and the simulation of the task processes performed on the model verifies the soundness of the theory.
Evolutionary driver scheduling with relief chains.
Kwan, R S; Kwan, A S; Wren, A
2001-01-01
Public transport driver scheduling problems are well known to be NP-hard. Although some mathematically based methods are being used in the transport industry, there is room for improvement. A hybrid approach incorporating a genetic algorithm (GA) is presented. The role of the GA is to derive a small selection of good shifts to seed a greedy schedule construction heuristic. A group of shifts called a relief chain is identified and recorded. The relief chain is then inherited by the offspring and used by the GA for schedule construction. The new approach has been tested using real-life data sets, some of which represent very large problem instances. The results are generally better than those compiled by experienced schedulers and are comparable to solutions found by integer linear programming (ILP). In some cases, solutions were obtained when the ILP failed within practical computational limits. PMID:11709104
NASA Technical Reports Server (NTRS)
Halbfinger, Eliezer M.; Smith, Barry D.
1991-01-01
The Air Force Space Command schedules telemetry, tracking and control activities across the Air Force Satellite Control network. The Range Scheduling Aid (RSA) is a rapid prototype combining a user-friendly, portable, graphical interface with a sophisticated object-oriented database. The RSA has been a rapid prototyping effort whose purpose is to elucidate and define suitable technology for enhancing the performance of the range schedulers. Designing a system to assist schedulers in their task and using their current techniques as well as enhancements enabled by an electronic environment, has created a continuously developing model that will serve as a standard for future range scheduling systems. The RSA system is easy to use, easily ported between platforms, fast, and provides a set of tools for the scheduler that substantially increases his productivity.
Gang scheduling a parallel machine. Revision 1
Gorda, B.C.; Brooks, E.D. III
1991-12-01
Program development on parallel machines can be a nightmare of scheduling headaches. We have developed a portable time sharing mechanism to handle the problem of scheduling gangs of processes. User programs and their gangs of processes are put to sleep and awakened by the gang scheduler to provide a time sharing environment. Time quantum are adjusted according to priority queues and a system of fair share accounting. The initial platform for this software is the 128 processor BBN TC2000 in use in the Massively Parallel Computing Initiative at the Lawrence Livermore National Laboratory.
NASA Astrophysics Data System (ADS)
Schulz, M.; Chen, M. W.
2010-12-01
The eventual goal of this work is to develop an approximate analytical representation of solar-wind streamlines in the magnetosheath surrounding a magnetosphere of rather general shape. Previous analytical representations of magnetosheath streamlines and magnetic fields have invoked magnetopause shapes that conform to standard coordinate systems (e.g., spherical, cylindrical, paraboloidal, ellipsoidal), but it seems now that such a restriction on magnetopause shape is unnecessary. In the present work it is assumed only that the magnetopause is a continuously differentiable convex surface axisymmetric about the Sun-Earth line. This geometry permits the construction of an orthogonal coordinate system (mu, eta, chi) such that eta is the cosine of the cone angle between the Sun-Earth line and any conical surafce extending normally outward from the magnetopause, mu is a measure of the perpendicular distance of any magnetosheath point from the magnetopause, and chi is an azimuthal coordinate measured around the Sun-Earth line. It is convenient here to assign a label mu = mu* to the magnetopause itself, so that mu - mu* denotes perpendicular distance from the magnetopause and mu* is an adjustable parameter roughly comparable to the radius of the magnetotail. This choice provides for a rough correspondence between the (mu, eta, chi) coordinates introduced here and the ellipsoidal coordinates used in our previous efforts at magnetosheath modeling.
Quay crane scheduling for an indented berth
NASA Astrophysics Data System (ADS)
Lee, Der-Horng; Chen, Jiang Hang; Cao, Jin Xin
2011-09-01
This article explores the quay crane scheduling problem at an indented berth. The indented berth is known as an innovative implementation in the container terminals to tackle the challenge from the emergence of more and more mega-containerships. A mixed integer programming model by considering the non-crossing and safety distance constraints is formulated. A Tabu search heuristic is developed to solve the proposed problem. The computational results from this research indicate that the designed Tabu search is an effective method to handle the quay crane scheduling problem at an indented berth.
Job schedul in Grid batch farms
NASA Astrophysics Data System (ADS)
Gellrich, Andreas
2014-06-01
We present here a study for a scheduler which cooperates with the queueing system TORQUE and is tailored to the needs of a HEP-dominated large Grid site with around 10000 jobs slots. Triggered by severe scaling problems of MAUI, a scheduler, referred to as MYSCHED, was developed and put into operation. We discuss conceptional aspects as well as experiences after almost two years of running.
Intelligent scheduling support for the US Coast Guard
Darby-Dowman, K.; Lucas, C.; Mitra, G.; Fink, R.; Kingsley, L.; Smith, J.W.
1992-12-31
This paper will discuss a joint effort by the U.S. Coast Guard Research & Development Center, Idaho National Engineering Laboratory and Brunel University to provide the necessary tools to increase the human scheduler`s capability to handle the scheduling process more efficiently and effectively. Automating the scheduling process required a system that could think independently of the scheduler, that is, the systems needed its own control mechanism and knowledge base. Further, automated schedule generation became a design requirement and sophisticated algorithms were formulated to solve a complex combinatorial problem. In short, the resulting design can be viewed as a hybrid knowledge-based mathematical programming application system. This document contains an overview of the integrated system, a discrete optimization model for scheduling, and schedule diagnosis and analysis.
A federated model for scheduling in wide-area systems
Weissman, J.B.; Grimshaw, A.S.
1996-12-31
In this paper a model for scheduling in wide-area systems is described. The model is federated and utilizes a collection of local site schedulers that control the use of their resources. The wide-area scheduler consults the local site schedulers to obtain candidate machine schedules. A set of issues and challenges inherent to wide-area scheduling are also described and the proposed model is shown to address many of these problems. A distributed algorithm for wide-area scheduling is presented and relies upon information made available about the resource needs of user jobs. The wide-area scheduler will be implemented in Legion, a wide-area computing system developed at the University of Virginia.
Hagopian, Louis P; Boelter, Eric W; Jarmolowicz, David P
2011-01-01
This paper extends the Tiger, Hanley, and Bruzek (2008) review of functional communication training (FCT) by reviewing the published literature on reinforcement schedule thinning following FCT. As noted by Tiger et al. and others, schedule thinning may be necessary when the newly acquired communication response occurs excessively, to the extent that reinforcing it consistently is not practical in the natural environment. We provide a review of this literature including a discussion of each of the more commonly used schedule arrangements used for this purpose, outcomes obtained, a description of methods for progressing toward the terminal schedule, and a description of supplemental treatment components aimed at maintaining low levels of problem behavior during schedule thinning. Recommendations for schedule thinning are then provided. Finally, conceptual issues related to the reemergence of problem behavior during schedule thinning and areas for future research are discussed. PMID:22532899
Beebe, Dean W
2016-07-01
Despite long-standing public and scientific interest in the phenomenon of sleep, the current decade has shown tremendous growth in our understanding of the sleep of children who have medical or developmental conditions. To accommodate, promote, and guide that growth, Journal of Pediatric Psychology, Clinical Practice in Pediatric Psychology, and Journal of Developmental and Behavioral Pediatrics have published coordinated special issues, encompassing >30 relevant articles. This article introduces the special issue in Journal of Pediatric Psychology, highlighting papers that illustrate how sleep problems are not only commonly comorbid with childhood medical and developmental conditions; they are also likely caused by and contribute to these conditions. In doing so, these coordinated special issues guide clinical care and reveal opportunities for future research. PMID:27189693
Empirical results on scheduling and dynamic backtracking
NASA Technical Reports Server (NTRS)
Boddy, Mark S.; Goldman, Robert P.
1994-01-01
At the Honeywell Technology Center (HTC), we have been working on a scheduling problem related to commercial avionics. This application is large, complex, and hard to solve. To be a little more concrete: 'large' means almost 20,000 activities, 'complex' means several activity types, periodic behavior, and assorted types of temporal constraints, and 'hard to solve' means that we have been unable to eliminate backtracking through the use of search heuristics. At this point, we can generate solutions, where solutions exist, or report failure and sometimes why the system failed. To the best of our knowledge, this is among the largest and most complex scheduling problems to have been solved as a constraint satisfaction problem, at least that has appeared in the published literature. This abstract is a preliminary report on what we have done and how. In the next section, we present our approach to treating scheduling as a constraint satisfaction problem. The following sections present the application in more detail and describe how we solve scheduling problems in the application domain. The implemented system makes use of Ginsberg's Dynamic Backtracking algorithm, with some minor extensions to improve its utility for scheduling. We describe those extensions and the performance of the resulting system. The paper concludes with some general remarks, open questions and plans for future work.
Mixed-Integer Formulations for Constellation Scheduling
NASA Astrophysics Data System (ADS)
Valicka, C.; Hart, W.; Rintoul, M.
Remote sensing systems have expanded the set of capabilities available for and critical to national security. Cooperating, high-fidelity sensing systems and growing mission applications have exponentially increased the set of potential schedules. A definitive lack of advanced tools places an increased burden on operators, as planning and scheduling remain largely manual tasks. This is particularly true in time-critical planning activities where operators aim to accomplish a large number of missions through optimal utilization of single or multiple sensor systems. Automated scheduling through identification and comparison of alternative schedules remains a challenging problem applicable across all remote sensing systems. Previous approaches focused on a subset of sensor missions and do not consider ad-hoc tasking. We have begun development of a robust framework that leverages the Pyomo optimization modeling language for the design of a tool to assist sensor operators planning under the constraints of multiple concurrent missions and uncertainty. Our scheduling models have been formulated to address the stochastic nature of ad-hoc tasks inserted under a variety of scenarios. Operator experience is being leveraged to select appropriate model objectives. Successful development of the framework will include iterative development of high-fidelity mission models that consider and expose various schedule performance metrics. Creating this tool will aid time-critical scheduling by increasing planning efficiency, clarifying the value of alternative modalities uniquely provided by multi-sensor systems, and by presenting both sets of organized information to operators. Such a tool will help operators more quickly and fully utilize sensing systems, a high interest objective within the current remote sensing operations community. Preliminary results for mixed-integer programming formulations of a sensor scheduling problem will be presented. Assumptions regarding sensor geometry
Optimal radiotherapy dose schedules under parametric uncertainty
NASA Astrophysics Data System (ADS)
Badri, Hamidreza; Watanabe, Yoichi; Leder, Kevin
2016-01-01
We consider the effects of parameter uncertainty on the optimal radiation schedule in the context of the linear-quadratic model. Our interest arises from the observation that if inter-patient variability in normal and tumor tissue radiosensitivity or sparing factor of the organs-at-risk (OAR) are not accounted for during radiation scheduling, the performance of the therapy may be strongly degraded or the OAR may receive a substantially larger dose than the allowable threshold. This paper proposes a stochastic radiation scheduling concept to incorporate inter-patient variability into the scheduling optimization problem. Our method is based on a probabilistic approach, where the model parameters are given by a set of random variables. Our probabilistic formulation ensures that our constraints are satisfied with a given probability, and that our objective function achieves a desired level with a stated probability. We used a variable transformation to reduce the resulting optimization problem to two dimensions. We showed that the optimal solution lies on the boundary of the feasible region and we implemented a branch and bound algorithm to find the global optimal solution. We demonstrated how the configuration of optimal schedules in the presence of uncertainty compares to optimal schedules in the absence of uncertainty (conventional schedule). We observed that in order to protect against the possibility of the model parameters falling into a region where the conventional schedule is no longer feasible, it is required to avoid extremal solutions, i.e. a single large dose or very large total dose delivered over a long period. Finally, we performed numerical experiments in the setting of head and neck tumors including several normal tissues to reveal the effect of parameter uncertainty on optimal schedules and to evaluate the sensitivity of the solutions to the choice of key model parameters.
SOFIA's Choice: Automating the Scheduling of Airborne Observations
NASA Technical Reports Server (NTRS)
Frank, Jeremy; Norvig, Peter (Technical Monitor)
1999-01-01
This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of scheduling observations for a space-borne probe. In 6 we discuss extensions of the flight planning problem as well as other problems which are similar to flight planning. In 7 we conclude and discuss future work.
ERIC Educational Resources Information Center
CLEAVES, PAUL C.; AND OTHERS
THE INSTRUCTIONAL MATERIALS CENTER IS LOCATED IN THE LOCAL HIGH SCHOOL AND SUPPLIES ALL SCHOOLS IN THE AREA. AUDIOVISUAL EQUIPMENT ORDERS, AFTER SELECTIONS ARE MADE BY THE CLASSROOM TEACHER, ARE PROCESSED BY THE CENTER, CONFIRMED AND DELIVERED BY TRUCK THREE TIMES EACH WEEK. EACH SCHOOL HAS A BUILDING COORDINATOR WHO CHECKS THE ORDERS INTO THE…
Schedule Matters: Understanding the Relationship between Schedule Delays and Costs on Overruns
NASA Technical Reports Server (NTRS)
Majerowicz, Walt; Shinn, Stephen A.
2016-01-01
This paper examines the relationship between schedule delays and cost overruns on complex projects. It is generally accepted by many project practitioners that cost overruns are directly related to schedule delays. But what does "directly related to" actually mean? Some reasons or root causes for schedule delays and associated cost overruns are obvious, if only in hindsight. For example, unrealistic estimates, supply chain difficulties, insufficient schedule margin, technical problems, scope changes, or the occurrence of risk events can negatively impact schedule performance. Other factors driving schedule delays and cost overruns may be less obvious and more difficult to quantify. Examples of these less obvious factors include project complexity, flawed estimating assumptions, over-optimism, political factors, "black swan" events, or even poor leadership and communication. Indeed, is it even possible the schedule itself could be a source of delay and subsequent cost overrun? Through literature review, surveys of project practitioners, and the authors' own experience on NASA programs and projects, the authors will categorize and examine the various factors affecting the relationship between project schedule delays and cost growth. The authors will also propose some ideas for organizations to consider to help create an awareness of the factors which could cause or influence schedule delays and associated cost growth on complex projects.
Transportation Baseline Schedule
Fawcett, Ricky Lee; John, Mark Earl
2000-01-01
The “1999 National Transportation Program - Transportation Baseline Report” presents data that form a baseline to enable analysis and planning for future Department of Energy (DOE) Environmental Management (EM) waste/material transportation. The companion “1999 Transportation ‘Barriers’ Analysis” analyzes the data and identifies existing and potential problems that may prevent or delay transportation activities based on the data presented. The “1999 Transportation Baseline Schedule” (this report) uses the same data to provide an overview of the transportation activities of DOE EM waste/materials. This report can be used to identify areas where stakeholder interface is needed, and to communicate to stakeholders the quantity/schedule of shipments going through their area. Potential bottlenecks in the transportation system can be identified; the number of packages needed, and the capacity needed at receiving facilities can be planned. This report offers a visualization of baseline DOE EM transportation activities for the 11 major sites and the “Geologic Repository Disposal” site (GRD).
NASA Technical Reports Server (NTRS)
Logan, J. R.; Pulvermacher, M. K.
1991-01-01
Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.
ERIC Educational Resources Information Center
Haley, Marjorie
A discussion of block scheduling for second language instruction looks at the advantages and disadvantages and offers some suggestions for classroom management and course organization. It is argued that block scheduling may offer a potential solution to large classes, insufficient time for labs, too little individualized instruction; few…
ERIC Educational Resources Information Center
Queen, J. Allen
2000-01-01
Successful block scheduling depends on provision of initial and ongoing instructional training. Teaching strategies should vary and include cooperative learning, the case method, the socratic seminar, synectics, concept attainment, the inquiry method, and simulations. Recommendations for maximizing block scheduling are outlined. (Contains 52…
ERIC Educational Resources Information Center
Ubben, Gerald C.
1976-01-01
Achieving flexibility without losing student accountability is a challenge that faces every school. With a fluid block schedule, as described here, accountability is maintained without inhibiting flexibility. An additional advantage is that three levels of schedule decision making take some of the pressure off the principal. (Editor)
ERIC Educational Resources Information Center
Williamson, Ronald
2010-01-01
Driven by stable or declining financial resources many school districts are considering the costs and benefits of a seven-period day. While there is limited evidence that any particular scheduling model has a greater impact on student learning than any other, it is clear that the school schedule is a tool that can significantly impact teacher…
Trimester Schedule. Research Brief
ERIC Educational Resources Information Center
Education Partnerships, Inc., 2012
2012-01-01
Why do a trimester schedule? With the advent of block scheduling, many high schools conducted research on utilizing that plan in a trimester format. There appeared to be three issues that most schools faced: (1) How to provide substantive instructional time that was not fragmented?; (2) How does the school climate contribute positively to…
Research on Production Scheduling System with Bottleneck Based on Multi-agent
NASA Astrophysics Data System (ADS)
Zhenqiang, Bao; Weiye, Wang; Peng, Wang; Pan, Quanke
Aimed at the imbalance problem of resource capacity in Production Scheduling System, this paper uses Production Scheduling System based on multi-agent which has been constructed, and combines the dynamic and autonomous of Agent; the bottleneck problem in the scheduling is solved dynamically. Firstly, this paper uses Bottleneck Resource Agent to find out the bottleneck resource in the production line, analyses the inherent mechanism of bottleneck, and describes the production scheduling process based on bottleneck resource. Bottleneck Decomposition Agent harmonizes the relationship of job's arrival time and transfer time in Bottleneck Resource Agent and Non-Bottleneck Resource Agents, therefore, the dynamic scheduling problem is simplified as the single machine scheduling of each resource which takes part in the scheduling. Finally, the dynamic real-time scheduling problem is effectively solved in Production Scheduling System.
SOFIA's Choice: Scheduling Observations for an Airborne Observatory
NASA Technical Reports Server (NTRS)
Frank, Jeremy; Kurklu, Elif; Koga, Dennis (Technical Monitor)
2002-01-01
We describe the problem of scheduling observations for an airborne observatory. The problem is more complex than traditional scheduling problems in that it incorporates complex constraints relating the feasibility of an astronomical observation to the position and time of a mobile observatory, as well as traditional temporal constraints and optimization criteria. We describe the problem, its proposed solution and the empirical validation of that solution.
Data location-aware job scheduling in the grid. Application to the GridWay metascheduler
NASA Astrophysics Data System (ADS)
Delgado Peris, Antonio; Hernandez, Jose; Huedo, Eduardo; Llorente, Ignacio M.
2010-04-01
Grid infrastructures constitute nowadays the core of the computing facilities of the biggest LHC experiments. These experiments produce and manage petabytes of data per year and run thousands of computing jobs every day to process that data. It is the duty of metaschedulers to allocate the tasks to the most appropriate resources at the proper time. Our work reviews the policies that have been proposed for the scheduling of grid jobs in the context of very data-intensive applications. We indicate some of the practical problems that such models will face and describe what we consider essential characteristics of an optimum scheduling system: aim to minimise not only job turnaround time but also data replication, flexibility to support different virtual organisation requirements and capability to coordinate the tasks of data placement and job allocation while keeping their execution decoupled. These ideas have guided the development of an enhanced prototype for GridWay, a general purpose metascheduler, part of the Globus Toolkit and member of the EGEE's RESPECT program. Current GridWay's scheduling algorithm is unaware of data location. Our prototype makes it possible for job requests to set data needs not only as absolute requirements but also as functions for resource ranking. As our tests show, this makes it more flexible than currently used resource brokers to implement different data-aware scheduling algorithms.
Smart sensing to drive real-time loads scheduling algorithm in a domotic architecture
NASA Astrophysics Data System (ADS)
Santamaria, Amilcare Francesco; Raimondo, Pierfrancesco; De Rango, Floriano; Vaccaro, Andrea
2014-05-01
Nowadays the focus on power consumption represent a very important factor regarding the reduction of power consumption with correlated costs and the environmental sustainability problems. Automatic control load based on power consumption and use cycle represents the optimal solution to costs restraint. The purpose of these systems is to modulate the power request of electricity avoiding an unorganized work of the loads, using intelligent techniques to manage them based on real time scheduling algorithms. The goal is to coordinate a set of electrical loads to optimize energy costs and consumptions based on the stipulated contract terms. The proposed algorithm use two new main notions: priority driven loads and smart scheduling loads. The priority driven loads can be turned off (stand by) according to a priority policy established by the user if the consumption exceed a defined threshold, on the contrary smart scheduling loads are scheduled in a particular way to don't stop their Life Cycle (LC) safeguarding the devices functions or allowing the user to freely use the devices without the risk of exceeding the power threshold. The algorithm, using these two kind of notions and taking into account user requirements, manages loads activation and deactivation allowing the completion their operation cycle without exceeding the consumption threshold in an off-peak time range according to the electricity fare. This kind of logic is inspired by industrial lean manufacturing which focus is to minimize any kind of power waste optimizing the available resources.
Power system scheduling with fuzzy reserve requirements
Guan, X.; Luh, P.B.; Prasannan, B.
1996-05-01
The modeling of constraints is an important issue in power system scheduling. Constraints can be generally classified into two categories: (1) physical limits and (2) operating limits. A schedule violating physical limit or constraint would not be acceptable. An operating limit, however, is often imposed to enhance system security but does not represent a physical bound. This kind of soft limits can be temporarily violated a little bit if necessary, but not too much. These constraints are therefore fuzzy in nature, and crisp treatment of them may lead to over conservative solutions. In this paper, a fuzzy optimization-based method is developed to solve power system scheduling problem with fuzzy reserve requirements. The problem is first converted to a crisp and separable optimization problem. Lagrange multipliers are then used to relax system-wide constraints and decompose the problem into a number of unit-wise subproblems and a membership subproblem. These subproblems can be efficiently solved, and the multipliers are updated by using a subgradient method. Heuristics are then used to construct a feasible schedule based on subproblem solutions. Numerical testing results show that near optimal schedules are obtained, and the method can provide a good balance between reducing costs and satisfying reserve requirements.
Mission Operations Planning and Scheduling System (MOPSS)
NASA Technical Reports Server (NTRS)
Wood, Terri; Hempel, Paul
2011-01-01
MOPSS is a generic framework that can be configured on the fly to support a wide range of planning and scheduling applications. It is currently used to support seven missions at Goddard Space Flight Center (GSFC) in roles that include science planning, mission planning, and real-time control. Prior to MOPSS, each spacecraft project built its own planning and scheduling capability to plan satellite activities and communications and to create the commands to be uplinked to the spacecraft. This approach required creating a data repository for storing planning and scheduling information, building user interfaces to display data, generating needed scheduling algorithms, and implementing customized external interfaces. Complex scheduling problems that involved reacting to multiple variable situations were analyzed manually. Operators then used the results to add commands to the schedule. Each architecture was unique to specific satellite requirements. MOPSS is an expert system that automates mission operations and frees the flight operations team to concentrate on critical activities. It is easily reconfigured by the flight operations team as the mission evolves. The heart of the system is a custom object-oriented data layer mapped onto an Oracle relational database. The combination of these two technologies allows a user or system engineer to capture any type of scheduling or planning data in the system's generic data storage via a GUI.
Schedule-Aware Workflow Management Systems
NASA Astrophysics Data System (ADS)
Mans, Ronny S.; Russell, Nick C.; van der Aalst, Wil M. P.; Moleman, Arnold J.; Bakker, Piet J. M.
Contemporary workflow management systems offer work-items to users through specific work-lists. Users select the work-items they will perform without having a specific schedule in mind. However, in many environments work needs to be scheduled and performed at particular times. For example, in hospitals many work-items are linked to appointments, e.g., a doctor cannot perform surgery without reserving an operating theater and making sure that the patient is present. One of the problems when applying workflow technology in such domains is the lack of calendar-based scheduling support. In this paper, we present an approach that supports the seamless integration of unscheduled (flow) and scheduled (schedule) tasks. Using CPN Tools we have developed a specification and simulation model for schedule-aware workflow management systems. Based on this a system has been realized that uses YAWL, Microsoft Exchange Server 2007, Outlook, and a dedicated scheduling service. The approach is illustrated using a real-life case study at the AMC hospital in the Netherlands. In addition, we elaborate on the experiences obtained when developing and implementing a system of this scale using formal techniques.
Scheduling periodic jobs using imprecise results
NASA Technical Reports Server (NTRS)
Chung, Jen-Yao; Liu, Jane W. S.; Lin, Kwei-Jay
1987-01-01
One approach to avoid timing faults in hard, real-time systems is to make available intermediate, imprecise results produced by real-time processes. When a result of the desired quality cannot be produced in time, an imprecise result of acceptable quality produced before the deadline can be used. The problem of scheduling periodic jobs to meet deadlines on a system that provides the necessary programming language primitives and run-time support for processes to return imprecise results is discussed. Since the scheduler may choose to terminate a task before it is completed, causing it to produce an acceptable but imprecise result, the amount of processor time assigned to any task in a valid schedule can be less than the amount of time required to complete the task. A meaningful formulation of the scheduling problem must take into account the overall quality of the results. Depending on the different types of undesirable effects caused by errors, jobs are classified as type N or type C. For type N jobs, the effects of errors in results produced in different periods are not cumulative. A reasonable performance measure is the average error over all jobs. Three heuristic algorithms that lead to feasible schedules with small average errors are described. For type C jobs, the undesirable effects of errors produced in different periods are cumulative. Schedulability criteria of type C jobs are discussed.
Chandra mission scheduling on-orbit experience
NASA Astrophysics Data System (ADS)
Bucher, Sabina; Williams, Brent; Pendexter, Misty; Balke, David
2008-07-01
Scheduling observatory time to maximize both day-to-day science target integration time and the lifetime of the observatory is a formidable challenge. Furthermore, it is not a static problem. Of course, every schedule brings a new set of observations, but the boundaries of the problem change as well. As spacecraft ages, its capabilities may degrade. As in-flight experience grows, capabilities may expand. As observing programs are completed, the needs and expectations of the science community may evolve. Changes such as these impact the rules by which a mission scheduled. In eight years on orbit, the Chandra X-Ray Observatory Mission Planning process has adapted to meet the challenge of maximizing day-to-day and mission lifetime science return, despite a consistently evolving set of scheduling constraints. The success of the planning team has been achieved, not through the use of complex algorithms and optimization routines, but through processes and home grown tools that help individuals make smart short term and long term Mission Planning decisions. This paper walks through the processes and tools used to plan and produce mission schedules for the Chandra X-Ray Observatory. Nominal planning and scheduling, target of opportunity response, and recovery from on-board autonomous safing actions are all addressed. Evolution of tools and processes, best practices, and lessons learned are highlighted along the way.
Technology for planning and scheduling under complex constraints
NASA Astrophysics Data System (ADS)
Alguire, Karen M.; Pedro Gomes, Carla O.
1997-02-01
Within the context of law enforcement, several problems fall into the category of planning and scheduling under constraints. Examples include resource and personnel scheduling, and court scheduling. In the case of court scheduling, a schedule must be generated considering available resources, e.g., court rooms and personnel. Additionally, there are constraints on individual court cases, e.g., temporal and spatial, and between different cases, e.g., precedence. Finally, there are overall objectives that the schedule should satisfy such as timely processing of cases and optimal use of court facilities. Manually generating a schedule that satisfies all of the constraints is a very time consuming task. As the number of court cases and constraints increases, this becomes increasingly harder to handle without the assistance of automatic scheduling techniques. This paper describes artificial intelligence (AI) technology that has been used to develop several high performance scheduling applications including a military transportation scheduler, a military in-theater airlift scheduler, and a nuclear power plant outage scheduler. We discuss possible law enforcement applications where we feel the same technology could provide long-term benefits to law enforcement agencies and their operations personnel.
A Synthesized Heuristic Task Scheduling Algorithm
Dai, Yanyan; Zhang, Xiangli
2014-01-01
Aiming at the static task scheduling problems in heterogeneous environment, a heuristic task scheduling algorithm named HCPPEFT is proposed. In task prioritizing phase, there are three levels of priority in the algorithm to choose task. First, the critical tasks have the highest priority, secondly the tasks with longer path to exit task will be selected, and then algorithm will choose tasks with less predecessors to schedule. In resource selection phase, the algorithm is selected task duplication to reduce the interresource communication cost, besides forecasting the impact of an assignment for all children of the current task permits better decisions to be made in selecting resources. The algorithm proposed is compared with STDH, PEFT, and HEFT algorithms through randomly generated graphs and sets of task graphs. The experimental results show that the new algorithm can achieve better scheduling performance. PMID:25254244
Monitoring Building Systems for Schedule Compliance
Jensen, Andrew M.; Belew, Shan T.
2013-02-19
As Pacific Northwest National Laboratory (PNNL) initiated a Core Business Hours program, it became a challenge to ensure that the hundreds of systems campus wide were operating within their programmed schedules. Therefore, a collaborative exchange between PNNL operations and PNNL researchers developing the Decision Support for Operations and Maintenance (DSOM) software package was initiated to create a tool to solve this problem. This new DSOM tool verifies systems are operating within scheduled operation times by polling Building Automation and Control Network (BACnet) identifiers of systems’ on/off or command statuses. The tool records the time spent in operation state (ON) and totalizes each system over a rolling 7-day period, highlighting systems that are running over the scheduled hours. This snapshot view allows building management to look quickly at the entire campus to ensure that systems are not operating beyond their scheduled hours.
Coordinating complex decision support activities across distributed applications
NASA Technical Reports Server (NTRS)
Adler, Richard M.
1994-01-01
Knowledge-based technologies have been applied successfully to automate planning and scheduling in many problem domains. Automation of decision support can be increased further by integrating task-specific applications with supporting database systems, and by coordinating interactions between such tools to facilitate collaborative activities. Unfortunately, the technical obstacles that must be overcome to achieve this vision of transparent, cooperative problem-solving are daunting. Intelligent decision support tools are typically developed for standalone use, rely on incompatible, task-specific representational models and application programming interfaces (API's), and run on heterogeneous computing platforms. Getting such applications to interact freely calls for platform independent capabilities for distributed communication, as well as tools for mapping information across disparate representations. Symbiotics is developing a layered set of software tools (called NetWorks! for integrating and coordinating heterogeneous distributed applications. he top layer of tools consists of an extensible set of generic, programmable coordination services. Developers access these services via high-level API's to implement the desired interactions between distributed applications.
Shawn St. Germain; Ronald Farris; Heather Medeman
2013-09-01
schedule depends upon the performance of the outage management organization. During an outage, the outage control center (OCC) is the temporary command center for outage managers and provides several critical functions for the successful execution of the outage schedule. Essentially, the OCC functions to facilitate information inflow, assist outage management in processing information and to facilitate the dissemination of information to stakeholders. Currently, outage management activities primarily rely on telephone communication, face to face reports of status and periodic briefings in the OCC. Much of the information displayed in OCCs is static and out of date requiring an evaluation to determine if it is still valid. Several advanced communication and collaboration technologies have shown promise for facilitating the information flow into, across and out of the OCC. Additionally, advances in the areas of mobile worker technologies, computer based procedures and electronic work packages can be leveraged to improve the availability of real time status to outage managers.
Temporal planning for transportation planning and scheduling
NASA Technical Reports Server (NTRS)
Frederking, Robert E.; Muscettola, Nicola
1992-01-01
In this paper we describe preliminary work done in the CORTES project, applying the Heuristic Scheduling Testbed System (HSTS) to a transportation planning and scheduling domain. First, we describe in more detail the transportation problems that we are addressing. We then describe the fundamental characteristics of HSTS and we concentrate on the representation of multiple capacity resources. We continue with a more detailed description of the transportation planning problem that we have initially addressed in HSTS and of its solution. Finally we describe future directions for our research.
Decision-theoretic control of EUVE telescope scheduling
NASA Technical Reports Server (NTRS)
Hansson, Othar; Mayer, Andrew
1993-01-01
This paper describes a decision theoretic scheduler (DTS) designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems and using probabilistic inference to aggregate this information in light of the features of a given problem. The Bayesian Problem-Solver (BPS) introduced a similar approach to solving single agent and adversarial graph search patterns yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.
Ada and cyclic runtime scheduling
NASA Technical Reports Server (NTRS)
Hood, Philip E.
1986-01-01
An important issue that must be faced while introducing Ada into the real time world is efficient and prodictable runtime behavior. One of the most effective methods employed during the traditional design of a real time system is the cyclic executive. The role cyclic scheduling might play in an Ada application in terms of currently available implementations and in terms of implementations that might be developed especially to support real time system development is examined. The cyclic executive solves many of the problems faced by real time designers, resulting in a system for which it is relatively easy to achieve approporiate timing behavior. Unfortunately a cyclic executive carries with it a very high maintenance penalty over the lifetime of the software that is schedules. Additionally, these cyclic systems tend to be quite fragil when any aspect of the system changes. The findings are presented of an ongoing SofTech investigation into Ada methods for real time system development. The topics covered include a description of the costs involved in using cyclic schedulers, the sources of these costs, and measures for future systems to avoid these costs without giving up the runtime performance of a cyclic system.
ERIC Educational Resources Information Center
DeJong, William; Wechsler, Henry
Under the Drug-Free Schools and Campuses Act, institutions of higher education are required to review the effectiveness of their alcohol and drug prevention programs biannually. This guide offers a method for gathering and interpreting student survey data on alcohol-related problems based on the methodology of the College Alcohol Survey developed…
Effective scheduling of looking and talking during rapid automatized naming.
Gordon, Peter C; Hoedemaker, Renske S
2016-05-01
Rapid automatized naming (RAN) is strongly related to literacy gains in developing readers, reading disabilities, and reading ability in children and adults. Because successful RAN performance depends on the close coordination of a number of abilities, it is unclear what specific skills drive this RAN-reading relationship. The current study used concurrent recordings of young adult participants' vocalizations and eye movements during the RAN task to assess how individual variation in RAN performance depends on the coordination of visual and vocal processes. Results showed that fast RAN times are facilitated by having the eyes 1 or more items ahead of the current vocalization, as long as the eyes do not get so far ahead of the voice as to require a regressive eye movement to an earlier item. These data suggest that optimizing RAN performance is a problem of scheduling eye movements and vocalization given memory constraints and the efficiency of encoding and articulatory control. Both RAN completion time (conventionally used to indicate RAN performance) and eye-voice relations predicted some aspects of participants' eye movements on a separate sentence reading task. However, eye-voice relations predicted additional features of first-pass reading that were not predicted by RAN completion time. This shows that measurement of eye-voice patterns can identify important aspects of individual variation in reading that are not identified by the standard measure of RAN performance. We argue that RAN performance predicts reading ability because both tasks entail challenges of scheduling cognitive and linguistic processes that operate simultaneously on multiple linguistic inputs. (PsycINFO Database Record PMID:26689309
Intelligent scheduling support for the US Coast Guard
Darby-Dowman, K.; Lucas, C.; Mitra, G. ); Fink, R. ); Kingsley, L.; Smith, J.W. )
1992-01-01
This paper will discuss a joint effort by the U.S. Coast Guard Research Development Center, Idaho National Engineering Laboratory and Brunel University to provide the necessary tools to increase the human scheduler's capability to handle the scheduling process more efficiently and effectively. Automating the scheduling process required a system that could think independently of the scheduler, that is, the systems needed its own control mechanism and knowledge base. Further, automated schedule generation became a design requirement and sophisticated algorithms were formulated to solve a complex combinatorial problem. In short, the resulting design can be viewed as a hybrid knowledge-based mathematical programming application system. This document contains an overview of the integrated system, a discrete optimization model for scheduling, and schedule diagnosis and analysis.
Scheduling Future Water Supply Investments Under Uncertainty
NASA Astrophysics Data System (ADS)
Huskova, I.; Matrosov, E. S.; Harou, J. J.; Kasprzyk, J. R.; Reed, P. M.
2014-12-01
Uncertain hydrological impacts of climate change, population growth and institutional changes pose a major challenge to planning of water supply systems. Planners seek optimal portfolios of supply and demand management schemes but also when to activate assets whilst considering many system goals and plausible futures. Incorporation of scheduling into the planning under uncertainty problem strongly increases its complexity. We investigate some approaches to scheduling with many-objective heuristic search. We apply a multi-scenario many-objective scheduling approach to the Thames River basin water supply system planning problem in the UK. Decisions include which new supply and demand schemes to implement, at what capacity and when. The impact of different system uncertainties on scheme implementation schedules are explored, i.e. how the choice of future scenarios affects the search process and its outcomes. The activation of schemes is influenced by the occurrence of extreme hydrological events in the ensemble of plausible scenarios and other factors. The approach and results are compared with a previous study where only the portfolio problem is addressed (without scheduling).
A comparison of dense-to-lean and fixed lean schedules of alternative reinforcement and extinction.
Hagopian, Louis P; Toole, Lisa M; Long, Ethan S; Bowman, Lynn G; Lieving, Gregory A
2004-01-01
Behavior-reduction interventions typically employ dense schedules of alternative reinforcement in conjunction with operant extinction for problem behavior. After problem behavior is reduced in the initial treatment stages, schedule thinning is routinely conducted to make the intervention more practical in natural environments. In the current investigation, two methods for thinning alternative reinforcement schedules were compared for 3 clients who exhibited severe problem behavior. In the dense-to-lean (DTL) condition, reinforcement was delivered on relatively dense schedules (using noncontingent reinforcement for 1 participant and functional communication training for 2 participants), followed by systematic schedule thinning to progressively leaner schedules. During the fixed lean (FL) condition, reinforcement was delivered on lean schedules (equivalent to the terminal schedule of the DTL condition). The FL condition produced a quicker attainment of individual treatment goals for 2 of the 3 participants. The results are discussed in terms of the potential utility of using relatively lean schedules at treatment outset. PMID:15529889
ERIC Educational Resources Information Center
Blakesley, James F.
1982-01-01
College scheduling system and operating procedure objectives influence efficient use of resources. Theoretical and practical considerations are outlined, including a step-by-step assessment of an institution's enrollment capacity and discussion of centralized or reassignable classrooms. (Author/MSE)
... Navigation Bar Home Current Issue Past Issues Childhood Vaccine Schedule Past Issues / Spring 2008 Table of Contents ... please turn Javascript on. When to Vaccinate What Vaccine Why Birth (or any age if not previously ...
NASA Technical Reports Server (NTRS)
Smith, Grego
2004-01-01
Schedule Risk Assessment (SRA) determines the probability of finishing on or before a given point in time. This viewgraph presentation introduces the prerequisites, probability distribution curves, special conditions, calculations, and results analysis for SRA.
Distributed network scheduling
NASA Technical Reports Server (NTRS)
Clement, Bradley J.; Schaffer, Steven R.
2005-01-01
We investigate missions where communications resources are limited, requiring autonomous planning and execution. Unlike typical networks, spacecraft networks are also suited to automated planning and scheduling because many communications can be planned in advance.
Initial Hardware Development Schedule
NASA Technical Reports Server (NTRS)
Culpepper, William X.
1991-01-01
The hardware development schedule for the Common Lunar Lander's (CLLs) tracking system is presented. Among the topics covered are the following: historical perspective, solution options, industry contacts, and the rationale for selection.
A simple neural network scheduler for real-time machine task scheduling
Gritzo, R.E.
1992-06-01
The recent development of a new generation of automated radionuclide assay equipment in our facility requires embedded software at each machine for the scheduling of sample assay tasks. The execution time requirements of real-time embedded software limit the complexity of the schedular software. By representing the scheduling problem properly, a simple backpropagation neural network performs the scheduling function within the imposed requirements. Operational tests have demonstrated that the neural network schedular has met all development goals and is superior to the previous approaches. This paper describes the design and development of the neural network task scheduler. In addition, several aspects of the practical application of neural networks to real-world problems are discussed.
A simple neural network scheduler for real-time machine task scheduling
Gritzo, R.E.
1992-01-01
The recent development of a new generation of automated radionuclide assay equipment in our facility requires embedded software at each machine for the scheduling of sample assay tasks. The execution time requirements of real-time embedded software limit the complexity of the schedular software. By representing the scheduling problem properly, a simple backpropagation neural network performs the scheduling function within the imposed requirements. Operational tests have demonstrated that the neural network schedular has met all development goals and is superior to the previous approaches. This paper describes the design and development of the neural network task scheduler. In addition, several aspects of the practical application of neural networks to real-world problems are discussed.
Cardoso, Goncalo; Stadler, Michael; Bozchalui, Mohammed C.; Sharma, Ratnesh; Marnay, Chris; Barbosa-Povoa, Ana; Ferrao, Paulo
2013-12-06
The large scale penetration of electric vehicles (EVs) will introduce technical challenges to the distribution grid, but also carries the potential for vehicle-to-grid services. Namely, if available in large enough numbers, EVs can be used as a distributed energy resource (DER) and their presence can influence optimal DER investment and scheduling decisions in microgrids. In this work, a novel EV fleet aggregator model is introduced in a stochastic formulation of DER-CAM [1], an optimization tool used to address DER investment and scheduling problems. This is used to assess the impact of EV interconnections on optimal DER solutions considering uncertainty in EV driving schedules. Optimization results indicate that EVs can have a significant impact on DER investments, particularly if considering short payback periods. Furthermore, results suggest that uncertainty in driving schedules carries little significance to total energy costs, which is corroborated by results obtained using the stochastic formulation of the problem.
Improving Resource Selection and Scheduling Using Predictions. Chapter 1
NASA Technical Reports Server (NTRS)
Smith, Warren
2003-01-01
The introduction of computational grids has resulted in several new problems in the area of scheduling that can be addressed using predictions. The first problem is selecting where to run an application on the many resources available in a grid. Our approach to help address this problem is to provide predictions of when an application would start to execute if submitted to specific scheduled computer systems. The second problem is gaining simultaneous access to multiple computer systems so that distributed applications can be executed. We help address this problem by investigating how to support advance reservations in local scheduling systems. Our approaches to both of these problems are based on predictions for the execution time of applications on space- shared parallel computers. As a side effect of this work, we also discuss how predictions of application run times can be used to improve scheduling performance.
Optimal scheduling of logistical support for an emergency roadway repair work schedule
NASA Astrophysics Data System (ADS)
Yan, S.; Lin, C. K.; Chen, S. Y.
2012-09-01
The completion of every disaster rescue task performed by repair work teams relies on the in-time supply of materials to the rescue workers. Up to now, logistical support planning for emergency repair work in Taiwan has been done manually, which is neither effective nor efficient. To remedy the problem, this study presents a logistical support scheduling model for the given emergency repair work schedule. The objective is to minimize the short-term operating cost subject to time constraints and other related operating constraints. This model is formulated as an integer multiple-commodity network flow problem which is characterized as NP-hard. A heuristic algorithm, based on the problem decomposition and variable fixing techniques, is also proposed to efficiently solve this problem. Computational tests are performed using data from Taiwan's 1999 Chi-Chi earthquake. The results show that the model and the solution algorithm would be useful for the logistical support scheduling.
Reinforcement schedule thinning following treatment with functional communication training.
Hanley, G P; Iwata, B A; Thompson, R H
2001-01-01
We evaluated four methods for increasing the practicality of functional communication training (FCT) by decreasing the frequency of reinforcement for alternative behavior. Three participants whose problem behaviors were maintained by positive reinforcement were treated successfully with FCT in which reinforcement for alternative behavior was initially delivered on fixed-ratio (FR) 1 schedules. One participant was then exposed to increasing delays to reinforcement under FR 1, a graduated fixed-interval (FI) schedule, and a graduated multiple-schedule arrangement in which signaled periods of reinforcement and extinction were alternated. Results showed that (a) increasing delays resulted in extinction of the alternative behavior, (b) the FI schedule produced undesirably high rates of the alternative behavior, and (c) the multiple schedule resulted in moderate and stable levels of the alternative behavior as the duration of the extinction component was increased. The other 2 participants were exposed to graduated mixed-schedule (unsignaled alternation between reinforcement and extinction components) and multiple-schedule (signaled alternation between reinforcement and extinction components) arrangements in which the durations of the reinforcement and extinction components were modified. Results obtained for these 2 participants indicated that the use of discriminative stimuli in the multiple schedule facilitated reinforcement schedule thinning. Upon completion of treatment, problem behavior remained low (or at zero), whereas alternative behavior was maintained as well as differentiated during a multiple-schedule arrangement consisting of a 4-min extinction period followed by a 1-min reinforcement period. PMID:11317985
Scheduling in the Face of Uncertain Resource Consumption and Utility
NASA Technical Reports Server (NTRS)
Frank, Jeremy; Dearden, Richard
2003-01-01
We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We show that the problems are NP- complete, and present some results that characterize the behavior of some simple heuristics over a variety of problem classes.
Research on schedulers for astronomical observatories
NASA Astrophysics Data System (ADS)
Colome, Josep; Colomer, Pau; Guàrdia, Josep; Ribas, Ignasi; Campreciós, Jordi; Coiffard, Thierry; Gesa, Lluis; Martínez, Francesc; Rodler, Florian
2012-09-01
The main task of a scheduler applied to astronomical observatories is the time optimization of the facility and the maximization of the scientific return. Scheduling of astronomical observations is an example of the classical task allocation problem known as the job-shop problem (JSP), where N ideal tasks are assigned to M identical resources, while minimizing the total execution time. A problem of higher complexity, called the Flexible-JSP (FJSP), arises when the tasks can be executed by different resources, i.e. by different telescopes, and it focuses on determining a routing policy (i.e., which machine to assign for each operation) other than the traditional scheduling decisions (i.e., to determine the starting time of each operation). In most cases there is no single best approach to solve the planning system and, therefore, various mathematical algorithms (Genetic Algorithms, Ant Colony Optimization algorithms, Multi-Objective Evolutionary algorithms, etc.) are usually considered to adapt the application to the system configuration and task execution constraints. The scheduling time-cycle is also an important ingredient to determine the best approach. A shortterm scheduler, for instance, has to find a good solution with the minimum computation time, providing the system with the capability to adapt the selected task to varying execution constraints (i.e., environment conditions). We present in this contribution an analysis of the task allocation problem and the solutions currently in use at different astronomical facilities. We also describe the schedulers for three different projects (CTA, CARMENES and TJO) where the conclusions of this analysis are applied to develop a suitable routine.
Spike: Artificial intelligence scheduling for Hubble space telescope
NASA Technical Reports Server (NTRS)
Johnston, Mark; Miller, Glenn; Sponsler, Jeff; Vick, Shon; Jackson, Robert
1990-01-01
Efficient utilization of spacecraft resources is essential, but the accompanying scheduling problems are often computationally intractable and are difficult to approximate because of the presence of numerous interacting constraints. Artificial intelligence techniques were applied to the scheduling of the NASA/ESA Hubble Space Telescope (HST). This presents a particularly challenging problem since a yearlong observing program can contain some tens of thousands of exposures which are subject to a large number of scientific, operational, spacecraft, and environmental constraints. New techniques were developed for machine reasoning about scheduling constraints and goals, especially in cases where uncertainty is an important scheduling consideration and where resolving conflicts among conflicting preferences is essential. These technique were utilized in a set of workstation based scheduling tools (Spike) for HST. Graphical displays of activities, constraints, and schedules are an important feature of the system. High level scheduling strategies using both rule based and neural network approaches were developed. While the specific constraints implemented are those most relevant to HST, the framework developed is far more general and could easily handle other kinds of scheduling problems. The concept and implementation of the Spike system are described along with some experiments in adapting Spike to other spacecraft scheduling domains.
Steps Toward Optimal Competitive Scheduling
NASA Technical Reports Server (NTRS)
Frank, Jeremy; Crawford, James; Khatib, Lina; Brafman, Ronen
2006-01-01
This paper is concerned with the problem of allocating a unit capacity resource to multiple users within a pre-defined time period. The resource is indivisible, so that at most one user can use it at each time instance. However, different users may use it at different times. The users have independent, se@sh preferences for when and for how long they are allocated this resource. Thus, they value different resource access durations differently, and they value different time slots differently. We seek an optimal allocation schedule for this resource. This problem arises in many institutional settings where, e.g., different departments, agencies, or personal, compete for a single resource. We are particularly motivated by the problem of scheduling NASA's Deep Space Satellite Network (DSN) among different users within NASA. Access to DSN is needed for transmitting data from various space missions to Earth. Each mission has different needs for DSN time, depending on satellite and planetary orbits. Typically, the DSN is over-subscribed, in that not all missions will be allocated as much time as they want. This leads to various inefficiencies - missions spend much time and resource lobbying for their time, often exaggerating their needs. NASA, on the other hand, would like to make optimal use of this resource, ensuring that the good for NASA is maximized. This raises the thorny problem of how to measure the utility to NASA of each allocation. In the typical case, it is difficult for the central agency, NASA in our case, to assess the value of each interval to each user - this is really only known to the users who understand their needs. Thus, our problem is more precisely formulated as follows: find an allocation schedule for the resource that maximizes the sum of users preferences, when the preference values are private information of the users. We bypass this problem by making the assumptions that one can assign money to customers. This assumption is reasonable; a
A space station onboard scheduling assistant
NASA Technical Reports Server (NTRS)
Brindle, A. F.; Anderson, B. H.
1988-01-01
One of the goals for the Space Station is to achieve greater autonomy, and have less reliance on ground commanding than previous space missions. This means that the crew will have to take an active role in scheduling and rescheduling their activities onboard, perhaps working from preliminary schedules generated on the ground. Scheduling is a time intensive task, whether performed manually or automatically, so the best approach to solving onboard scheduling problems may involve crew members working with an interactive software scheduling package. A project is described which investigates a system that uses knowledge based techniques for the rescheduling of experiments within the Materials Technology Laboratory of the Space Station. Particular attention is paid to: (1) methods for rapid response rescheduling to accommodate unplanned changes in resource availability, (2) the nature of the interface to the crew, (3) the representation of the many types of data within the knowledge base, and (4) the possibility of applying rule-based and constraint-based reasoning methods to onboard activity scheduling.
NASA Astrophysics Data System (ADS)
Ekberg, Peter; Stiblert, Lars; Mattsson, Lars
2014-05-01
The manufacturing of flat panel displays requires a number of photomasks for the placement of pixel patterns and supporting transistor arrays. For large area photomasks, dedicated ultra-precision writers have been developed for the production of these chromium patterns on glass or quartz plates. The dimensional tolerances in X and Y for absolute pattern placement on these plates, with areas measured in square meters, are in the range of 200-300 nm (3σ). To verify these photomasks, 2D ultra-precision coordinate measurement machines are used having even tighter tolerance requirements. This paper will present how the world standard metrology tool used for verifying large masks, the Micronic Mydata MMS15000, is calibrated without any other references than the wavelength of the interferometers in an extremely well-controlled temperature environment. This process is called self-calibration and is the only way to calibrate the metrology tool, as no square-meter-sized large area 2D traceable artifact is available. The only parameter that cannot be found using self-calibration is the absolute length scale. To make the MMS15000 traceable, a 1D reference rod, calibrated at a national metrology lab, is used. The reference plates used in the calibration of the MMS15000 may have sizes up to 1 m2 and a weight of 50 kg. Therefore, standard methods for self-calibration on a small scale with exact placements cannot be used in the large area case. A new, more general method had to be developed for the purpose of calibrating the MMS15000. Using this method, it is possible to calibrate the measurement tool down to an uncertainty level of <90 nm (3σ) over an area of (0.8 × 0.8) m2. The method used, which is based on the concept of iteration, does not introduce any more noise than the random noise introduced by the measurements, resulting in the lowest possible noise level that can be achieved by any self-calibration method.
Scheduling constrained tools using heuristic techniques
NASA Astrophysics Data System (ADS)
Maram, Venkataramana; Rahman, Syariza Abdul; Maram, Sandhya Rani
2015-12-01
One of the main challenge to the current manufacturing production planning is to provide schedules of operations to maximize resource utilization to yield highest overall productivity. This is achieved by scheduling available resources to activities. There can be many different real time scenarios with different combination of input resources to produce parts. In this paper, the problem is simplified to single machine with individual process times and due dates to represent the real world scheduling problem. The main objective function is to minimize the total tardiness or late jobs. Nearest greedy method of assignment problem algorithm is used to find the initial solution followed by Simulated Annealing (SA) algorithm for the improvement part. Simulated Annealing is one of the meta-heuristic techniques in solving combinatorial optimization problem. The general purpose Microsoft Visual C++ is used to developed algorithm for finding the best solution. The proposed hybrid approach able to generate best schedule in 7th and optimal in 170th iteration with tardiness 8 and 7 hours respectively.
Linear-time algorithms for scheduling on parallel processors
Monma, C.L.
1982-01-01
Linear-time algorithms are presented for several problems of scheduling n equal-length tasks on m identical parallel processors subject to precedence constraints. This improves upon previous time bounds for the maximum lateness problem with treelike precedence constraints, the number-of-late-tasks problem without precedence constraints, and the one machine maximum lateness problem with general precedence constraints. 5 references.
NASA Astrophysics Data System (ADS)
Freund, Richard F.; Braun, Tracy D.; Kussow, Matthew; Godfrey, Michael; Koyama, Terry
2001-07-01
SPANR (Schedule, Plan, Assess Networked Resources) is (i) a pre-run, off-line planning and (ii) a runtime, just-in-time scheduling mechanism. It is designed to support primarily commercial applications in that it optimizes throughput rather than individual jobs (unless they have highest priority). Thus it is a tool for a commercial production manager to maximize total work. First the SPANR Planner is presented showing the ability to do predictive 'what-if' planning. It can answer such questions as, (i) what is the overall effect of acquiring new hardware or (ii) what would be the effect of a different scheduler. The ability of the SPANR Planner to formulate in advance tree-trimming strategies is useful in several commercial applications, such as electronic design or pharmaceutical simulations. The SPANR Planner is demonstrated using a variety of benchmarks. The SPANR Runtime Scheduler (RS) is briefly presented. The SPANR RS can provide benefit for several commercial applications, such as airframe design and financial applications. Finally a design is shown whereby SPANR can provide scheduling advice to most resource management systems.
Schedule-Tracker Computer Program
NASA Technical Reports Server (NTRS)
Collazo, Fernando F.
1990-01-01
Schedule Tracker provides effective method for tracking tasks "past due" and/or "near term". Generates reports for each responsible staff member having one or more assigned tasks falling within two listed categories. Schedule Organizer (SO) (COSMIC program MSC-21525), Schedule Tracker (ST), and Schedule Report Generator (SRG) (COSMIC program MSC-21527) computer programs manipulating data-base files in ways advantageous in scheduling. Written in PL/1 and DEC Command Language (DCL).
30 CFR 1229.122 - Coordination of audit activities.
Code of Federal Regulations, 2011 CFR
2011-07-01
... scheduled for audit. This workplan must be submitted 120 days prior to the beginning of each fiscal year. A... 30 Mineral Resources 3 2011-07-01 2011-07-01 false Coordination of audit activities. 1229.122....122 Coordination of audit activities. (a) Each State with a delegation of authority shall...
Integrating tactical and operational decisions in fixed job scheduling
NASA Astrophysics Data System (ADS)
Türsel Eliiyi, Deniz
2013-12-01
Two different problems are introduced in this article to handle capacity and scheduling decisions simultaneously in the fixed job scheduling framework. The combined fixed job scheduling (CFJS) problem integrates these decisions assuming fixed costs for the usage of identical parallel machines, whereas the working time determination (WTD) problem involves unit-time operating or rental costs. Mathematical models for both problems are presented along with the worst case time complexities. While an exact polynomial-time algorithm is proposed for the CFJS problem, a heuristic algorithm is developed for the WTD problem as it is shown to be strongly NP hard. Computational experiments are carried out for evaluating the performance of the algorithms. The results reveal that the solutions by the exact algorithm for the CFJS problem are much faster than a state-of-the-art commercial solver, particularly for large instances. For the WTD problem, the developed heuristic provides high-quality solutions in very short computation times.
Markov Tracking for Agent Coordination
NASA Technical Reports Server (NTRS)
Washington, Richard; Lau, Sonie (Technical Monitor)
1998-01-01
Partially observable Markov decision processes (POMDPs) axe an attractive representation for representing agent behavior, since they capture uncertainty in both the agent's state and its actions. However, finding an optimal policy for POMDPs in general is computationally difficult. In this paper we present Markov Tracking, a restricted problem of coordinating actions with an agent or process represented as a POMDP Because the actions coordinate with the agent rather than influence its behavior, the optimal solution to this problem can be computed locally and quickly. We also demonstrate the use of the technique on sequential POMDPs, which can be used to model a behavior that follows a linear, acyclic trajectory through a series of states. By imposing a "windowing" restriction that restricts the number of possible alternatives considered at any moment to a fixed size, a coordinating action can be calculated in constant time, making this amenable to coordination with complex agents.
A software tool for dataflow graph scheduling
NASA Technical Reports Server (NTRS)
Jones, Robert L., III
1994-01-01
A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on multiple processors. The dataflow paradigm is very useful in exposing the parallelism inherent in algorithms. It provides a graphical and mathematical model which describes a partial ordering of algorithm tasks based on data precedence.
Long term fuel scheduling linear programming
Asgarpoor, S. . Dept. of Electrical Engineering); Gul, N. )
1992-01-01
This paper presents an application of linear programming (LP) revised simplex method in order to solve the fuel scheduling problem. A regression method is applied to determine the polynomial cost curves, and a separable programming technique is used to linearize the objective function and the constraints for LP application. Results based on sample data obtained from Omaha Public Power District (OPPD) are presented to demonstrate the LP application to this problem.
Piserchia, Andrea; Barone, Vincenzo
2016-08-01
A generalization to arbitrary large amplitude motions of a recent approach to the evaluation of diffusion tensors [ J. Comput. Chem. , 2009 , 30 , 2 - 13 ] is presented and implemented in a widely available package for electronic structure computations. A fully black-box tool is obtained, which, starting from the generation of geometric structures along different kinds of paths, proceeds toward the evaluation of an effective diffusion tensor and to the solution of one-dimensional Smoluchowski equations by a robust numerical approach rooted in the discrete variable representation (DVR). Application to a number of case studies shows that the results issuing from our approach are identical to those delivered by previous software (in particular DiTe) for rigid scans along a dihedral angle, but can be improved by employing relaxed scans (i.e., constrained geometry optimizations) or even more general large amplitude paths. The theoretical and numerical background is robust and general enough to allow quite straightforward extensions in several directions (e.g., inclusion of reactive paths, solution of Fokker-Planck or stochastic Liouville equations, multidimensional problems, free-energy rather than electronic-energy driven processes). PMID:27403666
APGEN Scheduling: 15 Years of Experience in Planning Automation
NASA Technical Reports Server (NTRS)
Maldague, Pierre F.; Wissler, Steve; Lenda, Matthew; Finnerty, Daniel
2014-01-01
In this paper, we discuss the scheduling capability of APGEN (Activity Plan Generator), a multi-mission planning application that is part of the NASA AMMOS (Advanced Multi- Mission Operations System), and how APGEN scheduling evolved over its applications to specific Space Missions. Our analysis identifies two major reasons for the successful application of APGEN scheduling to real problems: an expressive DSL (Domain-Specific Language) for formulating scheduling algorithms, and a well-defined process for enlisting the help of auxiliary modeling tools in providing high-fidelity, system-level simulations of the combined spacecraft and ground support system.
A harmonized immunization schedule for Canada: A call to action
MacDonald, NE; Bortolussi, R
2011-01-01
In Canada, the National Advisory Committee on Immunization systematically reviews the evidence for the effectiveness and safety of new and old vaccines, and sets a ‘minimum’ recommended schedule. However, in contrast to other industrialized countries where single, harmonized countrywide immunization schedules are de rigeur, Canada has a confusing system, with each province and territory defining its own schedule – and none are the same. The time has come to rectify this decades-old patient equity and safety problem. The Canadian Paediatric Society calls for a harmonized schedule to improve the health and safety of Canadian children and youth. PMID:22211070
NASA Astrophysics Data System (ADS)
Wainger, Lisa A.
The new schedule for Space Shuttle missions and expendable launch vehicles (ELV's) calls for a 7-month delay in sending up the Hubble Space Telescope. NASA was forced to put off launching the telescope until February 1990 to keep the Magellan and Galileo missions within their narrow launch windows. The first post-Challenger shuttle launch is now scheduled for late this month. Discovery's most recent delays were due to a hydrogen leak discovered July 29 that has still not been corrected and an engine valve malfunction during an August 4 test fire.
Intelligent retail logistics scheduling
Rowe, J.; Jewers, K.; Codd, A.; Alcock, A.
1996-12-31
The Supply Chain Integrated Ordering Network (SCION) Depot Bookings system automates the planning and scheduling of perishable and non-perishable commodities and the vehicles that carry them into J. Sainsbury depots. This is a strategic initiative, enabling the business to make the key move from weekly to daily ordering. The system is mission critical, managing the inwards flow of commodities from suppliers into J. Sainsbury`s depots. The system leverages Al techniques to provide a business solution that meets challenging functional and performance needs. The SCION Depot Bookings system is operational providing schedules for 22 depots across the UK.
Multiple daily fractionation schedules
Peschel, R.E.; Fischer, J.J.
1982-10-01
Although conventional fractionation schedules have been satisfactory for the treatment of some tumors, there is reason to believe that the results of radiation therapy could be improved in some cases by appropriate alterations in treatment schedules. The pharmacological characteristics of some of the electron affinic radiation sensitizers have provided added incentive to investigate newer fractionation schemes, particularly ones which deliver the majority of the radiation dose in short periods of time. This editorial discusses three papers describing preliminary clinical studies using multi-daily fractionated (MDF) radiation therapy. Two of these studies also make use of the radiation sensitizer misonidazole. (KRM)
Heuristics for scheduling Earth observing satellites
NASA Astrophysics Data System (ADS)
Wolfe, William J.; Sorensen, Stephen E.
1999-09-01
This paper describes several methods for assigning tasks to Earth Observing Systems Satellites (EOS). We present empirical results for three heuristics, called: Priority Dispatch (PD), Look Ahead (LA), and Genetic Algorithm (GA). These heuristics progress from simple to complex, from less accurate to more accurate, and from fast to slow. We present empirical results as applied to the Window-Constrained Packing problem (WCP). The WCP is a simplified version of the EOS scheduling problem. We discuss the problem of having more than one optimization criteria. We will also discuss the relationship between the WCP and the more traditional Knapsack and Weighted Early/Tardy problems.
Automatic Generation of Heuristics for Scheduling
NASA Technical Reports Server (NTRS)
Morris, Robert A.; Bresina, John L.; Rodgers, Stuart M.
1997-01-01
This paper presents a technique, called GenH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing consensus that heuristics encode advice that is, at best, useful in solving most, or typical, problem instances, and, at worst, useful in solving only a narrowly defined set of instances. In either case, heuristic problem solvers, to be broadly applicable, should have a means of automatically adjusting to the idiosyncrasies of each problem instance. GenH generates a search heuristic for a given problem instance by hill-climbing in the space of possible multi-attribute heuristics, where the evaluation of a candidate heuristic is based on the quality of the solution found under its guidance. We present empirical results obtained by applying GenH to the real world problem of telescope observation scheduling. These results demonstrate that GenH is a simple and effective way of improving the performance of an heuristic scheduler.
Autonomous scheduling technology for Earth orbital missions
NASA Technical Reports Server (NTRS)
Srivastava, S.
1982-01-01
The development of a dynamic autonomous system (DYASS) of resources for the mission support of near-Earth NASA spacecraft is discussed and the current NASA space data system is described from a functional perspective. The future (late 80's and early 90's) NASA space data system is discussed. The DYASS concept, the autonomous process control, and the NASA space data system are introduced. Scheduling and related disciplines are surveyed. DYASS as a scheduling problem is also discussed. Artificial intelligence and knowledge representation is considered as well as the NUDGE system and the I-Space system.
Planning, scheduling, and control for automatic telescopes
NASA Technical Reports Server (NTRS)
Drummond, Mark; Swanson, Keith; Philips, Andy; Levinson, Rich; Bresina, John
1992-01-01
This paper presents an argument for the appropriateness of Entropy Reduction Engine (ERE) technology to the planning, scheduling, and control components of Automatic Photoelectric Telescope (APT) management. The paper is organized as follows. In the next section, we give a brief summary of the planning and scheduling requirements for APTs. Following this, in section 3, we give an ERE project precis, couched primarily in terms of project objectives. Section 4 gives a sketch of the match-up between problem and technology, and section 5 outlines where we want to go with this work.
NASA Technical Reports Server (NTRS)
Himwich, Ed; Strand, Richard
2013-01-01
This report includes an assessment of the network performance in terms of lost observing time for the 2012 calendar year. Overall, the observing time loss was about 12.3%, which is in-line with previous years. A table of relative incidence of problems with various subsystems is presented. The most significant identified causes of loss were electronics rack problems (accounting for about 21.8% of losses), antenna reliability (18.1%), RFI (11.8%), and receiver problems (11.7%). About 14.2% of the losses occurred for unknown reasons. New antennas are under development in the USA, Germany, and Spain. There are plans for new telescopes in Norway and Sweden. Other activities of the Network Coordinator are summarized.
Scheduling Real-Time Mixed-Criticality Jobs
NASA Astrophysics Data System (ADS)
Baruah, Sanjoy K.; Bonifaci, Vincenzo; D'Angelo, Gianlorenzo; Li, Haohan; Marchetti-Spaccamela, Alberto; Megow, Nicole; Stougie, Leen
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such "mixed-criticality" systems give rise to interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. In this paper, we study a formal model for representing such mixed-criticality workloads. We demonstrate first the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements, even for systems subject to two sets of certification requirements. Then we quantify, via the metric of processor speedup factor, the effectiveness of two techniques, reservation-based scheduling and priority-based scheduling, that are widely used in scheduling such mixed-criticality systems, showing that the latter of the two is superior to the former. We also show that the speedup factors are tight for these two techniques.
A threshold scheduling strategy for Sisal on distributed memory machines
Pande, S.S.; Agrawal, D.P.; Mauney, J. )
1994-05-01
The problem of scheduling tasks on distributed memory machines is known to be NP-complete in the strong sense, ruling out the possibility of a pseudo-polynomial algorithm. This paper introduces a new heuristic algorithm for scheduling Sisal (Streams and Iterations In a Single Assignment Language) programs on a distributed memory machine, Intel Touchstone i860. The compile time scheduling method works on IF-2, an intermediate form based on the dataflow parallelism in the program. The authors initially carry out a dependence analysis, to bind the implicit dependencies across IF-2 graph boundaries, followed by a cost assignment based on Intel Touchstone i860 timings. The scheduler works in two phases. The first phase of the scheduler finds the earliest and latest completion times of each task given by the shortest and longest paths from root task to the given task respectively. A threshold defined as the difference between the latest and the earliest start times of the task, is found. The scheduler varies the value of the allowable threshold, and determines the best value for minimal schedule length. In the second phase of the scheduler, the authors merge the processors to generate schedule to match the available number of processors. Schedule results for several benchmark programs have been included to demonstrate the effectiveness of their approach.
18 CFR 35.12 - Filing of initial rate schedules and tariffs.
Code of Federal Regulations, 2011 CFR
2011-04-01
... schedules of rates for emergency energy, spinning reserve or economy energy or in cases of coordination and... filing public utility's overall rate of return or is it essentially an increment cost plus a share of...
CMS multicore scheduling strategy
Perez-Calero Yzquierdo, Antonio; Hernandez, Jose; Holzman, Burt; Majewski, Krista; McCrea, Alison
2014-01-01
In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.
CMS multicore scheduling strategy
NASA Astrophysics Data System (ADS)
Pérez-Calero Yzquierdo, Antonio; Hernández, Jose; Holzman, Burt; Majewski, Krista; McCrea, Alison; Cms Collaboration
2014-06-01
In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue "Moore's Law" style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.
ERIC Educational Resources Information Center
Blai, Boris
Many creative or flexible work scheduling options are becoming available to the many working parents, students, handicapped persons, elderly individuals, and others who are either unable or unwilling to work a customary 40-hour work week. These options may be broadly categorized as either restructured or reduced work time options. The three main…
ERIC Educational Resources Information Center
Purdue Univ., Lafayette, IN. Educational Research Center.
This 116-item interview schedule designed for parents who failed to respond to the Questionnaire for Parents, is individually administered to the mother of the child of elementary school age. It consists of scales measuring 14 parent variables plus a section devoted to demographic variables: (1) parent's achievement aspirations for the child, (2)…
ERIC Educational Resources Information Center
Emerson, Eric; Howard, Denise
1992-01-01
The phenomena of the induction and entrainment of adjunctive behaviors was investigated in 8 people (ages 5-51) with severe or profound mental retardation who exhibited stereotypic behaviors. Seven of the eight demonstrated evidence of schedule-induced stereotypic behavior, whereas five also showed evidence of the entrainment of these behaviors by…
Planning and Scheduling for Fleets of Earth Observing Satellites
NASA Technical Reports Server (NTRS)
Frank, Jeremy; Jonsson, Ari; Morris, Robert; Smith, David E.; Norvig, Peter (Technical Monitor)
2001-01-01
We address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules; at the same time, the size and complexity of the problem makes it unlikely that systematic optimization search methods will be able to solve them in a reasonable time. This paper presents a constraint-based approach to solving the Earth Observing Satellites (EOS) scheduling problem, and proposes a stochastic heuristic search method for solving it.
Use of evolutionary algorithms for telescope scheduling
NASA Astrophysics Data System (ADS)
Grim, Ruud; Jansen, Mischa; Baan, Arno; van Hemert, Jano; de Wolf, Hans
2002-07-01
LOFAR, a new radio telescope, will be designed to observe with up to 8 independent beams, thus allowing several simultaneous observations. Scheduling of multiple observations parallel in time, each having their own constraints, requires a more intelligent and flexible scheduling function then operated before. In support of the LOFAR radio telescope project, and in co-operation with Leiden University, Fokker Space has started a study to investigate the suitability of the use of evolutionary algorithms applied to complex scheduling problems. After a positive familiarization phase, we now examine the potential use of evolutionary algorithms via a demonstration project. Results of the familiarization phase, and the first results of the demonstration project are presented in this paper.
76 FR 79205 - Wildland Fire Executive Council Meeting Schedule
Federal Register 2010, 2011, 2012, 2013, 2014
2011-12-21
... Office of the Secretary Wildland Fire Executive Council Meeting Schedule AGENCY: Office of the Secretary... Committee Act, 5 U.S.C. App., 2, the U.S. Department of the Interior, Office of the Secretary, Wildland Fire... provide advice on coordinated national-level wildland fire policy and to provide leadership,...
77 FR 35420 - Wildland Fire Executive Council Meeting Schedule
Federal Register 2010, 2011, 2012, 2013, 2014
2012-06-13
... Office of the Secretary Wildland Fire Executive Council Meeting Schedule AGENCY: Office of the Secretary... Committee Act, 5 U.S.C. App., 2, the U.S. Department of the Interior, Office of the Secretary, Wildland Fire... provide advice on coordinated national-level wildland fire policy and to provide leadership,...
78 FR 59949 - Wildland Fire Executive Council Meeting Schedule
Federal Register 2010, 2011, 2012, 2013, 2014
2013-09-30
... Office of the Secretary Wildland Fire Executive Council Meeting Schedule AGENCY: Office of the Secretary... ] Committee Act, 5 U.S.C. App., 2, the U.S. Department of the Interior, Office of the Secretary, Wildland Fire... interest. The purpose of the WFEC is to provide advice on coordinated national-level wildland fire...
76 FR 22130 - Wildland Fire Executive Council Meeting Schedule
Federal Register 2010, 2011, 2012, 2013, 2014
2011-04-20
... Office of the Secretary Wildland Fire Executive Council Meeting Schedule AGENCY: Office of the Secretary... Committee Act, 5 U.S.C. App. 2, the U.S. Department of the Interior, Office of the Secretary, Wildland Fire... interest. The purpose of the WFEC is to provide advice on coordinated national-level wildland fire...
77 FR 63326 - Wildland Fire Executive Council Meeting Schedule
Federal Register 2010, 2011, 2012, 2013, 2014
2012-10-16
... Office of the Secretary Wildland Fire Executive Council Meeting Schedule AGENCY: Office of the Secretary... Committee Act, 5 U.S.C. App., 2, the U.S. Department of the Interior, Office of the Secretary, Wildland Fire... is to provide advice on coordinated national-level wildland fire policy and to provide...
78 FR 45949 - Wildland Fire Executive Council Meeting Schedule
Federal Register 2010, 2011, 2012, 2013, 2014
2013-07-30
... Office of the Secretary Wildland Fire Executive Council Meeting Schedule AGENCY: Office of the Secretary... Committee Act, 5 U.S.C. App. 2, the U.S. Department of the Interior, Office of the Secretary, Wildland Fire... interest. The purpose of the WFEC is to provide advice on coordinated national-level wildland fire...
76 FR 59418 - Wildland Fire Executive Council Meeting Schedule
Federal Register 2010, 2011, 2012, 2013, 2014
2011-09-26
... Office of the Secretary Wildland Fire Executive Council Meeting Schedule AGENCY: Office of the Secretary... Committee Act, 5 U.S.C. App., 2, the U.S. Department of the Interior, Office of the Secretary, Wildland Fire... to provide advice on coordinated national-level wildland fire policy and to provide...
76 FR 28445 - Wildland Fire Executive Council Meeting Schedule
Federal Register 2010, 2011, 2012, 2013, 2014
2011-05-17
... Office of the Secretary Wildland Fire Executive Council Meeting Schedule AGENCY: Office of the Secretary... Committee Act, 5 U.S.C. App. 2, the U.S. Department of the Interior, Office of the Secretary, Wildland Fire... is to provide advice on coordinated national-level wildland fire policy and to provide...
76 FR 15332 - Wildland Fire Executive Council Meeting Schedule
Federal Register 2010, 2011, 2012, 2013, 2014
2011-03-21
... Office of the Secretary Wildland Fire Executive Council Meeting Schedule AGENCY: Office of the Secretary... Committee Act, 5 U.S.C. App., 2, the U.S. Department of the Interior, Office of the Secretary, Wildland Fire... is to provide advice on coordinated national-level wildland fire policy and to provide...
78 FR 15033 - Wildland Fire Executive Council Meeting Schedule
Federal Register 2010, 2011, 2012, 2013, 2014
2013-03-08
... Office of the Secretary Wildland Fire Executive Council Meeting Schedule AGENCY: Office of the Secretary..., Wildland Fire Executive Council (WFEC) will meet as indicated below. DATES: The next meeting will be held... interest. The purpose of the WFEC is to provide advice on coordinated national-level wildland fire...
Scheduling IT staff at a bank: a mathematical programming approach.
Labidi, M; Mrad, M; Gharbi, A; Louly, M A
2014-01-01
We address a real-world optimization problem: the scheduling of a Bank Information Technologies (IT) staff. This problem can be defined as the process of constructing optimized work schedules for staff. In a general sense, it requires the allocation of suitably qualified staff to specific shifts to meet the demands for services of an organization while observing workplace regulations and attempting to satisfy individual work preferences. A monthly shift schedule is prepared to determine the shift duties of each staff considering shift coverage requirements, seniority-based workload rules, and staff work preferences. Due to the large number of conflicting constraints, a multiobjective programming model has been proposed to automate the schedule generation process. The suggested mathematical model has been implemented using Lingo software. The results indicate that high quality solutions can be obtained within a few seconds compared to the manually prepared schedules. PMID:24772032
Scheduling IT Staff at a Bank: A Mathematical Programming Approach
Labidi, M.; Mrad, M.; Gharbi, A.; Louly, M. A.
2014-01-01
We address a real-world optimization problem: the scheduling of a Bank Information Technologies (IT) staff. This problem can be defined as the process of constructing optimized work schedules for staff. In a general sense, it requires the allocation of suitably qualified staff to specific shifts to meet the demands for services of an organization while observing workplace regulations and attempting to satisfy individual work preferences. A monthly shift schedule is prepared to determine the shift duties of each staff considering shift coverage requirements, seniority-based workload rules, and staff work preferences. Due to the large number of conflicting constraints, a multiobjective programming model has been proposed to automate the schedule generation process. The suggested mathematical model has been implemented using Lingo software. The results indicate that high quality solutions can be obtained within a few seconds compared to the manually prepared schedules. PMID:24772032
Concurrent reinforcement schedules: behavior change and maintenance without extinction.
Hoch, Hannah; McComas, Jennifer J; Thompson, Andrea L; Paone, Debra
2002-01-01
We evaluated the effects of concurrent schedules of reinforcement on negatively reinforced problem behavior and task completion with 3 children with autism. Results indicated that problem behavior occurred at high levels and relatively few tasks were completed when problem behavior produced a break (from tasks) and task completion produced either no consequence or a break. By contrast, problem behavior was eliminated and tasks were completed when problem behavior produced a break and task completion produced a break with access to preferred activities. Treatment gains were maintained without the use of extinction when the response requirement was increased and the schedule of reinforcement was thinned. PMID:12102135
Scheduling in the Face of Uncertain Resource Consumption and Utility
NASA Technical Reports Server (NTRS)
Koga, Dennis (Technical Monitor); Frank, Jeremy; Dearden, Richard
2003-01-01
We discuss the problem of scheduling tasks that consume a resource with known capacity and where the tasks have varying utility. We consider problems in which the resource consumption and utility of each activity is described by probability distributions. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We first show that while some of these problems are NP-complete, others are only NP-Hard. We then describe various heuristic search algorithms to solve these problems and their drawbacks. Finally, we present empirical results that characterize the behavior of these heuristics over a variety of problem classes.
Scheduling prioritized patients in emergency department laboratories.
Azadeh, A; Hosseinabadi Farahani, M; Torabzadeh, S; Baghersad, M
2014-11-01
This research focuses on scheduling patients in emergency department laboratories according to the priority of patients' treatments, determined by the triage factor. The objective is to minimize the total waiting time of patients in the emergency department laboratories with emphasis on patients with severe conditions. The problem is formulated as a flexible open shop scheduling problem and a mixed integer linear programming model is proposed. A genetic algorithm (GA) is developed for solving the problem. Then, the response surface methodology is applied for tuning the GA parameters. The algorithm is tested on a set of real data from an emergency department. Simulation results show that the proposed algorithm can significantly improve the efficiency of the emergency department by reducing the total waiting time of prioritized patients. PMID:25214024
High performance techniques for space mission scheduling
NASA Technical Reports Server (NTRS)
Smith, Stephen F.
1994-01-01
In this paper, we summarize current research at Carnegie Mellon University aimed at development of high performance techniques and tools for space mission scheduling. Similar to prior research in opportunistic scheduling, our approach assumes the use of dynamic analysis of problem constraints as a basis for heuristic focusing of problem solving search. This methodology, however, is grounded in representational assumptions more akin to those adopted in recent temporal planning research, and in a problem solving framework which similarly emphasizes constraint posting in an explicitly maintained solution constraint network. These more general representational assumptions are necessitated by the predominance of state-dependent constraints in space mission planning domains, and the consequent need to integrate resource allocation and plan synthesis processes. First, we review the space mission problems we have considered to date and indicate the results obtained in these application domains. Next, we summarize recent work in constraint posting scheduling procedures, which offer the promise of better future solutions to this class of problems.
Time-critical multirate scheduling using contemporary real-time operating system services
NASA Technical Reports Server (NTRS)
Eckhardt, D. E., Jr.
1983-01-01
Although real-time operating systems provide many of the task control services necessary to process time-critical applications (i.e., applications with fixed, invariant deadlines), it may still be necessary to provide a scheduling algorithm at a level above the operating system in order to coordinate a set of synchronized, time-critical tasks executing at different cyclic rates. The scheduling requirements for such applications and develops scheduling algorithms using services provided by contemporary real-time operating systems.
HEAO-A nominal scanning observation schedule
NASA Technical Reports Server (NTRS)
Fishman, G. J.; Stone, R. L.
1977-01-01
The HEAO-A observatory, scheduled for launch in late June 1977, will spend most of its orbital lifetime in a scanning mode, spining from 0.03 to 0.1 rpm about an axis aligned with the sun. The dates of availability in the scan band are given for a list of 248 X-ray sources. Celestial maps of source locations and scan planes, and examples of the nighttime elevation of available sources are presented. This document is intended to aid ground-based observers in planning coordinated observations with HEAO-A.
Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)
NASA Technical Reports Server (NTRS)
Zoch, David R.
1991-01-01
Scheduling techniques in the ROSE are presented in the form of the viewgraphs. The following subject areas are covered: agenda; ROSE summary and history; NCC-ROSE task goals; accomplishments; ROSE timeline manager; scheduling concerns; current and ROSE approaches; initial scheduling; BFSSE overview and example; and summary.
Morton, D.P.
1994-01-01
Handling uncertainty in natural inflow is an important part of a hydroelectric scheduling model. In a stochastic programming formulation, natural inflow may be modeled as a random vector with known distribution, but the size of the resulting mathematical program can be formidable. Decomposition-based algorithms take advantage of special structure and provide an attractive approach to such problems. We develop an enhanced Benders decomposition algorithm for solving multistage stochastic linear programs. The enhancements include warm start basis selection, preliminary cut generation, the multicut procedure, and decision tree traversing strategies. Computational results are presented for a collection of stochastic hydroelectric scheduling problems. Stochastic programming, Hydroelectric scheduling, Large-scale Systems.
The role of artificial intelligence techniques in scheduling systems
NASA Technical Reports Server (NTRS)
Geoffroy, Amy L.; Britt, Daniel L.; Gohring, John R.
1990-01-01
Artificial Intelligence (AI) techniques provide good solutions for many of the problems which are characteristic of scheduling applications. However, scheduling is a large, complex heterogeneous problem. Different applications will require different solutions. Any individual application will require the use of a variety of techniques, including both AI and conventional software methods. The operational context of the scheduling system will also play a large role in design considerations. The key is to identify those places where a specific AI technique is in fact the preferable solution, and to integrate that technique into the overall architecture.
NASA Astrophysics Data System (ADS)
Civicioglu, Pinar
2012-09-01
In order to solve numerous practical navigational, geodetic and astro-geodetic problems, it is necessary to transform geocentric cartesian coordinates into geodetic coordinates or vice versa. It is very easy to solve the problem of transforming geodetic coordinates into geocentric cartesian coordinates. On the other hand, it is rather difficult to solve the problem of transforming geocentric cartesian coordinates into geodetic coordinates as it is very hard to define a mathematical relationship between the geodetic latitude (φ) and the geocentric cartesian coordinates (X, Y, Z). In this paper, a new algorithm, the Differential Search Algorithm (DS), is presented to solve the problem of transforming the geocentric cartesian coordinates into geodetic coordinates and its performance is compared with the performances of the classical methods (i.e., Borkowski, 1989; Bowring, 1976; Fukushima, 2006; Heikkinen, 1982; Jones, 2002; Zhang, 2005; Borkowski, 1987; Shu, 2010 and Lin, 1995) and Computational-Intelligence algorithms (i.e., ABC, JDE, JADE, SADE, EPSDE, GSA, PSO2011, and CMA-ES). The statistical tests realized for the comparison of performances indicate that the problem-solving success of DS algorithm in transforming the geocentric cartesian coordinates into geodetic coordinates is higher than those of all classical methods and Computational-Intelligence algorithms used in this paper.
Scheduling logic for Miles-In-Trail traffic management
NASA Technical Reports Server (NTRS)
Synnestvedt, Robert G.; Swenson, Harry; Erzberger, Heinz
1995-01-01
This paper presents an algorithm which can be used for scheduling arrival air traffic in an Air Route Traffic Control Center (ARTCC or Center) entering a Terminal Radar Approach Control (TRACON) Facility . The algorithm aids a Traffic Management Coordinator (TMC) in deciding how to restrict traffic while the traffic expected to arrive in the TRACON exceeds the TRACON capacity. The restrictions employed fall under the category of Miles-in-Trail, one of two principal traffic separation techniques used in scheduling arrival traffic . The algorithm calculates aircraft separations for each stream of aircraft destined to the TRACON. The calculations depend upon TRACON characteristics, TMC preferences, and other parameters adapted to the specific needs of scheduling traffic in a Center. Some preliminary results of traffic simulations scheduled by this algorithm are presented, and conclusions are drawn as to the effectiveness of using this algorithm in different traffic scenarios.
Minimizing metastatic risk in radiotherapy fractionation schedules
NASA Astrophysics Data System (ADS)
Badri, Hamidreza; Ramakrishnan, Jagdish; Leder, Kevin
2015-11-01
Metastasis is the process by which cells from a primary tumor disperse and form new tumors at distant anatomical locations. The treatment and prevention of metastatic cancer remains an extremely challenging problem. This work introduces a novel biologically motivated objective function to the radiation optimization community that takes into account metastatic risk instead of the status of the primary tumor. In this work, we consider the problem of developing fractionated irradiation schedules that minimize production of metastatic cancer cells while keeping normal tissue damage below an acceptable level. A dynamic programming framework is utilized to determine the optimal fractionation scheme. We evaluated our approach on a breast cancer case using the heart and the lung as organs-at-risk (OAR). For small tumor α /β values, hypo-fractionated schedules were optimal, which is consistent with standard models. However, for relatively larger α /β values, we found the type of schedule depended on various parameters such as the time when metastatic risk was evaluated, the α /β values of the OARs, and the normal tissue sparing factors. Interestingly, in contrast to standard models, hypo-fractionated and semi-hypo-fractionated schedules (large initial doses with doses tapering off with time) were suggested even with large tumor α/β values. Numerical results indicate the potential for significant reduction in metastatic risk.
Appliance Commitment for Household Load Scheduling
Du, Pengwei; Lu, Ning
2011-06-30
This paper presents a novel appliance commitment algorithm that schedules thermostatically-controlled household loads based on price and consumption forecasts considering users comfort settings to meet an optimization objective such as minimum payment or maximum comfort. The formulation of an appliance commitment problem was described in the paper using an electrical water heater load as an example. The thermal dynamics of heating and coasting of the water heater load was modeled by physical models; random hot water consumption was modeled with statistical methods. The models were used to predict the appliance operation over the scheduling time horizon. User comfort was transformed to a set of linear constraints. Then, a novel linear, sequential, optimization process was used to solve the appliance commitment problem. The simulation results demonstrate that the algorithm is fast, robust, and flexible. The algorithm can be used in home/building energy-management systems to help household owners or building managers to automatically create optimal load operation schedules based on different cost and comfort settings and compare cost/benefits among schedules.
Advance Resource Provisioning in Bulk Data Scheduling
Balman, Mehmet
2012-10-01
Today?s scientific and business applications generate mas- sive data sets that need to be transferred to remote sites for sharing, processing, and long term storage. Because of increasing data volumes and enhancement in current net- work technology that provide on-demand high-speed data access between collaborating institutions, data handling and scheduling problems have reached a new scale. In this paper, we present a new data scheduling model with ad- vance resource provisioning, in which data movement operations are defined with earliest start and latest comple- tion times. We analyze time-dependent resource assign- ment problem, and propose a new methodology to improve the current systems by allowing researchers and higher-level meta-schedulers to use data-placement as-a-service, so they can plan ahead and submit transfer requests in advance. In general, scheduling with time and resource conflicts is NP-hard. We introduce an efficient algorithm to organize multiple requests on the fly, while satisfying users? time and resource constraints. We successfully tested our algorithm in a simple benchmark simulator that we have developed, and demonstrated its performance with initial test results.
NASA Astrophysics Data System (ADS)
Bell, Peter M.
The National Aeronautics and Space Administration (NASA) has a record-setting launch schedule for 1984—10 space shuttle flights (see Table 1), 10 satellite deployments from the space shuttle in orbit and 12 unmanned missions using expendable launch vehicles. Also scheduled is the launch on March 1 for the National Oceanic and Atmospheric Administration of Landsat D‧, the nation's second earth resources satellite.The launch activity will begin February 3 with the launch of shuttle mission 41-B using the orbiter Challenger. Two communications satellites will be deployed from 41-B: Westar-VI, for Western Union, and Palapa B-2 for the government of Indonesia. The 8-day mission will feature the first shuttle landing at Kennedy Space Center in Florida; and the first flight of the Manned Maneuvering Unit, a self-contained, propulsive backpack that will allow astronauts to move about in space without being tethered to the spacecraft.
Conflict-Aware Scheduling Algorithm
NASA Technical Reports Server (NTRS)
Wang, Yeou-Fang; Borden, Chester
2006-01-01
conflict-aware scheduling algorithm is being developed to help automate the allocation of NASA s Deep Space Network (DSN) antennas and equipment that are used to communicate with interplanetary scientific spacecraft. The current approach for scheduling DSN ground resources seeks to provide an equitable distribution of tracking services among the multiple scientific missions and is very labor intensive. Due to the large (and increasing) number of mission requests for DSN services, combined with technical and geometric constraints, the DSN is highly oversubscribed. To help automate the process, and reduce the DSN and spaceflight project labor effort required for initiating, maintaining, and negotiating schedules, a new scheduling algorithm is being developed. The scheduling algorithm generates a "conflict-aware" schedule, where all requests are scheduled based on a dynamic priority scheme. The conflict-aware scheduling algorithm allocates all requests for DSN tracking services while identifying and maintaining the conflicts to facilitate collaboration and negotiation between spaceflight missions. These contrast with traditional "conflict-free" scheduling algorithms that assign tracks that are not in conflict and mark the remainder as unscheduled. In the case where full schedule automation is desired (based on mission/event priorities, fairness, allocation rules, geometric constraints, and ground system capabilities/ constraints), a conflict-free schedule can easily be created from the conflict-aware schedule by removing lower priority items that are in conflict.
ERIC Educational Resources Information Center
Murray, Shannon
2008-01-01
Flexible modular scheduling (flex mod)--a schedule philosophy and system that has been in place at Wausau West High School in Wausau, Wisconsin, for the last 35 years and aligns nicely with current research on student learning--is getting more and more attention from high school administrators across the country. Flexible modular scheduling was…
Flexible Scheduling: Making the Transition
ERIC Educational Resources Information Center
Creighton, Peggy Milam
2008-01-01
Citing literature that supports the benefits of flexible scheduling on student achievement, the author exhorts readers to campaign for flexible scheduling in their library media centers. She suggests tips drawn from the work of Graziano (2002), McGregor (2006) and Stripling (1997) for making a smooth transition from fixed to flexible scheduling:…
Surprise Benefits of Arena Scheduling
ERIC Educational Resources Information Center
Surloff, Andrew
2008-01-01
One of the most challenging tasks a principal must accomplish every year is the construction of the master schedule. Free from the magnetic scheduling boards and wall charts of yesteryear, principals now have technological tools--such as programs that offer schools solutions for their scheduling needs--that can save time and enable them to work…
Independent Validation of Specifications: A Coordination Headache
NASA Technical Reports Server (NTRS)
Easterbrook, Steve; Callahan, John
1996-01-01
Large, complex projects face significant barriers to coordination and communication due to continuous, rapid changes during a project's life cycle. Such changes must be tracked, analyzed, and reconciled to ensure high quality in the end product, otherwise problems may get lost or ignored in the overall complexity. We report on 'work-in-progress' in the study of coordination problems between two independent, separate groups: software development and software analysis. We have begun to construct a taxonomy of coordination problems, which we illustrate with two scenarios. We briefly describe current attempts to introduce incremental improvements to coordination problems in such projects via World Wide Web tools. Based on actual project experiences, we plan to deploy such tools in a non-intrusive fashion to improve coordination and communication between software development groups.
Reference coordinate systems: An update. Supplement 11
NASA Technical Reports Server (NTRS)
Mueller, Ivan I.
1988-01-01
A common requirement for all geodetic investigations is a well-defined coordinate system attached to the earth in some prescribed way, as well as a well-defined inertial coordinate system in which the motions of the terrestrial frame can be monitored. The paper deals with the problems encountered when establishing such coordinate systems and the transformations between them. In addition, problems related to the modeling of the deformable earth are discussed. This paper is an updated version of the earlier work, Reference Coordinate Systems for Earth Dynamics: A Preview, by the author.
Designing safe job rotation schedules using optimization and heuristic search.
Carnahan, B J; Redfern, M S; Norman, B
2000-04-01
Job rotation is one method that is sometimes used to reduce exposure to strenuous materials handling; however, developing effective rotation schedules can be complex in even moderate sized facilities. The purpose of this research is to develop methods of incorporating safety criteria into scheduling algorithms to produce job rotation schedules that reduce the potential for injury. Integer programming and a genetic algorithm were used to construct job rotation schedules. Schedules were comprised of lifting tasks whose potential for causing injury was assessed with the Job Severity Index. Each method was used to design four job rotation schedules that met specified safety criteria in a working environment where the object weight, horizontal distance and repetition rate varied over time. Each rotation was assigned to a specific gender/lifting capacity group. Five versions of the integer programming search method were applied to this problem. Each version generated one job rotation schedule. The genetic algorithm model was able to create a population of 437 feasible solutions to the rotation problem. Utilizing cluster analysis, a rule set was derived from the genetic algorithm generated solutions. These rules provided guidelines for designing safe job rotation schedules without the use of a computer. The advantages and limitations of these approaches in developing administrative controls for the prevention of back injury are discussed. PMID:10801086
Saini, Valdeep; Miller, Scott A; Fisher, Wayne W
2016-06-01
Researchers began studying multiple schedules in basic laboratories, but recent advances have extended research on multiple schedules to a wide variety of socially significant applications, especially during the last decade. Applied researchers have used multiple schedules to (a) promote stimulus control over high-rate appropriate behaviors, (b) thin the schedule of reinforcement following functional communication training, and (c) obtain stimulus control over problem behaviors maintained by automatic reinforcement. In the current paper, we reviewed 31 studies with 147 applications identified through a search of the applied literature on multiple schedules. Using these studies, we (a) reviewed the empirical literature on multiple schedules, (b) recommended multiple-schedule procedures that serve as best practice guidelines for applied behavior analysts, (c) identified the generality and boundaries of current knowledge about the effectiveness of multiple schedules, and (d) critically analyzed the literature to provide directions for future multiple-schedule research. PMID:26990754
Utilizing AI in Temporal, Spatial, and Resource Scheduling
NASA Technical Reports Server (NTRS)
Stottler, Richard; Kalton, Annaka; Bell, Aaron
2006-01-01
Aurora is a software system enabling the rapid, easy solution of complex scheduling problems involving spatial and temporal constraints among operations and scarce resources (such as equipment, workspace, and human experts). Although developed for use in the International Space Station Processing Facility, Aurora is flexible enough that it can be easily customized for application to other scheduling domains and adapted as the requirements change or become more precisely known over time. Aurora s scheduling module utilizes artificial-intelligence (AI) techniques to make scheduling decisions on the basis of domain knowledge, including knowledge of constraints and their relative importance, interdependencies among operations, and possibly frequent changes in governing schedule requirements. Unlike many other scheduling software systems, Aurora focuses on resource requirements and temporal scheduling in combination. For example, Aurora can accommodate a domain requirement to schedule two subsequent operations to locations adjacent to a shared resource. The graphical interface allows the user to quickly visualize the schedule and perform changes reflecting additional knowledge or alterations in the situation. For example, the user might drag the activity corresponding to the start of operations to reflect a late delivery.
Automatic generation of efficient orderings of events for scheduling applications
NASA Technical Reports Server (NTRS)
Morris, Robert A.
1994-01-01
In scheduling a set of tasks, it is often not known with certainty how long a given event will take. We call this duration uncertainty. Duration uncertainty is a primary obstacle to the successful completion of a schedule. If a duration of one task is longer than expected, the remaining tasks are delayed. The delay may result in the abandonment of the schedule itself, a phenomenon known as schedule breakage. One response to schedule breakage is on-line, dynamic rescheduling. A more recent alternative is called proactive rescheduling. This method uses statistical data about the durations of events in order to anticipate the locations in the schedule where breakage is likely prior to the execution of the schedule. It generates alternative schedules at such sensitive points, which can be then applied by the scheduler at execution time, without the delay incurred by dynamic rescheduling. This paper proposes a technique for making proactive error management more effective. The technique is based on applying a similarity-based method of clustering to the problem of identifying similar events in a set of events.
Using the principles of circadian physiology enhances shift schedule design
Connolly, J.J.; Moore-Ede, M.C.
1987-01-01
Nuclear power plants must operate 24 h, 7 days a week. For the most part, shift schedules currently in use at nuclear power plants have been designed to meet operational needs without considering the biological clocks of the human operators. The development of schedules that also take circadian principles into account is a positive step that can be taken to improve plant safety by optimizing operator alertness. These schedules reduce the probability of human errors especially during backshifts. In addition, training programs that teach round-the-clock workers how to deal with the problems of shiftwork can help to optimize performance and alertness. These programs teach shiftworkers the underlying causes of the sleep problems associated with shiftwork and also provide coping strategies for improving sleep and dealing with the transition between shifts. When these training programs are coupled with an improved schedule, the problems associated with working round-the-clock can be significantly reduced.
Federal Register 2010, 2011, 2012, 2013, 2014
2010-07-22
... Items), Schedule L (Balance Sheets per Books), Schedule M-1 (Reconciliation of Income (Loss) per Books.... (Schedule K-1), Balance Sheets per Books (Schedule L), Reconciliation of Income (Loss) per Books With...
Shawn St. Germain; Kenneth Thomas; Ronald Farris; Jeffrey Joe
2014-09-01
The long-term viability of existing nuclear power plants (NPPs) in the United States (U.S.) is dependent upon a number of factors, including maintaining high capacity factors, maintaining nuclear safety, and reducing operating costs, particularly those associated with refueling outages. Refueling outages typically take 20-30 days, and for existing light water NPPs in the U.S., the reactor cannot be in operation during the outage. Furthermore, given that many NPPs generate between $1-1.5 million/day in revenue when in operation, there is considerable interest in shortening the length of refueling outages. Yet, refueling outages are highly complex operations, involving multiple concurrent and dependent activities that are difficult to coordinate. Finding ways to improve refueling outage performance while maintaining nuclear safety has proven to be difficult. The Advanced Outage Control Center project is a research and development (R&D) demonstration activity under the Light Water Reactor Sustainability (LWRS) Program. LWRS is a R&D program which works with industry R&D programs to establish technical foundations for the licensing and managing of long-term, safe, and economical operation of current NPPs. The Advanced Outage Control Center project has the goal of improving the management of commercial NPP refueling outages. To accomplish this goal, this INL R&D project is developing an advanced outage control center (OCC) that is specifically designed to maximize the usefulness of communication and collaboration technologies for outage coordination and problem resolution activities. This report describes specific recent efforts to develop a capability called outage Micro-Scheduling. Micro-Scheduling is the ability to allocate and schedule outage support task resources on a sub-hour basis. Micro-Scheduling is the real-time fine-tuning of the outage schedule to react to the actual progress of the primary outage activities to ensure that support task resources are
An improved adaptive ACO meta heuristic for scheduling multimedia traffic across the 802.11e EDCA
NASA Astrophysics Data System (ADS)
Ditze, Michael; Becker, Markus
2008-01-01
This paper presents an adaptive near-optimal scheduler for multimedia traffic for the 802.11e Enhanced Distributed Channel Access (EDCA) medium access control scheme. The scheduler exploits the ant colony optimization (ACO) meta heuristic to tackle the challenge of packet scheduling. ACO is a biologically inspired algorithm that is known to find near-optimal solutions for combinatorial optimization problems. Thus, we expect that ACO scheduling produces more efficient schedules than comparable deterministic scheduling approaches at the expenses of a computational overhead it introduces. We compare ACO scheduling relevant deterministic scheduling approaches, and in particular the MLLF scheduler that is specifically designed for the needs of compressed multimedia applications. The purpose of the evaluation is twofold. It allows to draw conclusions on the feasibility of ACO scheduling for multimedia traffic while it serves as a benchmark to determine to what extent deterministic schedulers fall short of a near-optimal solution.
SO - SCHEDULE ORGANIZER COMPUTER PROGRAM
NASA Technical Reports Server (NTRS)
Collazo, F. F.
1994-01-01
The Schedule Organizer SO, Schedule Tracker, ST (COSMIC Program MSC-21526), and Report Generator, SRG (COSMIC Program MSC-21527), are programs that manipulate data base files in ways that are advantageous to scheduling applications. Originally designed for the Space Shuttle flight schedule, the program can be easily modified for other scheduling situations. Schedule Organizer provides a simple method for generating distribution lists. These distribution lists contain readers' names for each task schedule defined by the input files. Schedule Tracker provides an effective method for tracking tasks that are 'past due' and/or 'near term'. ST generates reports for each responsible staff member with one or more assigned tasks that fall within the two listed categories. This enables an engineering manager to monitor tasks assigned to staff by running ST on a weekly basis. ST only lists tasks on reports that have become past due or are scheduled for recent completion (near term). Schedule Report Generator provides a simple method for generating periodic schedule reports. SO contains the following primary menu that is displayed at the beginning of the program. The menu provides options: to write input files to an output distribution file, to change a schedule title field and/or distribution list field, to browse through the schedule and input names file for requested schedule numbers, to create an input names file and a schedule titles file, and to delete input schedule titles and associated names. SO provides a choice of two input files. One file holds twenty-five groups of up to twenty-five names for each group. The other file holds twenty-five records, each of which may hold a task schedule title. SO creates three output files. One holds the formatted list of schedule titles for printout. Another file holds the formatted distribution list for printout; there is one for each input names file schedule group. The third output file holds the last schedule title deleted by
Departure Trajectory Synthesis and the Intercept Problem
NASA Technical Reports Server (NTRS)
Bolender, Michael A.; Slater, G. L.
1997-01-01
Two areas of the departure problem in air traffic control are discussed. The first topic is the generation of climb-out trajectories to a fix. The trajectories would be utilized by a scheduling algorithm to allocate runways, sequence the proposed departures, and assign a departure time. The second area is concerned with finding horizontal trajectories to merge aircraft from the TRACON to an open slot in the en-route environment. Solutions are presented for the intercept problem for two cases: (1) the aircraft is traveling at the speed of the aircraft in the jetway; (2) the merging aircraft has to accelerate to reach the speed of the aircraft in the en-route stream. An algorithm is given regarding the computation of a solution for the latter case. For the former, a set of equations is given that allows us to numerically solve for the coordinate where the merge will occur.
Constraint-based integration of planning and scheduling for space-based observatory management
NASA Technical Reports Server (NTRS)
Muscettola, Nicola; Smith, Steven F.
1994-01-01
Progress toward the development of effective, practical solutions to space-based observatory scheduling problems within the HSTS scheduling framework is reported. HSTS was developed and originally applied in the context of the Hubble Space Telescope (HST) short-term observation scheduling problem. The work was motivated by the limitations of the current solution and, more generally, by the insufficiency of classical planning and scheduling approaches in this problem context. HSTS has subsequently been used to develop improved heuristic solution techniques in related scheduling domains and is currently being applied to develop a scheduling tool for the upcoming Submillimeter Wave Astronomy Satellite (SWAS) mission. The salient architectural characteristics of HSTS and their relationship to previous scheduling and AI planning research are summarized. Then, some key problem decomposition techniques underlying the integrated planning and scheduling approach to the HST problem are described; research results indicate that these techniques provide leverage in solving space-based observatory scheduling problems. Finally, more recently developed constraint-posting scheduling procedures and the current SWAS application focus are summarized.
Not Available
1994-01-01
In December 1992, western governors and four federal agencies established a Federal Advisory Committee to Develop On-site Innovative Technologies for Environmental Restoration and Waste Management (the DOIT Committee). The purpose of the Committee is to advise the federal government on ways to improve waste cleanup technology development and the cleanup of federal sites in the West. The Committee directed in January 1993 that information be collected from a wide range of potential stakeholders and that innovative technology candidate projects be identified, organized, set in motion, and evaluated to test new partnerships, regulatory approaches, and technologies which will lead to improve site cleanup. Five working groups were organized, one to develop broad project selection and evaluation criteria and four to focus on specific contaminant problems. A Coordinating Group comprised of working group spokesmen and federal and state representatives, was set up to plan and organize the routine functioning of these working groups. The working groups were charged with defining particular contaminant problems; identifying shortcomings in technology development, stakeholder involvement, regulatory review, and commercialization which impede the resolution of these problems; and identifying candidate sites or technologies which could serve as regional innovative demonstration projects to test new approaches to overcome the shortcomings. This report from the Coordinating Group to the DOIT Committee highlights the key findings and opportunities uncovered by these fact-finding working groups. It provides a basis from which recommendations from the DOIT Committee to the federal government can be made. It also includes observations from two public roundtables, one on commercialization and another on regulatory and institutional barriers impeding technology development and cleanup.
Tools for Coordinating Planning Between Observatories
NASA Astrophysics Data System (ADS)
Jones, J.; Maks, L.; Fishman, M.; Grella, V.; Kerbel, U.; Misra, D.; Pell, V.
With the realization of NASA's era of great observatories, there are now more than three space-based telescopes operating in different wave bands. This situation provides astronomers with a unique opportunity to simultaneously observe with multiple observatories. Yet scheduling multiple observatories simultaneously is highly inefficient when compared to observations using only a single observatory. Thus, programs using multiple observatories are limited not by scientific restrictions, but by operational inefficiencies. At present, multi-observatory programs are initiated by submitting observing proposals separately to each concerned observatory. To assure that the proposed observations can be scheduled, each observatory's staff has to check that the observations are valid and meet all constraints for their own observatory; in addition, they have to verify that the observations satisfy the constraints of the other observatories. Thus, coordinated observations require painstaking manual collaboration among staffs at each observatory. Due to the lack of automated tools for coordinated observations, this process is time consuming and error-prone, and the outcome of requests is not certain until the very end. To increase multi-observatory operations efficiency, such resource intensive processes need to be re-engineered. To overcome this critical deficiency, Goddard Space Flight Center's Advanced Architectures and Automation Branch is developing a prototype called the Visual Observation Layout Tool (VOLT). The main objective of VOLT is to provide visual tools to help automate the planning of coordinated observations by multiple astronomical observatories, as well as to increase the probability of scheduling all observations.
Tools for Coordinated Planning Between Observatories
NASA Technical Reports Server (NTRS)
Jones, Jeremy; Fishman, Mark; Grella, Vince; Kerbel, Uri; Maks, Lori; Misra, Dharitri; Pell, Vince; Powers, Edward I. (Technical Monitor)
2001-01-01
With the realization of NASA's era of great observatories, there are now more than three space-based telescopes operating in different wavebands. This situation provides astronomers with a unique opportunity to simultaneously observe with multiple observatories. Yet scheduling multiple observatories simultaneously is highly inefficient when compared to observations using only one single observatory. Thus, programs using multiple observatories are limited not due to scientific restrictions, but due to operational inefficiencies. At present, multi-observatory programs are conducted by submitting observing proposals separately to each concerned observatory. To assure that the proposed observations can be scheduled, each observatory's staff has to check that the observations are valid and meet all the constraints for their own observatory; in addition, they have to verify that the observations satisfy the constraints of the other observatories. Thus, coordinated observations require painstaking manual collaboration among the observatory staff at each observatory. Due to the lack of automated tools for coordinated observations, this process is time consuming, error-prone, and the outcome of the requests is not certain until the very end. To increase observatory operations efficiency, such manpower intensive processes need to undergo re-engineering. To overcome this critical deficiency, Goddard Space Flight Center's Advanced Architectures and Automation Branch is developing a prototype effort called the Visual Observation Layout Tool (VOLT). The main objective of the VOLT project is to provide visual tools to help automate the planning of coordinated observations by multiple astronomical observatories, as well as to increase the scheduling probability of all observations.
Automated long-term scheduling for the SOFIA airborne observatory
NASA Astrophysics Data System (ADS)
Civeit, Thomas
The NASA Stratospheric Observatory for Infrared Astronomy (SOFIA) is a joint US/German project to develop and operate a gyro-stabilized 2.5-meter telescope in a Boeing 747SP. SOFIA's first science observations were made in December 2010. During 2011, SOFIA accomplished 30 flights in the “ Early Science” program as well as a deployment to Germany. The next observing period, known as Cycle 1, is scheduled to begin in late fall 2012. It includes 46 science flights grouped in four multi-week observing campaigns spread through a 13-month span. Automation of the flight scheduling process offers a major challenge to the SOFIA mission operations. First because it is needed to mitigate its relatively high cost per unit observing time compared to space-borne missions. Second because automated scheduling techniques available for ground-based and space-based telescopes are inappropriate for an airborne observatory. Although serious attempts have been made in the past to solve part of the problem, until recently mission operations staff was still manually scheduling flights. We present in this paper a new automated solution for generating SOFIA's long-term schedules. We describe the constraints that should be satisfied to solve the SOFIA scheduling problem in the context of real operations. We establish key formulas required to efficiently calculate the aircraft course over ground when evaluating flight schedules. We describe the foundations of the SOFIA long-term scheduler, the constraint representation, and the random search based algorithm that generates observation and instrument schedules. Finally, we report on how the new long-term scheduler has been used in operations to date.
Automated Long - Term Scheduling for the SOFIA Airborne Observatory
NASA Technical Reports Server (NTRS)
Civeit, Thomas
2013-01-01
The NASA Stratospheric Observatory for Infrared Astronomy (SOFIA) is a joint US/German project to develop and operate a gyro-stabilized 2.5-meter telescope in a Boeing 747SP. SOFIA's first science observations were made in December 2010. During 2011, SOFIA accomplished 30 flights in the "Early Science" program as well as a deployment to Germany. The new observing period, known as Cycle 1, is scheduled to begin in 2012. It includes 46 science flights grouped in four multi-week observing campaigns spread through a 13-month span. Automation of the flight scheduling process offers a major challenge to the SOFIA mission operations. First because it is needed to mitigate its relatively high cost per unit observing time compared to space-borne missions. Second because automated scheduling techniques available for ground-based and space-based telescopes are inappropriate for an airborne observatory. Although serious attempts have been made in the past to solve part of the problem, until recently mission operations staff was still manually scheduling flights. We present in this paper a new automated solution for generating SOFIA long-term schedules that will be used in operations from the Cycle 1 observing period. We describe the constraints that should be satisfied to solve the SOFIA scheduling problem in the context of real operations. We establish key formulas required to efficiently calculate the aircraft course over ground when evaluating flight schedules. We describe the foundations of the SOFIA long-term scheduler, the constraint representation, and the random search based algorithm that generates observation and instrument schedules. Finally, we report on how the new long-term scheduler has been used in operations to date.
Quantifying Scheduling Challenges for Exascale System Software
Mondragon, Oscar; Bridges, Patrick G.; Jones, Terry R
2015-01-01
The move towards high-performance computing (HPC) ap- plications comprised of coupled codes and the need to dra- matically reduce data movement is leading to a reexami- nation of time-sharing vs. space-sharing in HPC systems. In this paper, we discuss and begin to quantify the perfor- mance impact of a move away from strict space-sharing of nodes for HPC applications. Specifically, we examine the po- tential performance cost of time-sharing nodes between ap- plication components, we determine whether a simple coor- dinated scheduling mechanism can address these problems, and we research how suitable simple constraint-based opti- mization techniques are for solving scheduling challenges in this regime. Our results demonstrate that current general- purpose HPC system software scheduling and resource al- location systems are subject to significant performance de- ciencies which we quantify for six representative applica- tions. Based on these results, we discuss areas in which ad- ditional research is needed to meet the scheduling challenges of next-generation HPC systems.
2007 Wholesale Power Rate Schedules : 2007 General Rate Schedule Provisions.
United States. Bonneville Power Administration.
2006-11-01
This schedule is available for the contract purchase of Firm Power to be used within the Pacific Northwest (PNW). Priority Firm (PF) Power may be purchased by public bodies, cooperatives, and Federal agencies for resale to ultimate consumers, for direct consumption, and for Construction, Test and Start-Up, and Station Service. Rates in this schedule are in effect beginning October 1, 2006, and apply to purchases under requirements Firm Power sales contracts for a three-year period. The Slice Product is only available for public bodies and cooperatives who have signed Slice contracts for the FY 2002-2011 period. Utilities participating in the Residential Exchange Program (REP) under Section 5(c) of the Northwest Power Act may purchase Priority Firm Power pursuant to the Residential Exchange Program. Rates under contracts that contain charges that escalate based on BPA's Priority Firm Power rates shall be based on the three-year rates listed in this rate schedule in addition to applicable transmission charges. This rate schedule supersedes the PF-02 rate schedule, which went into effect October 1, 2001. Sales under the PF-07 rate schedule are subject to BPA's 2007 General Rate Schedule Provisions (2007 GRSPs). Products available under this rate schedule are defined in the 2007 GRSPs. For sales under this rate schedule, bills shall be rendered and payments due pursuant to BPA's 2007 GRSPs and billing process.
Schedule-induced licking during multiple schedules1
Jacquet, Yasuko Filby
1972-01-01
Schedule-induced polydipsia was studied in rats bar pressing under two-component multiple schedules of food reinforcement. The first component of the multiple schedule was a variable-interval 1-min schedule throughout the experiment. The schedule comprising the second component was varied over blocks of sessions in terms of rate and magnitude of reinforcement, and was either variable-interval 3-min (one pellet), variable-interval 3-min (three pellets), variable-interval 1-min (one pellet), or extinction. Water intake per session varied with the rate of reinforcement in the schedule comprising the second component and was highest when the schedule was variable-interval 1-min. Both bar-pressing behavior and licking behavior showed behavioral interactions between the two components of the multiple schedules. With magnitude of reinforcement held constant, a matching relationship was observed between lick rate and reinforcement rate; the relative frequency of licks in the constant component matched the relative frequency of reinforcement in that component. Bar pressing, however, showed only a moderate degree of relativity matching. During the schedule-induced licking, a burst of licking followed each delivery of a pellet (post-prandial drinking). The duration of these bursts of licking was observed to be a function of the inter-reinforcement interval. PMID:16811598
Hierarchical scheduling method of UAV resources for emergency surveying
NASA Astrophysics Data System (ADS)
Zhang, Junxiao; Zhu, Qing; Shen, Fuqiang; Miao, Shuangxi; Cao, Zhenyu; Weng, Qiqiang
2015-12-01
Traditional mission scheduling methods are unable to meet the timeliness requirements of emergency surveying. Different size and overlaps of different missions lead to inefficient scheduling and poor mission returns. Especially for UAVs, based on their agile and flexible ability, the scheduling result becomes diversiform; as affected by environment and unmanned aerial vehicle performance, different scheduling will lead to different time costs and mission payoffs. An effective scheduling solution is to arrange the UAVs reasonably to complete as many as missions possible with better quality and satisfaction of different demands. This paper proposes a method for mission decomposition or aggregation to generate a mission unit for specific UAVs based on the spatio-temporal constraints of different missions and UAV observation ability demands. In this way, the problems of lack or redundancy of resource scheduling, which can be caused by mission overload, various information demands and spatial overlapping will be effectively reduced. Furthermore, the global efficiency evaluation function is built by considering typical scheduling objectives, such as mission returns, priority and load balancing of resources. Then, an improved ant colony algorithm is designed to acquire an optimal scheduling scheme and the dynamic adjustment strategy is employed. Finally, the correctness and validity are demonstrated by the simulation experiment.
Predit: A temporal predictive framework for scheduling systems
NASA Technical Reports Server (NTRS)
Paolucci, E.; Patriarca, E.; Sem, M.; Gini, G.
1992-01-01
Scheduling can be formalized as a Constraint Satisfaction Problem (CSP). Within this framework activities belonging to a plan are interconnected via temporal constraints that account for slack among them. Temporal representation must include methods for constraints propagation and provide a logic for symbolic and numerical deductions. In this paper we describe a support framework for opportunistic reasoning in constraint directed scheduling. In order to focus the attention of an incremental scheduler on critical problem aspects, some discrete temporal indexes are presented. They are also useful for the prediction of the degree of resources contention. The predictive method expressed through our indexes can be seen as a Knowledge Source for an opportunistic scheduler with a blackboard architecture.
Efficient static scheduling of loops on synchronous multiprocessors
Zaky, A.M.
1989-01-01
This dissertation investigates efficient compile-time scheduling techniques for exploiting parallelism on synchronous multiprocessors. Synchronous multiprocessors, e.g. Very Long Instruction Word (VLIW) machines, are very effective in utilizing unstructured fine-grained parallelism in programs. The effectiveness of such machines is crucially dependent on the static compile-time analysis and detection of potential parallelism. The first part of the dissertation focuses on scheduling sequential loops on multiprocessors with multiple identical processor units. The problem of determining the maximal initiation rate for the execution of a sequential loop with uniform dependence distances on a synchronous multiprocessor is addressed and cast as an eigenvalue problem in a path algebra. A low-order polynomial algorithm for the determination of the optimal loop initiation rate is developed, and a schedule that exploits fine-grained parallelism and achieves the optimal initiation rate is developed under an idealized unbounded processor model. Next, the concepts developed above are extended to deal with perfectly-nested loops with uniform dependences. A strategy is developed to identify both the loop level and fine-grained expression level parallelism in nested loops, and to efficiently schedule such loops on synchronous multiprocessors. Loop scheduling techniques such as Do-Across, Wavefront scheduling, and fine-grained scheduling techniques such as loop unfolding are shown to be derivable within the presented framework.
A Novel Particle Swarm Optimization Approach for Grid Job Scheduling
NASA Astrophysics Data System (ADS)
Izakian, Hesam; Tork Ladani, Behrouz; Zamanifar, Kamran; Abraham, Ajith
This paper represents a Particle Swarm Optimization (PSO) algorithm, for grid job scheduling. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. In this paper we used a PSO approach for grid job scheduling. The scheduler aims at minimizing makespan and flowtime simultaneously. Experimental studies show that the proposed novel approach is more efficient than the PSO approach reported in the literature.
Job Shop Scheduling Focusing on Role of Buffer
NASA Astrophysics Data System (ADS)
Hino, Rei; Kusumi, Tetsuya; Yoo, Jae-Kyu; Shimizu, Yoshiaki
A scheduling problem is formulated in order to consistently manage each manufacturing resource, including machine tools, assembly robots, AGV, storehouses, material shelves, and so on. The manufacturing resources are classified into three types: producer, location, and mover. This paper focuses especially on the role of the buffer, and the differences among these types are analyzed. A unified scheduling formulation is derived from the analytical results based on the resource’s roles. Scheduling procedures based on dispatching rules are also proposed in order to numerically evaluate job shop-type production having finite buffer capacity. The influences of the capacity of bottle-necked production devices and the buffer on productivity are discussed.
1993 Wholesale Power and Transmission Rate Schedules.
US Bonneville Power Administration
1993-10-01
Bonneville Power Administration 1993 Wholesale Power Rate Schedules and General Rate Schedule Provisions and 1993 Transmission Rate Schedules and General Transmission Rate Schedule Provisions, contained herein, were approved on an interim basis effective October 1, 1993. These rate schedules and provisions were approved by the Federal Energy Commission, United States Department of Energy, in September, 1993. These rate schedules and provisions supersede the Administration`s Wholesale Power Rate Schedules and General Rate Schedule Provisions and Transmission Rate Schedules and General Transmission Rate Schedule Provisions effective October 1, 1991.
ST - SCHEDULE TRACKER COMPUTER PROGRAM
NASA Technical Reports Server (NTRS)
Collazo, F. F.
1994-01-01
The Schedule Organizer, SO (COSMIC Program MSC-21525), Schedule Tracker, ST, and Schedule Report Generator, SRG (COSMIC Program MSC-21527), are programs that manipulate data base files in ways that are advantageous to scheduling applications. Originally designed for the Space Shuttle flight schedule, the program can be easily modified for other scheduling situations. Schedule Organizer provides a simple method for generating distribution lists. These distribution lists contain readers' names for each task schedule defined by the input files. Schedule Tracker provides an effective method for tracking tasks that are 'past due' and/or 'near term'. ST generates reports for each responsible staff member with one or more assigned tasks that fall within the two listed categories. This enables an engineering manager to monitor tasks assigned to staff by running ST on a weekly basis. ST only lists tasks on reports that have become past due or are scheduled for recent completion (near term). Schedule Report Generator provides a simple method for generating periodic schedule reports. ST and SRG use the same data base file as input. The common data base file has a maximum number of 400 entries. The time span of all three programs is nineteen months. Both of these maximum numbers can be modified by the user. ST requires the VMS Operating System on DEC VAX and was written in PL/1 and DEC Command Language (DCL). The program requires a memory of 233KB. ST can be purchased separately or in a package (COSMIC Program COS-10021) containing SO, ST, and SRG. ST was developed in 1985.
Solution and reasoning reuse in space planning and scheduling applications
NASA Technical Reports Server (NTRS)
Verfaillie, Gerard; Schiex, Thomas
1994-01-01
In the space domain, as in other domains, the CSP (Constraint Satisfaction Problems) techniques are increasingly used to represent and solve planning and scheduling problems. But these techniques have been developed to solve CSP's which are composed of fixed sets of variables and constraints, whereas many planning and scheduling problems are dynamic. It is therefore important to develop methods which allow a new solution to be rapidly found, as close as possible to the previous one, when some variables or constraints are added or removed. After presenting some existing approaches, this paper proposes a simple and efficient method, which has been developed on the basis of the dynamic backtracking algorithm. This method allows previous solution and reasoning to be reused in the framework of a CSP which is close to the previous one. Some experimental results on general random CSPs and on operation scheduling problems for remote sensing satellites are given.
Quay crane scheduling with handling priority in port container terminals
NASA Astrophysics Data System (ADS)
Lee, Der-Horng; Qiu Wang, Hui; Miao, Lixin
2008-02-01
The quay crane scheduling problem studied in this article is to determine a handling sequence of ship bays for quay cranes assigned to a container ship considering handling priority of every ship bay. This article provides a mixed integer programming model for the considered problem. A genetic algorithm (GA) is proposed to obtain near-optimal solutions. Computational experiments to examine the proposed model and solution algorithm are described. The computational results show that the proposed GA is effective and efficient in solving the considered quay crane scheduling problem.
Automated Planning and Scheduling for Space Mission Operations
NASA Technical Reports Server (NTRS)
Chien, Steve; Jonsson, Ari; Knight, Russell
2005-01-01
Research Trends: a) Finite-capacity scheduling under more complex constraints and increased problem dimensionality (subcontracting, overtime, lot splitting, inventory, etc.) b) Integrated planning and scheduling. c) Mixed-initiative frameworks. d) Management of uncertainty (proactive and reactive). e) Autonomous agent architectures and distributed production management. e) Integration of machine learning capabilities. f) Wider scope of applications: 1) analysis of supplier/buyer protocols & tradeoffs; 2) integration of strategic & tactical decision-making; and 3) enterprise integration.
NASA Astrophysics Data System (ADS)
Buchner, Johannes
2011-12-01
Scheduling, the task of producing a time table for resources and tasks, is well-known to be a difficult problem the more resources are involved (a NP-hard problem). This is about to become an issue in Radio astronomy as observatories consisting of hundreds to thousands of telescopes are planned and operated. The Square Kilometre Array (SKA), which Australia and New Zealand bid to host, is aiming for scales where current approaches -- in construction, operation but also scheduling -- are insufficent. Although manual scheduling is common today, the problem is becoming complicated by the demand for (1) independent sub-arrays doing simultaneous observations, which requires the scheduler to plan parallel observations and (2) dynamic re-scheduling on changed conditions. Both of these requirements apply to the SKA, especially in the construction phase. We review the scheduling approaches taken in the astronomy literature, as well as investigate techniques from human schedulers and today's observatories. The scheduling problem is specified in general for scientific observations and in particular on radio telescope arrays. Also taken into account is the fact that the observatory may be oversubscribed, requiring the scheduling problem to be integrated with a planning process. We solve this long-term scheduling problem using a time-based encoding that works in the very general case of observation scheduling. This research then compares algorithms from various approaches, including fast heuristics from CPU scheduling, Linear Integer Programming and Genetic algorithms, Branch-and-Bound enumeration schemes. Measures include not only goodness of the solution, but also scalability and re-scheduling capabilities. In conclusion, we have identified a fast and good scheduling approach that allows (re-)scheduling difficult and changing problems by combining heuristics with a Genetic algorithm using block-wise mutation operations. We are able to explain and eradicate two problems in the
Feature Clustering for Accelerating Parallel Coordinate Descent
Scherrer, Chad; Tewari, Ambuj; Halappanavar, Mahantesh; Haglin, David J.
2012-12-06
We demonstrate an approach for accelerating calculation of the regularization path for L1 sparse logistic regression problems. We show the benefit of feature clustering as a preconditioning step for parallel block-greedy coordinate descent algorithms.
Spike: AI scheduling for Hubble Space Telescope after 18 months of orbital operations
NASA Technical Reports Server (NTRS)
Johnston, Mark D.
1992-01-01
This paper is a progress report on the Spike scheduling system, developed by the Space Telescope Science Institute for long-term scheduling of Hubble Space Telescope (HST) observations. Spike is an activity-based scheduler which exploits artificial intelligence (AI) techniques for constraint representation and for scheduling search. The system has been in operational use since shortly after HST launch in April 1990. Spike was adopted for several other satellite scheduling problems; of particular interest was the demonstration that the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. We describe the recent progress made in scheduling search techniques, the lessons learned from early HST operations, and the application of Spike to other problem domains. We also describe plans for the future evolution of the system.
Planning as a Precursor to Scheduling for Space Station Payload Operations
NASA Technical Reports Server (NTRS)
Howell, Eric; Maxwell, Theresa
1995-01-01
Contemporary schedulers attempt to solve the problem of best fitting a set of activities into an available timeframe while still satisfying the necessary constraints. This approach produces results which are optimized for the region of time the scheduler is able to process, satisfying the near term goals of the operation. In general the scheduler is not able to reason about the activities which precede or follow the window into which it is inputs to scheduling so that the intermediate placing activities. This creates a problem for operations which are composed of many activities spanning long durations (which exceed the scheduler's reasoning horizon) such as the continuous operations environment for payload operations on the Space Station. Not only must the near term scheduling objectives be met, but somehow the results of near term scheduling must be made to support the attainment of long term goals.
Learning Search Control Knowledge for Deep Space Network Scheduling
NASA Technical Reports Server (NTRS)
Gratch, Jonathan; Chien, Steve; DeJong, Gerald
1993-01-01
While the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, for specific distributions of problems and constraints, domain-specific solutions have been shown to perform in much better than exponential time.
Optimum connection management scheduling
NASA Astrophysics Data System (ADS)
Kadar, Ivan
2000-08-01
Connection Management plays a key role in both distributed 'local' network-centric and 'globally' connected info- centric systems. The role of Connection Management is to provide seamless demand-based sharing of the information products. For optimum distributed information fusion performance, these systems must minimize communications delays and maximize message throughput, and at the same time take into account relative-sensors-targets geometrical constraints and data pedigree. In order to achieve overall distributed 'network' effectiveness, these systems must be adaptive, and be able to distribute data s needed in real- time. A system concept will be described which provides optimum capacity-based information scheduling. A specific example, based on a satellite channel, is used to illustrate simulated performance results and their effects on fusion systems performance.
Parallel machine scheduling with a common server
Hall, N.; Sriskandarajah, C.; Potts, C.
1994-12-31
This paper considers the nonpreemptive scheduling of a given set of jobs on several identical, parallel machines. Each job must be processed on one of the machines. Prior to processing, a job must be loaded (setup) by a single server onto the relevant machine. The server may be a human operator, a robot, or a piece of specialized equipment. We study a number of classical scheduling objectives in this environment, including makespan, maximum lateness, the sum of completion times, the number of late jobs, and total tardiness, as well as weighted versions of some of these. The number of machines may be constant or arbitrary. Setup times may be unit, equal, or arbitrary. Processing times may be unit or arbitrary. For each problem considered, we attempt to provide either an efficient algorithm, or a proof that such an algorithm is unlikely to exist. Our results provide a mapping of the computational complexity of these problems. Included in these results are generalizations of the classical algorithms of Moore, Lawler and Moore and Lawler. In addition, we describe two heuristics for makespan scheduling in this environment, and provide an exact analysis of their worst-case performance.
Scheduling trucks in container terminals using a genetic algorithm
NASA Astrophysics Data System (ADS)
Ng, W. C.; Mak, K. L.; Zhang, Y. X.
2007-01-01
Trucks are the most popular transport equipment in most mega-terminals, and scheduling them to minimize makespan is a challenge that this article addresses and attempts to resolve. Specifically, the problem of scheduling a fleet of trucks to perform a set of transportation jobs with sequence-dependent processing times and different ready times is investigated, and the use of a genetic algorithm (GA) to address the scheduling problem is proposed. The scheduling problem is formulated as a mixed integer program. It is noted that the scheduling problem is NP-hard and the computational effort required to solve even small-scale test problems is prohibitively large. A crossover scheme has been developed for the proposed GA. Computational experiments are carried out to compare the performance of the proposed GA with that of GAs using six popular crossover schemes. Computational results show that the proposed GA performs best, with its solutions on average 4.05% better than the best solutions found by the other six GAs.
A new model of scheduling in manufacturing: tasks, roles, and monitoring.
Jackson, Sarah; Wilson, John R; MacCarthy, Bart L
2004-01-01
For over 3 decades there was a belief that computer-based solutions would "solve" complex industrial scheduling problems, yet most manufacturing organizations still require human contributions for effective scheduling performance. We present a new model of scheduling for the development and implementation of effective scheduling systems within manufacturing companies. The model derives from investigating the work of 7 schedulers in 4 manufacturing environments using a qualitative field study approach, for which novel field-based data collection and analysis methods were developed. The results show that scheduling in practice comprises task, role, and monitoring activities and that the business environment influences a scheduler at work. A new definition of scheduling is presented that includes the significant facilitation and implementation aspects of human scheduling ignored by many computer-based scheduling approaches. The implications for this model extend across the domains of human factors and operations management, especially for the analysis and improvement of existing and new production planning and control processes and enterprise information systems. Actual or potential applications of this research include the analysis, design, and management of planning, scheduling, and control processes in industry; the selection, training, and support of production schedulers; and the allocation of tasks to humans and computer systems in industrial planning, scheduling, and control processes. PMID:15573550
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
NASA Astrophysics Data System (ADS)
Berthold, Timo; Heinz, Stefan; Lübbecke, Marco E.; Möhring, Rolf H.; Schulz, Jens
We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of practical relevance. Jobs have to be scheduled on (renewable) resources subject to precedence constraints such that the resource capacities are never exceeded and the latest completion time of all jobs is minimized.
A Comparison of Dense-to-Lean and Fixed Lean Schedules of Alternative Reinforcement and Extinction
ERIC Educational Resources Information Center
Hagopian, Louis P.; Toole, Lisa M.; Long, Ethan S.; Bowman, Lynn G.; Lieving, Gregory A.
2004-01-01
Behavior-reduction interventions typically employ dense schedules of alternative reinforcement in conjunction with operant extinction for problem behavior. After problem behavior is reduced in the initial treatment stages, schedule thinning is routinely conducted to make the intervention more practical in natural environments. In the current…
Scheduling Results for the THEMIS Observation Scheduling Tool
NASA Technical Reports Server (NTRS)
Mclaren, David; Rabideau, Gregg; Chien, Steve; Knight, Russell; Anwar, Sadaat; Mehall, Greg; Christensen, Philip
2011-01-01
We describe a scheduling system intended to assist in the development of instrument data acquisitions for the THEMIS instrument, onboard the Mars Odyssey spacecraft, and compare results from multiple scheduling algorithms. This tool creates observations of both (a) targeted geographical regions of interest and (b) general mapping observations, while respecting spacecraft constraints such as data volume, observation timing, visibility, lighting, season, and science priorities. This tool therefore must address both geometric and state/timing/resource constraints. We describe a tool that maps geometric polygon overlap constraints to set covering constraints using a grid-based approach. These set covering constraints are then incorporated into a greedy optimization scheduling algorithm incorporating operations constraints to generate feasible schedules. The resultant tool generates schedules of hundreds of observations per week out of potential thousands of observations. This tool is currently under evaluation by the THEMIS observation planning team at Arizona State University.
NASA Technical Reports Server (NTRS)
Chevalley, Eric; Parke, Bonny; Kraut, Josh M.; Bienert, Nancy; Omar, Faisal; Palmer, Everett A.
2015-01-01
In this paper, successful Time-Based Flow Management (TBFM) scheduling systems for arrivals are considered and adapted to apply to departures. We present a concept of operations that integrates Controller-Managed Spacing tools for departures (CMS-D) with existing tactical departure scheduling tools to coordinate demand at departure fixes in a metroplex environment. We tested our concept in a Human-in-the-Loop simulation and compared the effect of two scheduling conditions: 1) "Departure Scheduling" consisting of an emulation of the Integrated Departure and Arrival Capability (IDAC) where Towers and a Planner (Traffic Management Coordinator at the appropriate facility) coordinate aircraft scheduled takeoff times to departure fixes; and 2) "Arrival Sensitive Departure Scheduling" where, in addition, the Tower and Planner also consider arrival Scheduled Time of Arrivals (STAs) at the airport's dependent runway. Results indicate little difference between the two scheduling conditions, but a large difference between the No Tools and the two scheduling conditions with CMS-D tools. The scheduling/CMS-D tools conditions markedly reduced heading, speed clearances, and workload for controllers who were merging flows at the departure fixes. In the tool conditions, departure controllers conditioned departures earlier rather than later when aircraft were tied near the departure fixes. In the scheduling/CMS-D tools conditions, departures crossed the departure fixes 50 seconds earlier and with an 8% error rate (consisting of time ahead or behind desired time of arrival) compared to a 19% error rate in the No Tool condition. Two exploratory runs showed that similar beneficial effects can be obtained only with the CMS-D tools without scheduling takeoff times, but at the cost of a somewhat higher workload for controllers, indicating the benefits of pre-departure scheduling of aircraft with minimal delays. Hence, we found that CMS-D tools were very beneficial in the metroplex
Artificial intelligence for the CTA Observatory scheduler
NASA Astrophysics Data System (ADS)
Colomé, Josep; Colomer, Pau; Campreciós, Jordi; Coiffard, Thierry; de Oña, Emma; Pedaletti, Giovanna; Torres, Diego F.; Garcia-Piquer, Alvaro
2014-08-01
The Cherenkov Telescope Array (CTA) project will be the next generation ground-based very high energy gamma-ray instrument. The success of the precursor projects (i.e., HESS, MAGIC, VERITAS) motivated the construction of this large infrastructure that is included in the roadmap of the ESFRI projects since 2008. CTA is planned to start the construction phase in 2015 and will consist of two arrays of Cherenkov telescopes operated as a proposal-driven open observatory. Two sites are foreseen at the southern and northern hemispheres. The CTA observatory will handle several observation modes and will have to operate tens of telescopes with a highly efficient and reliable control. Thus, the CTA planning tool is a key element in the control layer for the optimization of the observatory time. The main purpose of the scheduler for CTA is the allocation of multiple tasks to one single array or to multiple sub-arrays of telescopes, while maximizing the scientific return of the facility and minimizing the operational costs. The scheduler considers long- and short-term varying conditions to optimize the prioritization of tasks. A short-term scheduler provides the system with the capability to adapt, in almost real-time, the selected task to the varying execution constraints (i.e., Targets of Opportunity, health or status of the system components, environment conditions). The scheduling procedure ensures that long-term planning decisions are correctly transferred to the short-term prioritization process for a suitable selection of the next task to execute on the array. In this contribution we present the constraints to CTA task scheduling that helped classifying it as a Flexible Job-Shop Problem case and finding its optimal solution based on Artificial Intelligence techniques. We describe the scheduler prototype that uses a Guarded Discrete Stochastic Neural Network (GDSN), for an easy representation of the possible long- and short-term planning solutions, and Constraint
NASA Technical Reports Server (NTRS)
Morrell, R. A.; Odoherty, R. J.; Ramsey, H. R.; Reynolds, C. C.; Willoughby, J. K.; Working, R. D.
1975-01-01
Data and analyses related to a variety of algorithms for solving typical large-scale scheduling and resource allocation problems are presented. The capabilities and deficiencies of various alternative problem solving strategies are discussed from the viewpoint of computer system design.
Astro-E's Mission Independent Scheduling Suite
NASA Astrophysics Data System (ADS)
Antunes, A.; Saunders, A.; Hilton, P.
The next generation of Mission Scheduling software will be cheaper, easier to customize for a mission, and faster than current planning systems. TAKO (``Timeline Assembler, Keyword Oriented'', or in Japanese, ``octopus'') is our in-progress suite of software that takes database input and produces mission timelines. Our approach uses openly available hardware, software, and compilers, and applies current scheduling and N-body methods to reduce the scope of the problem. A flexible set of keywords lets the user define mission-wide and individual target constraints, and alter them on-the-fly. Our goal is that TAKO will be easily adapted for many missions, and will be usable with a minimum of training. The especially pertinent deadline of Astro-E's launch motivates us to convert theory into software within 2 years. The design choices, methods for reducing the data and providing flexibility, and steps to get TAKO up and running for any mission are discussed.
Grid scheduling divisible loads from two sources
Moges, M.A.; Yu, D.; Robertazzi, T.
2009-07-10
To date closed form solutions for optimal finish time and job allocation are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for single level tree networks with two load originating processors. Solutions for an optimal allocation of fractions of load to nodes in single level tree networks are obtained via linear programming. A unique scheduling strategy that allows one to obtain closed form solutions for the optimal finish time and load allocation for each processor in the network is also presented. The tradeoff between linear programming and closed form solutions in terms of underlying assumptions is examined. Finally, a performance evaluation of a two source homogeneous single level tree network with concurrent communication strategy is presented.
Knowledge based tools for Hubble Space Telescope planning and scheduling: Constraints and strategies
NASA Technical Reports Server (NTRS)
Miller, Glenn; Johnston, Mark; Vick, Shon; Sponsler, Jeff; Lindenmayer, Kelly
1988-01-01
The Hubble Space Telescope (HST) presents an especially challenging scheduling problem since a year's observing program encompasses tens of thousands of exposures facing numerous coupled constraints. Recent progress in the development of planning and scheduling tools is discussed which augment the existing HST ground system. General methods for representing activities, constraints, and constraint satisfaction, and time segmentation were implemented in a scheduling testbed. The testbed permits planners to evaluate optimal scheduling time intervals, calculate resource usage, and to generate long and medium range plans. Graphical displays of activities, constraints, and plans are an important feature of the system. High-level scheduling strategies using rule based and neural net approaches were implemented.
Two-machine flow shop scheduling integrated with preventive maintenance planning
NASA Astrophysics Data System (ADS)
Wang, Shijin; Liu, Ming
2016-02-01
This paper investigates an integrated optimisation problem of production scheduling and preventive maintenance (PM) in a two-machine flow shop with time to failure of each machine subject to a Weibull probability distribution. The objective is to find the optimal job sequence and the optimal PM decisions before each job such that the expected makespan is minimised. To investigate the value of integrated scheduling solution, computational experiments on small-scale problems with different configurations are conducted with total enumeration method, and the results are compared with those of scheduling without maintenance but with machine degradation, and individual job scheduling combined with independent PM planning. Then, for large-scale problems, four genetic algorithm (GA) based heuristics are proposed. The numerical results with several large problem sizes and different configurations indicate the potential benefits of integrated scheduling solution and the results also show that proposed GA-based heuristics are efficient for the integrated problem.
A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites
NASA Technical Reports Server (NTRS)
Globus, Al; Crawford, James; Lohn, Jason; Pryor, Anna
2003-01-01
Earth observing satellite (EOS) scheduling is a complex real-world domain representative of a broad class of over-subscription scheduling problems. Over-subscription problems are those where requests for a facility exceed its capacity. These problems arise in a wide variety of NASA and terrestrial domains and are .XI important class of scheduling problems because such facilities often represent large capital investments. We have run experiments comparing multiple variants of the genetic algorithm, hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on two variants of a realistically-sized model of the EOS scheduling problem. These are implemented as permutation-based methods; methods that search in the space of priority orderings of observation requests and evaluate each permutation by using it to drive a greedy scheduler. Simulated annealing performs best and random mutation operators outperform our squeaky (more intelligent) operator. Furthermore, taking smaller steps towards the end of the search improves performance.
Modeling the Cray memory scheduler
Wickham, K.L.; Litteer, G.L.
1992-04-01
This report documents the results of a project to evaluate low cost modeling and simulation tools when applied to modeling the Cray memory scheduler. The specific tool used is described and the basics of the memory scheduler are covered. Results of simulations using the model are discussed and a favorable recommendation is made to make more use of this inexpensive technology.
Flexible Work Schedules. ERIC Digest.
ERIC Educational Resources Information Center
Kerka, Sandra
Flexible work schedules are one response to changes in the composition of the work force, new life-styles, and changes in work attitudes. Types of alternative work schedules are part-time and temporary employment, job sharing, and flextime. Part-time workers are a diverse group--women, the very young, and older near-retirees. Although part-time…
Web-based irrigation scheduler
Technology Transfer Automated Retrieval System (TEKTRAN)
Currently, few web-based irrigation scheduling tools are available for the humid growing environments of the Mid-South. Common irrigation scheduling systems rely on soil or weather data to estimate crop water use, and are more commonly calibrated for dry growing environments. Increasing use of water...
CABINS: Case-based interactive scheduler
NASA Technical Reports Server (NTRS)
Miyashita, Kazuo; Sycara, Katia
1992-01-01
In this paper we discuss the need for interactive factory schedule repair and improvement, and we identify case-based reasoning (CBR) as an appropriate methodology. Case-based reasoning is the problem solving paradigm that relies on a memory for past problem solving experiences (cases) to guide current problem solving. Cases similar to the current case are retrieved from the case memory, and similarities and differences of the current case to past cases are identified. Then a best case is selected, and its repair plan is adapted to fit the current problem description. If a repair solution fails, an explanation for the failure is stored along with the case in memory, so that the user can avoid repeating similar failures in the future. So far we have identified a number of repair strategies and tactics for factory scheduling and have implemented a part of our approach in a prototype system, called CABINS. As a future work, we are going to scale up CABINS to evaluate its usefulness in a real manufacturing environment.
Astronaut Office Scheduling System Software
NASA Technical Reports Server (NTRS)
Brown, Estevancio
2010-01-01
AOSS is a highly efficient scheduling application that uses various tools to schedule astronauts weekly appointment information. This program represents an integration of many technologies into a single application to facilitate schedule sharing and management. It is a Windows-based application developed in Visual Basic. Because the NASA standard office automation load environment is Microsoft-based, Visual Basic provides AO SS developers with the ability to interact with Windows collaboration components by accessing objects models from applications like Outlook and Excel. This also gives developers the ability to create newly customizable components that perform specialized tasks pertaining to scheduling reporting inside the application. With this capability, AOSS can perform various asynchronous tasks, such as gathering/ sending/ managing astronauts schedule information directly to their Outlook calendars at any time.
... will seem to be continually on the go—running, kicking, climbing, jumping. His attention span, which was ... his coordination. In the months ahead, your child’s running will become smoother and more coordinated. He’ll ...
Scheduling real-time, periodic jobs using imprecise results
NASA Technical Reports Server (NTRS)
Liu, Jane W. S.; Lin, Kwei-Jay; Natarajan, Swaminathan
1987-01-01
A process is called a monotone process if the accuracy of its intermediate results is non-decreasing as more time is spent to obtain the result. The result produced by a monotone process upon its normal termination is the desired result; the error in this result is zero. External events such as timeouts or crashes may cause the process to terminate prematurely. If the intermediate result produced by the process upon its premature termination is saved and made available, the application may still find the result unusable and, hence, acceptable; such a result is said to be an imprecise one. The error in an imprecise result is nonzero. The problem of scheduling periodic jobs to meet deadlines on a system that provides the necessary programming language primitives and run-time support for processes to return imprecise results is discussed. This problem differs from the traditional scheduling problems since the scheduler may choose to terminate a task before it is completed, causing it to produce an acceptable but imprecise result. Consequently, the amounts of processor time assigned to tasks in a valid schedule can be less than the amounts of time required to complete the tasks. A meaningful formulation of this problem taking into account the quality of the overall result is discussed. Three algorithms for scheduling jobs for which the effects of errors in results produced in different periods are not cumulative are described, and their relative merits are evaluated.
Optimal physicians schedule in an Intensive Care Unit
NASA Astrophysics Data System (ADS)
Hidri, L.; Labidi, M.
2016-05-01
In this paper, we consider a case study for the problem of physicians scheduling in an Intensive Care Unit (ICU). The objective is to minimize the total overtime under complex constraints. The considered ICU is composed of three buildings and the physicians are divided accordingly into six teams. The workload is assigned to each team under a set of constraints. The studied problem is composed of two simultaneous phases: composing teams and assigning the workload to each one of them. This constitutes an additional major hardness compared to the two phase's process: composing teams and after that assigning the workload. The physicians schedule in this ICU is used to be done manually each month. In this work, the studied physician scheduling problem is formulated as an integer linear program and solved optimally using state of the art software. The preliminary experimental results show that 50% of the overtime can be saved.
A new distributed systems scheduling algorithm: a swarm intelligence approach
NASA Astrophysics Data System (ADS)
Haghi Kashani, Mostafa; Sarvizadeh, Raheleh; Jameii, Mahdi
2011-12-01
The scheduling problem in distributed systems is known as an NP-complete problem, and methods based on heuristic or metaheuristic search have been proposed to obtain optimal and suboptimal solutions. The task scheduling is a key factor for distributed systems to gain better performance. In this paper, an efficient method based on memetic algorithm is developed to solve the problem of distributed systems scheduling. With regard to load balancing efficiently, Artificial Bee Colony (ABC) has been applied as local search in the proposed memetic algorithm. The proposed method has been compared to existing memetic-Based approach in which Learning Automata method has been used as local search. The results demonstrated that the proposed method outperform the above mentioned method in terms of communication cost.
Weighted fair queueing scheduling for World Wide Web proxy servers
NASA Astrophysics Data System (ADS)
El Abdouni Khayari, Rachid; Sadre, Ramin; Haverkort, Boudewijn R.; Zoschke, Norman
2002-07-01
Current world-wide web servers as well as proxy servers rely for their scheduling on services provided by the underlying operating system. In practice, this means that some form of first-come-first-served (FCFS) scheduling is utilised. Although FCFS is a reasonable scheduling strategy for job sequences that do not show much variance, in the world-wide web (WWW), however, it has been shown that the typical object sizes requested do exhibit heavy tails. This means that the probability to observe very long jobs (very large objects) is much higher than typically predicted using an exponential model. Under these circumstances, job scheduling on the basis of shortest-job first (SJF) has been shown to perform much better, in fact, to minimise the total average waiting time, simply by avoiding situations in which short jobs have to wait for very long one. However, SJF has as disadvantage that long jobs might suffer from starvation. In order to avoid the problems of both FCFS and SJF we present in this paper a new scheduling algorithm called class-based interleaving weighted fair queueing (CI-WFQ). This algorithm uses the specific characteristics of the job stream being served, that is, the distribution of the sizes of the objects being requested, to set its parameters such that good mean reponse times are obtained and starvation does not occur. In the paper, the new scheduling approach is introduced and compared, using trace-driven simulations, with existing scheduling approaches.
Processing Coordination Ambiguity
ERIC Educational Resources Information Center
Engelhardt, Paul E.; Ferreira, Fernanda
2010-01-01
We examined temporarily ambiguous coordination structures such as "put the butter in the bowl and the pan on the towel." Minimal Attachment predicts that the ambiguous noun phrase "the pan" will be interpreted as a noun-phrase coordination structure because it is syntactically simpler than clausal coordination. Constraint-based theories assume…