The comparison of predictive scheduling algorithms for different sizes of job shop scheduling problems

NASA Astrophysics Data System (ADS)

Paprocka, I.; Kempa, W. M.; Grabowik, C.; Kalinowski, K.; Krenczyk, D.

2016-08-01

In the paper a survey of predictive and reactive scheduling methods is done in order to evaluate how the ability of prediction of reliability characteristics influences over robustness criteria. The most important reliability characteristics are: Mean Time to Failure, Mean Time of Repair. Survey analysis is done for a job shop scheduling problem. The paper answers the question: what method generates robust schedules in the case of a bottleneck failure occurrence before, at the beginning of planned maintenance actions or after planned maintenance actions? Efficiency of predictive schedules is evaluated using criteria: makespan, total tardiness, flow time, idle time. Efficiency of reactive schedules is evaluated using: solution robustness criterion and quality robustness criterion. This paper is the continuation of the research conducted in the paper [1], where the survey of predictive and reactive scheduling methods is done only for small size scheduling problems.

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.

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.

Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.

PubMed

Yang, S; Wang, D

2000-01-01

This paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems. The proposed neural network can be easily constructed and can adaptively adjust its weights of connections and biases of units based on the sequence and resource constraints of the job-shop scheduling problem during its processing. Several heuristics that can be combined with the neural network are also presented. In the combined approaches, the neural network is used to obtain feasible solutions, the heuristic algorithms are used to improve the performance of the neural network and the quality of the obtained solutions. Simulations have shown that the proposed neural network and its combined approaches are efficient with respect to the quality of solutions and the solving speed.

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

NASA Astrophysics Data System (ADS)

Nouri, Houssem Eddine; Belkahla Driss, Olfa; Ghédira, Khaled

2018-03-01

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based clustered holonic multiagent model. First, a neighborhood-based genetic algorithm (NGA) is applied by a scheduler agent for a global exploration of the search space. Second, a local search technique is used by a set of cluster agents to guide the research in promising regions of the search space and to improve the quality of the NGA final population. The efficiency of our approach is explained by the flexible selection of the promising parts of the search space by the clustering operator after the genetic algorithm process, and by applying the intensification technique of the tabu search allowing to restart the search from a set of elite solutions to attain new dominant scheduling solutions. Computational results are presented using four sets of well-known benchmark literature instances. New upper bounds are found, showing the effectiveness of the presented approach.

Better approximation guarantees for job-shop scheduling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goldberg, L.A.; Paterson, M.; Srinivasan, A.

1997-06-01

Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein & Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work, and present further improvements for some important NP-hard special cases of this problem (e.g., in the preemptive case where machines can suspend work on operations and later resume). We also present NC algorithms with improved approximation guarantees for some NP-hard special cases.

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.

Open shop scheduling problem to minimize total weighted completion time

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai; Zhang, Qiang; Tang, Mengqian

2017-01-01

A given number of jobs in an open shop scheduling environment must each be processed for given amounts of time on each of a given set of machines in an arbitrary sequence. This study aims to achieve a schedule that minimizes total weighted completion time. Owing to the strong NP-hardness of the problem, the weighted shortest processing time block (WSPTB) heuristic is presented to obtain approximate solutions for large-scale problems. Performance analysis proves the asymptotic optimality of the WSPTB heuristic in the sense of probability limits. The largest weight block rule is provided to seek optimal schedules in polynomial time for a special case. A hybrid discrete differential evolution algorithm is designed to obtain high-quality solutions for moderate-scale problems. Simulation experiments demonstrate the effectiveness of the proposed algorithms.

Production scheduling and rescheduling with genetic algorithms.

PubMed

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.

Batch Scheduling for Hybrid Assembly Differentiation Flow Shop to Minimize Total Actual Flow Time

NASA Astrophysics Data System (ADS)

Maulidya, R.; Suprayogi; Wangsaputra, R.; Halim, A. H.

2018-03-01

A hybrid assembly differentiation flow shop is a three-stage flow shop consisting of Machining, Assembly and Differentiation Stages and producing different types of products. In the machining stage, parts are processed in batches on different (unrelated) machines. In the assembly stage, each part of the different parts is assembled into an assembly product. Finally, the assembled products will further be processed into different types of final products in the differentiation stage. In this paper, we develop a batch scheduling model for a hybrid assembly differentiation flow shop to minimize the total actual flow time defined as the total times part spent in the shop floor from the arrival times until its due date. We also proposed a heuristic algorithm for solving the problems. The proposed algorithm is tested using a set of hypothetic data. The solution shows that the algorithm can solve the problems effectively.

Asymptotic analysis of SPTA-based algorithms for no-wait flow shop scheduling problem with release dates.

PubMed

Ren, Tao; Zhang, Chuan; Lin, Lin; Guo, Meiting; Xie, Xionghang

2014-01-01

We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is provided for moderate scale problems. New lower bound is presented for evaluating the asymptotic optimality of the algorithms. Numerical simulations demonstrate the effectiveness of the proposed algorithms.

Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates

PubMed Central

Ren, Tao; Zhang, Chuan; Lin, Lin; Guo, Meiting; Xie, Xionghang

2014-01-01

We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is provided for moderate scale problems. New lower bound is presented for evaluating the asymptotic optimality of the algorithms. Numerical simulations demonstrate the effectiveness of the proposed algorithms. PMID:24764774

Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times.

PubMed

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.

Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times

PubMed Central

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

Performance of Extended Local Clustering Organization (LCO) for Large Scale Job-Shop Scheduling Problem (JSP)

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.

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.

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.

Environment-Aware Production Scheduling for Paint Shops in Automobile Manufacturing: A Multi-Objective Optimization Approach

PubMed Central

Zhang, Rui

2017-01-01

The traditional way of scheduling production processes often focuses on profit-driven goals (such as cycle time or material cost) while tending to overlook the negative impacts of manufacturing activities on the environment in the form of carbon emissions and other undesirable by-products. To bridge the gap, this paper investigates an environment-aware production scheduling problem that arises from a typical paint shop in the automobile manufacturing industry. In the studied problem, an objective function is defined to minimize the emission of chemical pollutants caused by the cleaning of painting devices which must be performed each time before a color change occurs. Meanwhile, minimization of due date violations in the downstream assembly shop is also considered because the two shops are interrelated and connected by a limited-capacity buffer. First, we have developed a mixed-integer programming formulation to describe this bi-objective optimization problem. Then, to solve problems of practical size, we have proposed a novel multi-objective particle swarm optimization (MOPSO) algorithm characterized by problem-specific improvement strategies. A branch-and-bound algorithm is designed for accurately assessing the most promising solutions. Finally, extensive computational experiments have shown that the proposed MOPSO is able to match the solution quality of an exact solver on small instances and outperform two state-of-the-art multi-objective optimizers in literature on large instances with up to 200 cars. PMID:29295603

Enhanced Specification and Verification for Timed Planning

DTIC Science & Technology

2009-02-28

Scheduling Problem The job-shop scheduling problem ( JSSP ) is a generic resource allocation problem in which common resources (“machines”) are required...interleaving of all processes Pi with the non-delay and mutual exclusion constraints: JSSP =̂ |||0<i6n Pi Where mutual-exclusion( JSSP ) For every complete...execution of JSSP (which terminates), its associated sched- ule S is a feasible schedule. An optimal schedule is a trace of JSSP with the minimum ending

Skipping Strategy (SS) for Initial Population of Job-Shop Scheduling Problem

NASA Astrophysics Data System (ADS)

Abdolrazzagh-Nezhad, M.; Nababan, E. B.; Sarim, H. M.

2018-03-01

Initial population in job-shop scheduling problem (JSSP) is an essential step to obtain near optimal solution. Techniques used to solve JSSP are computationally demanding. Skipping strategy (SS) is employed to acquire initial population after sequence of job on machine and sequence of operations (expressed in Plates-jobs and mPlates-jobs) are determined. The proposed technique is applied to benchmark datasets and the results are compared to that of other initialization techniques. It is shown that the initial population obtained from the SS approach could generate optimal solution.

A neural network approach to job-shop scheduling.

PubMed

Zhou, D N; Cherkassky, V; Baldwin, T R; Olson, D E

1991-01-01

A novel analog computational network is presented for solving NP-complete constraint satisfaction problems, i.e. job-shop scheduling. In contrast to most neural approaches to combinatorial optimization based on quadratic energy cost function, the authors propose to use linear cost functions. As a result, the network complexity (number of neurons and the number of resistive interconnections) grows only linearly with problem size, and large-scale implementations become possible. The proposed approach is related to the linear programming network described by D.W. Tank and J.J. Hopfield (1985), which also uses a linear cost function for a simple optimization problem. It is shown how to map a difficult constraint-satisfaction problem onto a simple neural net in which the number of neural processors equals the number of subjobs (operations) and the number of interconnections grows linearly with the total number of operations. Simulations show that the authors' approach produces better solutions than existing neural approaches to job-shop scheduling, i.e. the traveling salesman problem-type Hopfield approach and integer linear programming approach of J.P.S. Foo and Y. Takefuji (1988), in terms of the quality of the solution and the network complexity.

Generation of Look-Up Tables for Dynamic Job Shop Scheduling Decision Support Tool

NASA Astrophysics Data System (ADS)

Oktaviandri, Muchamad; Hassan, Adnan; Mohd Shaharoun, Awaluddin

2016-02-01

Majority of existing scheduling techniques are based on static demand and deterministic processing time, while most job shop scheduling problem are concerned with dynamic demand and stochastic processing time. As a consequence, the solutions obtained from the traditional scheduling technique are ineffective wherever changes occur to the system. Therefore, this research intends to develop a decision support tool (DST) based on promising artificial intelligent that is able to accommodate the dynamics that regularly occur in job shop scheduling problem. The DST was designed through three phases, i.e. (i) the look-up table generation, (ii) inverse model development and (iii) integration of DST components. This paper reports the generation of look-up tables for various scenarios as a part in development of the DST. A discrete event simulation model was used to compare the performance among SPT, EDD, FCFS, S/OPN and Slack rules; the best performances measures (mean flow time, mean tardiness and mean lateness) and the job order requirement (inter-arrival time, due dates tightness and setup time ratio) which were compiled into look-up tables. The well-known 6/6/J/Cmax Problem from Muth and Thompson (1963) was used as a case study. In the future, the performance measure of various scheduling scenarios and the job order requirement will be mapped using ANN inverse model.

A Genetic Algorithm for Flow Shop Scheduling with Assembly Operations to Minimize Makespan

NASA Astrophysics Data System (ADS)

Bhongade, A. S.; Khodke, P. M.

2014-04-01

Manufacturing systems, in which, several parts are processed through machining workstations and later assembled to form final products, is common. Though scheduling of such problems are solved using heuristics, available solution approaches can provide solution for only moderate sized problems due to large computation time required. In this work, scheduling approach is developed for such flow-shop manufacturing system having machining workstations followed by assembly workstations. The initial schedule is generated using Disjunctive method and genetic algorithm (GA) is applied further for generating schedule for large sized problems. GA is found to give near optimal solution based on the deviation of makespan from lower bound. The lower bound of makespan of such problem is estimated and percent deviation of makespan from lower bounds is used as a performance measure to evaluate the schedules. Computational experiments are conducted on problems developed using fractional factorial orthogonal array, varying the number of parts per product, number of products, and number of workstations (ranging upto 1,520 number of operations). A statistical analysis indicated the significance of all the three factors considered. It is concluded that GA method can obtain optimal makespan.

Genetic algorithm parameters tuning for resource-constrained project scheduling problem

NASA Astrophysics Data System (ADS)

Tian, Xingke; Yuan, Shengrui

2018-04-01

Project Scheduling Problem (RCPSP) is a kind of important scheduling problem. To achieve a certain optimal goal such as the shortest duration, the smallest cost, the resource balance and so on, it is required to arrange the start and finish of all tasks under the condition of satisfying project timing constraints and resource constraints. In theory, the problem belongs to the NP-hard problem, and the model is abundant. Many combinatorial optimization problems are special cases of RCPSP, such as job shop scheduling, flow shop scheduling and so on. At present, the genetic algorithm (GA) has been used to deal with the classical RCPSP problem and achieved remarkable results. Vast scholars have also studied the improved genetic algorithm for the RCPSP problem, which makes it to solve the RCPSP problem more efficiently and accurately. However, for the selection of the main parameters of the genetic algorithm, there is no parameter optimization in these studies. Generally, we used the empirical method, but it cannot ensure to meet the optimal parameters. In this paper, the problem was carried out, which is the blind selection of parameters in the process of solving the RCPSP problem. We made sampling analysis, the establishment of proxy model and ultimately solved the optimal parameters.

Energy-efficient approach to minimizing the energy consumption in an extended job-shop scheduling problem

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.

On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

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.

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

NASA Astrophysics Data System (ADS)

ZHAO, Ning; YE, Song; LI, Kaidian; CHEN, Siyu

2017-05-01

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP with time lags) seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algorithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation(IGTLP) and iterated greedy algorithm for non-permutation (IGTLNP). The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% computational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

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.

Analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times

NASA Astrophysics Data System (ADS)

Sharma, Pankaj; Jain, Ajai

2014-12-01

Stochastic dynamic job shop scheduling problem with consideration of sequence-dependent setup times are among the most difficult classes of scheduling problems. This paper assesses the performance of nine dispatching rules in such shop from makespan, mean flow time, maximum flow time, mean tardiness, maximum tardiness, number of tardy jobs, total setups and mean setup time performance measures viewpoint. A discrete event simulation model of a stochastic dynamic job shop manufacturing system is developed for investigation purpose. Nine dispatching rules identified from literature are incorporated in the simulation model. The simulation experiments are conducted under due date tightness factor of 3, shop utilization percentage of 90% and setup times less than processing times. Results indicate that shortest setup time (SIMSET) rule provides the best performance for mean flow time and number of tardy jobs measures. The job with similar setup and modified earliest due date (JMEDD) rule provides the best performance for makespan, maximum flow time, mean tardiness, maximum tardiness, total setups and mean setup time measures.

Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates

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.

Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop

NASA Astrophysics Data System (ADS)

Jiang, Fuhong; Zhang, Xingong; Bai, Danyu; Wu, Chin-Chia

2018-04-01

In this article, a competitive two-agent scheduling problem in a two-machine open shop is studied. The objective is to minimize the weighted sum of the makespans of two competitive agents. A complexity proof is presented for minimizing the weighted combination of the makespan of each agent if the weight α belonging to agent B is arbitrary. Furthermore, two pseudo-polynomial-time algorithms using the largest alternate processing time (LAPT) rule are presented. Finally, two approximation algorithms are presented if the weight is equal to one. Additionally, another approximation algorithm is presented if the weight is larger than one.

Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups

NASA Astrophysics Data System (ADS)

Kim, Ji-Su; Park, Jung-Hyeon; Lee, Dong-Ho

2017-10-01

This study addresses a variant of job-shop scheduling in which jobs are grouped into job families, but they are processed individually. The problem can be found in various industrial systems, especially in reprocessing shops of remanufacturing systems. If the reprocessing shop is a job-shop type and has the component-matching requirements, it can be regarded as a job shop with job families since the components of a product constitute a job family. In particular, sequence-dependent set-ups in which set-up time depends on the job just completed and the next job to be processed are also considered. The objective is to minimize the total family flow time, i.e. the maximum among the completion times of the jobs within a job family. A mixed-integer programming model is developed and two iterated greedy algorithms with different local search methods are proposed. Computational experiments were conducted on modified benchmark instances and the results are reported.

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.

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.

Environment-Aware Production Schedulingfor Paint Shops in Automobile Manufacturing: A Multi-Objective Optimization Approach.

PubMed

Zhang, Rui

2017-12-25

The traditional way of scheduling production processes often focuses on profit-driven goals (such as cycle time or material cost) while tending to overlook the negative impacts of manufacturing activities on the environment in the form of carbon emissions and other undesirable by-products. To bridge the gap, this paper investigates an environment-aware production scheduling problem that arises from a typical paint shop in the automobile manufacturing industry. In the studied problem, an objective function is defined to minimize the emission of chemical pollutants caused by the cleaning of painting devices which must be performed each time before a color change occurs. Meanwhile, minimization of due date violations in the downstream assembly shop is also considered because the two shops are interrelated and connected by a limited-capacity buffer. First, we have developed a mixed-integer programming formulation to describe this bi-objective optimization problem. Then, to solve problems of practical size, we have proposed a novel multi-objective particle swarm optimization (MOPSO) algorithm characterized by problem-specific improvement strategies. A branch-and-bound algorithm is designed for accurately assessing the most promising solutions. Finally, extensive computational experiments have shown that the proposed MOPSO is able to match the solution quality of an exact solver on small instances and outperform two state-of-the-art multi-objective optimizers in literature on large instances with up to 200 cars.

Multi-objective flexible job shop scheduling problem using variable neighborhood evolutionary algorithm

NASA Astrophysics Data System (ADS)

Wang, Chun; Ji, Zhicheng; Wang, Yan

2017-07-01

In this paper, multi-objective flexible job shop scheduling problem (MOFJSP) was studied with the objects to minimize makespan, total workload and critical workload. A variable neighborhood evolutionary algorithm (VNEA) was proposed to obtain a set of Pareto optimal solutions. First, two novel crowded operators in terms of the decision space and object space were proposed, and they were respectively used in mating selection and environmental selection. Then, two well-designed neighborhood structures were used in local search, which consider the problem characteristics and can hold fast convergence. Finally, extensive comparison was carried out with the state-of-the-art methods specially presented for solving MOFJSP on well-known benchmark instances. The results show that the proposed VNEA is more effective than other algorithms in solving MOFJSP.

Outsourcing and scheduling for a two-machine flow shop with release times

NASA Astrophysics Data System (ADS)

Ahmadizar, Fardin; Amiri, Zeinab

2018-03-01

This article addresses a two-machine flow shop scheduling problem where jobs are released intermittently and outsourcing is allowed. The first operations of outsourced jobs are processed by the first subcontractor, they are transported in batches to the second subcontractor for processing their second operations, and finally they are transported back to the manufacturer. The objective is to select a subset of jobs to be outsourced, to schedule both the in-house and the outsourced jobs, and to determine a transportation plan for the outsourced jobs so as to minimize the sum of the makespan and the outsourcing and transportation costs. Two mathematical models of the problem and several necessary optimality conditions are presented. A solution approach is then proposed by incorporating the dominance properties with an ant colony algorithm. Finally, computational experiments are conducted to evaluate the performance of the models and solution approach.

Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes

NASA Astrophysics Data System (ADS)

Cheng, Bayi; Yang, Shanlin; Hu, Xiaoxuan; Li, Kai

2014-03-01

This article considers the problem of scheduling two batch-processing machines in flow shop where the jobs have arbitrary sizes and the machines have limited capacity. The jobs are processed in batches and the total size of jobs in each batch cannot exceed the machine capacity. Once a batch is being processed, no interruption is allowed until all the jobs in it are completed. The problem of minimising makespan is NP-hard in the strong sense. First, we present a mathematical model of the problem using integer programme. We show the scale of feasible solutions of the problem and provide optimality properties. Then, we propose a polynomial time algorithm with running time in O(nlogn). The jobs are first assigned in feasible batches and then scheduled on machines. For the general case, we prove that the proposed algorithm has a performance guarantee of 4. For the special case where the processing times of each job on the two machines satisfy p 1 j = ap 2 j , the performance guarantee is ? for a > 0.

A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking

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.

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.

5 CFR 532.265 - Special wage schedules for apprentices and shop trainees.

Code of Federal Regulations, 2012 CFR

2012-01-01

... and shop trainees. 532.265 Section 532.265 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT... schedules for apprentices and shop trainees. (a) Agencies may establish special wage schedules for apprentices and shop trainees who are included in: (1) Formal apprenticeship programs involving training for...

5 CFR 532.265 - Special wage schedules for apprentices and shop trainees.

Code of Federal Regulations, 2013 CFR

2013-01-01

... and shop trainees. 532.265 Section 532.265 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT... schedules for apprentices and shop trainees. (a) Agencies may establish special wage schedules for apprentices and shop trainees who are included in: (1) Formal apprenticeship programs involving training for...

5 CFR 532.265 - Special wage schedules for apprentices and shop trainees.

Code of Federal Regulations, 2014 CFR

2014-01-01

... and shop trainees. 532.265 Section 532.265 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT... schedules for apprentices and shop trainees. (a) Agencies may establish special wage schedules for apprentices and shop trainees who are included in: (1) Formal apprenticeship programs involving training for...

5 CFR 532.265 - Special wage schedules for apprentices and shop trainees.

Code of Federal Regulations, 2011 CFR

2011-01-01

... and shop trainees. 532.265 Section 532.265 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT... schedules for apprentices and shop trainees. (a) Agencies may establish special wage schedules for apprentices and shop trainees who are included in: (1) Formal apprenticeship programs involving training for...

5 CFR 532.265 - Special wage schedules for apprentices and shop trainees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... and shop trainees. 532.265 Section 532.265 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT... schedules for apprentices and shop trainees. (a) Agencies may establish special wage schedules for apprentices and shop trainees who are included in: (1) Formal apprenticeship programs involving training for...

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... CONTRACTS Contract Clauses 536.570-9 Shop drawings, coordination drawings, and schedules. Insert the clause at 552.236-78, Shop Drawings, Coordination Drawings, and Schedules, in solicitations and contracts if...

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... Provisions and Clauses 552.236-78 Shop Drawings, Coordination Drawings, and Schedules. As prescribed in 536.570-9, insert the following clause: Shop Drawings, Coordination Drawings, and Schedules (SEP 1999) 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... CONTRACTS Contract Clauses 536.570-9 Shop drawings, coordination drawings, and schedules. Insert the clause at 552.236-78, Shop Drawings, Coordination Drawings, and Schedules, in solicitations and contracts if...

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... CONTRACTS Contract Clauses 536.570-9 Shop drawings, coordination drawings, and schedules. Insert the clause at 552.236-78, Shop Drawings, Coordination Drawings, and Schedules, in solicitations and contracts if...

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... CONTRACTS Contract Clauses 536.570-9 Shop drawings, coordination drawings, and schedules. Insert the clause at 552.236-78, Shop Drawings, Coordination Drawings, and Schedules, in solicitations and contracts if...

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... Provisions and Clauses 552.236-78 Shop Drawings, Coordination Drawings, and Schedules. As prescribed in 536.570-9, insert the following clause: Shop Drawings, Coordination Drawings, and Schedules (SEP 1999) The...

48 CFR 536.570-9 - Shop drawings, coordination drawings, and schedules.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 48 Federal Acquisition Regulations System 4 2014-10-01 2014-10-01 false Shop drawings... CONTRACTS Contract Clauses 536.570-9 Shop drawings, coordination drawings, and schedules. Insert the clause at 552.236-78, Shop Drawings, Coordination Drawings, and Schedules, in solicitations and contracts if...

48 CFR 552.236-78 - 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... Provisions and Clauses 552.236-78 Shop Drawings, Coordination Drawings, and Schedules. As prescribed in 536.570-9, insert the following clause: Shop Drawings, Coordination Drawings, and Schedules (SEP 1999) 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... Provisions and Clauses 552.236-78 Shop Drawings, Coordination Drawings, and Schedules. As prescribed in 536.570-9, insert the following clause: Shop Drawings, Coordination Drawings, and Schedules (SEP 1999) The...

48 CFR 552.236-78 - Shop Drawings, Coordination Drawings, and Schedules.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 48 Federal Acquisition Regulations System 4 2014-10-01 2014-10-01 false Shop Drawings... Provisions and Clauses 552.236-78 Shop Drawings, Coordination Drawings, and Schedules. As prescribed in 536.570-9, insert the following clause: Shop Drawings, Coordination Drawings, and Schedules (SEP 1999) The...

Deconstructing Nowicki and Smutnickis i-TSAB tabu search algorithm for the job-shop scheduling problem.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitley, L. Darrell; Watson, Jean-Paul; Howe, Adele E.

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 ofmore » 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.« less

Flexible Job-Shop Scheduling with Dual-Resource Constraints to Minimize Tardiness Using Genetic Algorithm

NASA Astrophysics Data System (ADS)

Paksi, A. B. N.; Ma'ruf, A.

2016-02-01

In general, both machines and human resources are needed for processing a job on production floor. However, most classical scheduling problems have ignored the possible constraint caused by availability of workers and have considered only machines as a limited resource. In addition, along with production technology development, routing flexibility appears as a consequence of high product variety and medium demand for each product. Routing flexibility is caused by capability of machines that offers more than one machining process. This paper presents a method to address scheduling problem constrained by both machines and workers, considering routing flexibility. Scheduling in a Dual-Resource Constrained shop is categorized as NP-hard problem that needs long computational time. Meta-heuristic approach, based on Genetic Algorithm, is used due to its practical implementation in industry. Developed Genetic Algorithm uses indirect chromosome representative and procedure to transform chromosome into Gantt chart. Genetic operators, namely selection, elitism, crossover, and mutation are developed to search the best fitness value until steady state condition is achieved. A case study in a manufacturing SME is used to minimize tardiness as objective function. The algorithm has shown 25.6% reduction of tardiness, equal to 43.5 hours.

An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem

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 hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling.

PubMed

Li, Bin-Bin; Wang, Ling

2007-06-01

This paper proposes a hybrid quantum-inspired genetic algorithm (HQGA) for the multiobjective flow shop scheduling problem (FSSP), which is a typical NP-hard combinatorial optimization problem with strong engineering backgrounds. On the one hand, a quantum-inspired GA (QGA) based on Q-bit representation is applied for exploration in the discrete 0-1 hyperspace by using the updating operator of quantum gate and genetic operators of Q-bit. Moreover, random-key representation is used to convert the Q-bit representation to job permutation for evaluating the objective values of the schedule solution. On the other hand, permutation-based GA (PGA) is applied for both performing exploration in permutation-based scheduling space and stressing exploitation for good schedule solutions. To evaluate solutions in multiobjective sense, a randomly weighted linear-sum function is used in QGA, and a nondominated sorting technique including classification of Pareto fronts and fitness assignment is applied in PGA with regard to both proximity and diversity of solutions. To maintain the diversity of the population, two trimming techniques for population are proposed. The proposed HQGA is tested based on some multiobjective FSSPs. Simulation results and comparisons based on several performance metrics demonstrate the effectiveness of the proposed HQGA.

A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling.

PubMed

Deng, Qianwang; Gong, Guiliang; Gong, Xuran; Zhang, Like; Liu, Wei; Ren, Qinghua

2017-01-01

Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload of all machines. It adopts a two-stage optimization mechanism during the optimizing process. In the first stage, the NSGA-II algorithm with T iteration times is first used to obtain the initial population N , in which a bee evolutionary guiding scheme is presented to exploit the solution space extensively. In the second stage, the NSGA-II algorithm with GEN iteration times is used again to obtain the Pareto-optimal solutions. In order to enhance the searching ability and avoid the premature convergence, an updating mechanism is employed in this stage. More specifically, its population consists of three parts, and each of them changes with the iteration times. What is more, numerical simulations are carried out which are based on some published benchmark instances. Finally, the effectiveness of the proposed BEG-NSGA-II algorithm is shown by comparing the experimental results and the results of some well-known algorithms already existed.

A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling

PubMed Central

Deng, Qianwang; Gong, Xuran; Zhang, Like; Liu, Wei; Ren, Qinghua

2017-01-01

Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload of all machines. It adopts a two-stage optimization mechanism during the optimizing process. In the first stage, the NSGA-II algorithm with T iteration times is first used to obtain the initial population N, in which a bee evolutionary guiding scheme is presented to exploit the solution space extensively. In the second stage, the NSGA-II algorithm with GEN iteration times is used again to obtain the Pareto-optimal solutions. In order to enhance the searching ability and avoid the premature convergence, an updating mechanism is employed in this stage. More specifically, its population consists of three parts, and each of them changes with the iteration times. What is more, numerical simulations are carried out which are based on some published benchmark instances. Finally, the effectiveness of the proposed BEG-NSGA-II algorithm is shown by comparing the experimental results and the results of some well-known algorithms already existed. PMID:28458687

Job shop scheduling model for non-identic machine with fixed delivery time to minimize tardiness

NASA Astrophysics Data System (ADS)

Kusuma, K. K.; Maruf, A.

2016-02-01

Scheduling non-identic machines problem with low utilization characteristic and fixed delivery time are frequent in manufacture industry. This paper propose a mathematical model to minimize total tardiness for non-identic machines in job shop environment. This model will be categorized as an integer linier programming model and using branch and bound algorithm as the solver method. We will use fixed delivery time as main constraint and different processing time to process a job. The result of this proposed model shows that the utilization of production machines can be increase with minimal tardiness using fixed delivery time as constraint.

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.

Learning dominance relations in combinatorial search problems

NASA Technical Reports Server (NTRS)

Yu, Chee-Fen; Wah, Benjamin W.

1988-01-01

Dominance relations commonly are used to prune unnecessary nodes in search graphs, but they are problem-dependent and cannot be derived by a general procedure. The authors identify machine learning of dominance relations and the applicable learning mechanisms. A study of learning dominance relations using learning by experimentation is described. This system has been able to learn dominance relations for the 0/1-knapsack problem, an inventory problem, the reliability-by-replication problem, the two-machine flow shop problem, a number of single-machine scheduling problems, and a two-machine scheduling problem. It is considered that the same methodology can be extended to learn dominance relations in general.

Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times.

PubMed

Yang, Xin; Zeng, Zhenxiang; Wang, Ruidong; Sun, Xueshan

2016-01-01

This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The case study on GM Corporation verifies that the NSGA-II used in this paper is effective and has advantages to solve the proposed model comparing with HPSO and PSO+SA. The idea and method of the paper can be generalized widely in the manufacturing industry, because it can reduce the energy consumption of the energy-intensive manufacturing enterprise with less investment when the new approach is applied in existing systems.

Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times

PubMed Central

Zeng, Zhenxiang; Wang, Ruidong; Sun, Xueshan

2016-01-01

This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The case study on GM Corporation verifies that the NSGA-II used in this paper is effective and has advantages to solve the proposed model comparing with HPSO and PSO+SA. The idea and method of the paper can be generalized widely in the manufacturing industry, because it can reduce the energy consumption of the energy-intensive manufacturing enterprise with less investment when the new approach is applied in existing systems. PMID:27907163

An electromagnetism-like metaheuristic for open-shop problems with no buffer

NASA Astrophysics Data System (ADS)

Naderi, Bahman; Najafi, Esmaeil; Yazdani, Mehdi

2012-12-01

This paper considers open-shop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic based on an electromagnetism algorithm to solve the large-sized problems. The paper conducts two computational experiments. The first includes small-sized instances by which the mathematical model and general performance of the proposed metaheuristic are evaluated. The second evaluates the metaheuristic for its performance to solve some large-sized instances. The results show that the model and algorithm are effective to deal with the problem.

A hybrid job-shop scheduling system

NASA Technical Reports Server (NTRS)

Hellingrath, Bernd; Robbach, Peter; Bayat-Sarmadi, Fahid; Marx, Andreas

1992-01-01

The intention of the scheduling system developed at the Fraunhofer-Institute for Material Flow and Logistics is the support of a scheduler working in a job-shop. Due to the existing requirements for a job-shop scheduling system the usage of flexible knowledge representation and processing techniques is necessary. Within this system the attempt was made to combine the advantages of symbolic AI-techniques with those of neural networks.

Constraint monitoring in TOSCA

NASA Technical Reports Server (NTRS)

Beck, Howard

1992-01-01

The Job-Shop Scheduling Problem (JSSP) deals with the allocation of resources over time to factory operations. Allocations are subject to various constraints (e.g., production precedence relationships, factory capacity constraints, and limits on the allowable number of machine setups) which must be satisfied for a schedule to be valid. The identification of constraint violations and the monitoring of constraint threats plays a vital role in schedule generation in terms of the following: (1) directing the scheduling process; and (2) informing scheduling decisions. This paper describes a general mechanism for identifying constraint violations and monitoring threats to the satisfaction of constraints throughout schedule generation.

A new Nawaz-Enscore-Ham-based heuristic for permutation flow-shop problems with bicriteria of makespan and machine idle time

NASA Astrophysics Data System (ADS)

Liu, Weibo; Jin, Yan; Price, Mark

2016-10-01

A new heuristic based on the Nawaz-Enscore-Ham algorithm is proposed in this article for solving a permutation flow-shop scheduling problem. A new priority rule is proposed by accounting for the average, mean absolute deviation, skewness and kurtosis, in order to fully describe the distribution style of processing times. A new tie-breaking rule is also introduced for achieving effective job insertion with the objective of minimizing both makespan and machine idle time. Statistical tests illustrate better solution quality of the proposed algorithm compared to existing benchmark heuristics.

An extended continuous estimation of distribution algorithm for solving the permutation flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Shao, Zhongshi; Pi, Dechang; Shao, Weishi

2017-11-01

This article proposes an extended continuous estimation of distribution algorithm (ECEDA) to solve the permutation flow-shop scheduling problem (PFSP). In ECEDA, to make a continuous estimation of distribution algorithm (EDA) suitable for the PFSP, the largest order value rule is applied to convert continuous vectors to discrete job permutations. A probabilistic model based on a mixed Gaussian and Cauchy distribution is built to maintain the exploration ability of the EDA. Two effective local search methods, i.e. revolver-based variable neighbourhood search and Hénon chaotic-based local search, are designed and incorporated into the EDA to enhance the local exploitation. The parameters of the proposed ECEDA are calibrated by means of a design of experiments approach. Simulation results and comparisons based on some benchmark instances show the efficiency of the proposed algorithm for solving the PFSP.

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.

Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: a case study

NASA Astrophysics Data System (ADS)

Gao, Kaizhou; Wang, Ling; Luo, Jianping; Jiang, Hua; Sadollah, Ali; Pan, Quanke

2018-06-01

In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and tardiness (E/T). These two objectives are also considered together as a bi-objective problem. Computational optimization results and comparisons show that the proposed DHS is able to solve the scheduling and rescheduling problems effectively and productively. Using the proposed approach, satisfactory optimization results can be achieved for scheduling and rescheduling on a real-life shop floor.

A multipopulation PSO based memetic algorithm for permutation flow shop scheduling.

PubMed

Liu, Ruochen; Ma, Chenlin; Ma, Wenping; Li, Yangyang

2013-01-01

The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS) and individual improvement scheme (IIS). Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA) and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA), on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP.

Comparison of multiobjective evolutionary algorithms for operations scheduling under machine availability constraints.

PubMed

Frutos, M; Méndez, M; Tohmé, F; Broz, D

2013-01-01

Many of the problems that arise in production systems can be handled with multiobjective techniques. One of those problems is that of scheduling operations subject to constraints on the availability of machines and buffer capacity. In this paper we analyze different Evolutionary multiobjective Algorithms (MOEAs) for this kind of problems. We consider an experimental framework in which we schedule production operations for four real world Job-Shop contexts using three algorithms, NSGAII, SPEA2, and IBEA. Using two performance indexes, Hypervolume and R2, we found that SPEA2 and IBEA are the most efficient for the tasks at hand. On the other hand IBEA seems to be a better choice of tool since it yields more solutions in the approximate Pareto frontier.

A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes.

PubMed

Lee, I; Sikora, R; Shaw, M J

1997-01-01

Genetic algorithms (GAs) have been used widely for such combinatorial optimization problems as the traveling salesman problem (TSP), the quadratic assignment problem (QAP), and job shop scheduling. In all of these problems there is usually a well defined representation which GA's use to solve the problem. We present a novel approach for solving two related problems-lot sizing and sequencing-concurrently using GAs. The essence of our approach lies in the concept of using a unified representation for the information about both the lot sizes and the sequence and enabling GAs to evolve the chromosome by replacing primitive genes with good building blocks. In addition, a simulated annealing procedure is incorporated to further improve the performance. We evaluate the performance of applying the above approach to flexible flow line scheduling with variable lot sizes for an actual manufacturing facility, comparing it to such alternative approaches as pair wise exchange improvement, tabu search, and simulated annealing procedures. The results show the efficacy of this approach for flexible flow line scheduling.

Stochastic flow shop scheduling of overlapping jobs on tandem machines in application to optimizing the US Army's deliberate nuclear, biological, and chemical decontamination process, (final report). Master's thesis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Novikov, V.

1991-05-01

The U.S. Army's detailed equipment decontamination process is a stochastic flow shop which has N independent non-identical jobs (vehicles) which have overlapping processing times. This flow shop consists of up to six non-identical machines (stations). With the exception of one station, the processing times of the jobs are random variables. Based on an analysis of the processing times, the jobs for the 56 Army heavy division companies were scheduled according to the best shortest expected processing time - longest expected processing time (SEPT-LEPT) sequence. To assist in this scheduling the Gap Comparison Heuristic was developed to select the best SEPT-LEPTmore » schedule. This schedule was then used in balancing the detailed equipment decon line in order to find the best possible site configuration subject to several constraints. The detailed troop decon line, in which all jobs are independent and identically distributed, was then balanced. Lastly, an NBC decon optimization computer program was developed using the scheduling and line balancing results. This program serves as a prototype module for the ANBACIS automated NBC decision support system.... Decontamination, Stochastic flow shop, Scheduling, Stochastic scheduling, Minimization of the makespan, SEPT-LEPT Sequences, Flow shop line balancing, ANBACIS.« less

Processing time tolerance-based ACO algorithm for solving job-shop scheduling problem

NASA Astrophysics Data System (ADS)

Luo, Yabo; Waden, Yongo P.

2017-06-01

Ordinarily, Job Shop Scheduling Problem (JSSP) is known as NP-hard problem which has uncertainty and complexity that cannot be handled by a linear method. Thus, currently studies on JSSP are concentrated mainly on applying different methods of improving the heuristics for optimizing the JSSP. However, there still exist many problems for efficient optimization in the JSSP, namely, low efficiency and poor reliability, which can easily trap the optimization process of JSSP into local optima. Therefore, to solve this problem, a study on Ant Colony Optimization (ACO) algorithm combined with constraint handling tactics is carried out in this paper. Further, the problem is subdivided into three parts: (1) Analysis of processing time tolerance-based constraint features in the JSSP which is performed by the constraint satisfying model; (2) Satisfying the constraints by considering the consistency technology and the constraint spreading algorithm in order to improve the performance of ACO algorithm. Hence, the JSSP model based on the improved ACO algorithm is constructed; (3) The effectiveness of the proposed method based on reliability and efficiency is shown through comparative experiments which are performed on benchmark problems. Consequently, the results obtained by the proposed method are better, and the applied technique can be used in optimizing JSSP.

Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization.

PubMed

Huang, Song; Tian, Na; Wang, Yan; Ji, Zhicheng

2016-01-01

Taking resource allocation into account, flexible job shop problem (FJSP) is a class of complex scheduling problem in manufacturing system. In order to utilize the machine resources rationally, multi-objective particle swarm optimization (MOPSO) integrating with variable neighborhood search is introduced to address FJSP efficiently. Firstly, the assignment rules (AL) and dispatching rules (DR) are provided to initialize the population. And then special discrete operators are designed to produce new individuals and earliest completion machine (ECM) is adopted in the disturbance operator to escape the optima. Secondly, personal-best archives (cognitive memories) and global-best archive (social memory), which are updated by the predefined non-dominated archive update strategy, are simultaneously designed to preserve non-dominated individuals and select personal-best positions and the global-best position. Finally, three neighborhoods are provided to search the neighborhoods of global-best archive for enhancing local search ability. The proposed algorithm is evaluated by using Kacem instances and Brdata instances, and a comparison with other approaches shows the effectiveness of the proposed algorithm for FJSP.

Comparison of Multiobjective Evolutionary Algorithms for Operations Scheduling under Machine Availability Constraints

PubMed Central

Frutos, M.; Méndez, M.; Tohmé, F.; Broz, D.

2013-01-01

Many of the problems that arise in production systems can be handled with multiobjective techniques. One of those problems is that of scheduling operations subject to constraints on the availability of machines and buffer capacity. In this paper we analyze different Evolutionary multiobjective Algorithms (MOEAs) for this kind of problems. We consider an experimental framework in which we schedule production operations for four real world Job-Shop contexts using three algorithms, NSGAII, SPEA2, and IBEA. Using two performance indexes, Hypervolume and R2, we found that SPEA2 and IBEA are the most efficient for the tasks at hand. On the other hand IBEA seems to be a better choice of tool since it yields more solutions in the approximate Pareto frontier. PMID:24489502

A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling

PubMed Central

Liu, Ruochen; Ma, Chenlin; Ma, Wenping; Li, Yangyang

2013-01-01

The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS) and individual improvement scheme (IIS). Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA) and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA), on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP. PMID:24453841

A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.

PubMed

Hart, Emma; Sim, Kevin

2016-01-01

We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics composed of linear sequences of dispatching rules: each rule is represented using a tree structure and is itself evolved. Following a training period, the ensemble is shown to outperform both existing dispatching rules and a standard genetic programming algorithm on a large set of new test instances. In addition, it obtains superior results on a set of 210 benchmark problems from the literature when compared to two state-of-the-art hyper-heuristic approaches. Further analysis of the relationship between heuristics in the evolved ensemble and the instances each solves provides new insights into features that might describe similar instances.

Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Shao, Zhongshi; Pi, Dechang; Shao, Weishi

2018-05-01

This article presents an effective estimation of distribution algorithm, named P-EDA, to solve the blocking flow-shop scheduling problem (BFSP) with the makespan criterion. In the P-EDA, a Nawaz-Enscore-Ham (NEH)-based heuristic and the random method are combined to generate the initial population. Based on several superior individuals provided by a modified linear rank selection, a probabilistic model is constructed to describe the probabilistic distribution of the promising solution space. The path relinking technique is incorporated into EDA to avoid blindness of the search and improve the convergence property. A modified referenced local search is designed to enhance the local exploitation. Moreover, a diversity-maintaining scheme is introduced into EDA to avoid deterioration of the population. Finally, the parameters of the proposed P-EDA are calibrated using a design of experiments approach. Simulation results and comparisons with some well-performing algorithms demonstrate the effectiveness of the P-EDA for solving BFSP.

A Multiple Ant Colony Metahuristic for the Air Refueling Tanker Assignment Problem

DTIC Science & Technology

2002-03-01

Problem The tanker assignment problem can be modeled as a job shop scheduling problem ( JSSP ). The JSSP is made up of n jobs, composed of m ordered...points) to be processed on all the machines (tankers). The problem with using JSSP is that the tanker assignment problem has multiple objectives... JSSP will minimize the time it takes for all jobs, but this may take an inordinate number of tankers. Thus using JSSP alone is not necessarily a good

Advancing Air Force Scheduling through Modeling Problem Topologies

DTIC Science & Technology

2006-08-03

Merrill on August 23, 2005 and corresponded with Major David Van Veldhuizen in Fall 2005 about obtaining data. 3.4.3 Transitions Analytical Graphics and...observation satellite orbit. Technical Report CRT-2003-27, Centre de recherche sur les transports, July 2003. [5] Van -Dat Cung. ROADEF 2003: Results of the...collaborateurs/etd/default.htm. January, 2004. [15] P.J.M van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job shop scheduling by simulated annealing

A Comparison of the DISASTER (Trademark) Scheduling Software with a Simultaneous Scheduling Algorithm for Minimizing Maximum Tardiness in Job Shops

DTIC Science & Technology

1993-09-01

goal ( Heizer , Render , and Stair, 1993:94). Integer Prgronmming. Integer programming is a general purpose approach used to optimally solve job shop...Scheduling," Operations Research Journal. 29, No 4: 646-667 (July-August 1981). Heizer , Jay, Barry Render and Ralph M. Stair, Jr. Production and Operations

A random-key encoded harmony search approach for energy-efficient production scheduling with shared resources

NASA Astrophysics Data System (ADS)

Garcia-Santiago, C. A.; Del Ser, J.; Upton, C.; Quilligan, F.; Gil-Lopez, S.; Salcedo-Sanz, S.

2015-11-01

When seeking near-optimal solutions for complex scheduling problems, meta-heuristics demonstrate good performance with affordable computational effort. This has resulted in a gravitation towards these approaches when researching industrial use-cases such as energy-efficient production planning. However, much of the previous research makes assumptions about softer constraints that affect planning strategies and about how human planners interact with the algorithm in a live production environment. This article describes a job-shop problem that focuses on minimizing energy consumption across a production facility of shared resources. The application scenario is based on real facilities made available by the Irish Center for Manufacturing Research. The formulated problem is tackled via harmony search heuristics with random keys encoding. Simulation results are compared to a genetic algorithm, a simulated annealing approach and a first-come-first-served scheduling. The superior performance obtained by the proposed scheduler paves the way towards its practical implementation over industrial production chains.

A synergetic combination of small and large neighborhood schemes in developing an effective procedure for solving the job shop scheduling problem.

PubMed

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.

Automatic programming via iterated local search for dynamic job shop scheduling.

PubMed

Nguyen, Su; Zhang, Mengjie; Johnston, Mark; Tan, Kay Chen

2015-01-01

Dispatching rules have been commonly used in practice for making sequencing and scheduling decisions. Due to specific characteristics of each manufacturing system, there is no universal dispatching rule that can dominate in all situations. Therefore, it is important to design specialized dispatching rules to enhance the scheduling performance for each manufacturing environment. Evolutionary computation approaches such as tree-based genetic programming (TGP) and gene expression programming (GEP) have been proposed to facilitate the design task through automatic design of dispatching rules. However, these methods are still limited by their high computational cost and low exploitation ability. To overcome this problem, we develop a new approach to automatic programming via iterated local search (APRILS) for dynamic job shop scheduling. The key idea of APRILS is to perform multiple local searches started with programs modified from the best obtained programs so far. The experiments show that APRILS outperforms TGP and GEP in most simulation scenarios in terms of effectiveness and efficiency. The analysis also shows that programs generated by APRILS are more compact than those obtained by genetic programming. An investigation of the behavior of APRILS suggests that the good performance of APRILS comes from the balance between exploration and exploitation in its search mechanism.

Minimizing makespan in a two-stage flow shop with parallel batch-processing machines and re-entrant jobs

NASA Astrophysics Data System (ADS)

Huang, J. D.; Liu, J. J.; Chen, Q. X.; Mao, N.

2017-06-01

Against a background of heat-treatment operations in mould manufacturing, a two-stage flow-shop scheduling problem is described for minimizing makespan with parallel batch-processing machines and re-entrant jobs. The weights and release dates of jobs are non-identical, but job processing times are equal. A mixed-integer linear programming model is developed and tested with small-scale scenarios. Given that the problem is NP hard, three heuristic construction methods with polynomial complexity are proposed. The worst case of the new constructive heuristic is analysed in detail. A method for computing lower bounds is proposed to test heuristic performance. Heuristic efficiency is tested with sets of scenarios. Compared with the two improved heuristics, the performance of the new constructive heuristic is superior.

An Adaptive Niching Genetic Algorithm using a niche size equalization mechanism

NASA Astrophysics Data System (ADS)

Nagata, Yuichi

Niching GAs have been widely investigated to apply genetic algorithms (GAs) to multimodal function optimization problems. In this paper, we suggest a new niching GA that attempts to form niches, each consisting of an equal number of individuals. The proposed GA can be applied also to combinatorial optimization problems by defining a distance metric in the search space. We apply the proposed GA to the job-shop scheduling problem (JSP) and demonstrate that the proposed niching method enhances the ability to maintain niches and improve the performance of GAs.

Improving collection efficiency through remote monitoring of charity assets.

PubMed

McLeod, Fraser; Erdogan, Gunes; Cherrett, Tom; Bektas, Tolga; Davies, Nigel; Shingleton, Duncan; Speed, Chris; Dickinson, Janet; Norgate, Sarah

2014-02-01

Collection costs associated with servicing a major UK charity's donation banks and collecting unsold goods from their retail shops can account for up to 20% of the overall income gained. Bank and shop collections are commingled and are typically made on fixed days of the week irrespective of the amounts of materials waiting to be collected. Using collection records from a major UK charity, this paper considers what vehicle routing and scheduling benefits could accrue if bank and shop servicing requirements were monitored, the former using remote sensing technology to allow more proactive collection scheduling. A vehicle routing and scheduling algorithm employing tabu search methods was developed, and suggested time and distance savings of up to 30% over the current fixed schedules when a minimum bank and shop fill level of between 50% and 60% was used as a collection trigger. For the case study investigated, this led to a potential revenue gain of 5% for the charity and estimated CO2 savings of around 0.5 tonnes per week across the fleet of six heterogeneous vehicles. Copyright © 2013 Elsevier Ltd. All rights reserved.

Learning With Case-Injected Genetic Algorithms

DTIC Science & Technology

2004-08-01

JSSP ) offers an example of a problem that is suited to an 001 1 L[]1 order-based encoding where where the order of the allelles 010 1 1 matters. Order...8217 t. ýt2 * .tl problem. The next section uses the JSSP to propose and evaluate a solution similarity distance metric for order-based encodings. P1’ P2...P3 . Pn Fig. 7. Individual represents an allocation of platforms to targets. VII. JOB SHOP SCHEDULING ( JSSP ) The JSSP has been well studied elsewhere

Testing and Validation of Timing Properties for High Speed Digital Cameras - A Best Practices Guide

DTIC Science & Technology

2016-07-27

a five year plan to begin replacing its inventory of antiquated film and video systems with more modern and capable digital systems. As evidenced in...installation, testing, and documentation of DITCS. If shop support can be accelerated due to shifting mission priorities, this schedule can likely...assistance from the machine shop , welding shop , paint shop , and carpenter shop . Testing the DITCS system will require a KTM with digital cameras and

Benchmark Production Scheduling Problems for Job Shops with Interactive Constraints

DTIC Science & Technology

1993-09-01

Goldratt has stated that cost accounting is the number one enemy of productivity (Goldratt and Cox, 1992). Why does he believe this? Cost accounting ...28). This incorrect emphasis can lead managers to make improper decisions. For example, traditional analysis based on cost accounting may lead to...measures (Goldratt and Fox, 1986:28). Global Operational Measures As opposed to measuring each individual process station against cost accounting

Teaching Geology on Weekends and at Shopping Centers.

ERIC Educational Resources Information Center

Mirsky, Arthur; East, James R.

1981-01-01

The success of an outreach education program held by Indiana University-Purdue University at Indianapolis is described. The college offers regular credit courses on Saturday and Sunday for people who could not take regularly scheduled courses. A Learn and Shop program held at shopping centers is also described. (JT)

A methodological proposal for the development of an HPC-based antenna array scheduler

NASA Astrophysics Data System (ADS)

Bonvallet, Roberto; Hoffstadt, Arturo; Herrera, Diego; López, Daniela; Gregorio, Rodrigo; Almuna, Manuel; Hiriart, Rafael; Solar, Mauricio

2010-07-01

As new astronomy projects choose interferometry to improve angular resolution and to minimize costs, preparing and optimizing schedules for an antenna array becomes an increasingly critical task. This problem shares similarities with the job-shop problem, which is known to be a NP-hard problem, making a complete approach infeasible. In the case of ALMA, 18000 projects per season are expected, and the best schedule must be found in the order of minutes. The problem imposes severe difficulties: the large domain of observation projects to be taken into account; a complex objective function, composed of several abstract, environmental, and hardware constraints; the number of restrictions imposed and the dynamic nature of the problem, as weather is an ever-changing variable. A solution can benefit from the use of High-Performance Computing for the final implementation to be deployed, but also for the development process. Our research group proposes the use of both metaheuristic search and statistical learning algorithms, in order to create schedules in a reasonable time. How these techniques will be applied is yet to be determined as part of the ongoing research. Several algorithms need to be implemented, tested and evaluated by the team. This work presents the methodology proposed to lead the development of the scheduler. The basic functionality is encapsulated into software components implemented on parallel architectures. These components expose a domain-level interface to the researchers, enabling then to develop early prototypes for evaluating and comparing their proposed techniques.

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.

Car painting process scheduling with harmony search algorithm

NASA Astrophysics Data System (ADS)

Syahputra, M. F.; Maiyasya, A.; Purnamawati, S.; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.

2018-02-01

Automotive painting program in the process of painting the car body by using robot power, making efficiency in the production system. Production system will be more efficient if pay attention to scheduling of car order which will be done by considering painting body shape of car. Flow shop scheduling is a scheduling model in which the job-job to be processed entirely flows in the same product direction / path. Scheduling problems often arise if there are n jobs to be processed on the machine, which must be specified which must be done first and how to allocate jobs on the machine to obtain a scheduled production process. Harmony Search Algorithm is a metaheuristic optimization algorithm based on music. The algorithm is inspired by observations that lead to music in search of perfect harmony. This musical harmony is in line to find optimal in the optimization process. Based on the tests that have been done, obtained the optimal car sequence with minimum makespan value.

A System for Planning Ahead

NASA Technical Reports Server (NTRS)

2002-01-01

A software system that uses artificial intelligence techniques to help with complex Space Shuttle scheduling at Kennedy Space Center is commercially available. Stottler Henke Associates, Inc.(SHAI), is marketing its automatic scheduling system, the Automated Manifest Planner (AMP), to industries that must plan and project changes many different times before the tasks are executed. The system creates optimal schedules while reducing manpower costs. Using information entered into the system by expert planners, the system automatically makes scheduling decisions based upon resource limitations and other constraints. It provides a constraint authoring system for adding other constraints to the scheduling process as needed. AMP is adaptable to assist with a variety of complex scheduling problems in manufacturing, transportation, business, architecture, and construction. AMP can benefit vehicle assembly plants, batch processing plants, semiconductor manufacturing, printing and textiles, surface and underground mining operations, and maintenance shops. For most of SHAI's commercial sales, the company obtains a service contract to customize AMP to a specific domain and then issues the customer a user license.

Applications of Evolutionary Technology to Manufacturing and Logistics Systems : State-of-the Art Survey

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin

Many combinatorial optimization problems from industrial engineering and operations research in real-world are very complex in nature and quite hard to solve them by conventional techniques. Since the 1960s, there has been an increasing interest in imitating living beings to solve such kinds of hard combinatorial optimization problems. Simulating the natural evolutionary process of human beings results in stochastic optimization techniques called evolutionary algorithms (EAs), which can often outperform conventional optimization methods when applied to difficult real-world problems. In this survey paper, we provide a comprehensive survey of the current state-of-the-art in the use of EA in manufacturing and logistics systems. In order to demonstrate the EAs which are powerful and broadly applicable stochastic search and optimization techniques, we deal with the following engineering design problems: transportation planning models, layout design models and two-stage logistics models in logistics systems; job-shop scheduling, resource constrained project scheduling in manufacturing system.

Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems

DTIC Science & Technology

1992-09-01

DARPA N00014-89-J-1988 11. SUPPLEMENTARY NOTES Ŗa. oIs7RIBU ric.c / AVAILAaILITY STATEMENT, 1.2. 3ISTRIBUT;CN C:. E In this thesis , we give efficient...University Thesis Supervisor Accepted by Campbell L. Searle Chairman, Departmental Committee on Graduate Students Approximation Algorithms for Multicommodity...partial fulfillment of the requirements for the degree of Doctor of Philosophy Abstract In this thesis , we give efficient approximation algorithms for

Scheduling job shop - A case study

NASA Astrophysics Data System (ADS)

Abas, M.; Abbas, A.; Khan, W. A.

2016-08-01

The scheduling in job shop is important for efficient utilization of machines in the manufacturing industry. There are number of algorithms available for scheduling of jobs which depend on machines tools, indirect consumables and jobs which are to be processed. In this paper a case study is presented for scheduling of jobs when parts are treated on available machines. Through time and motion study setup time and operation time are measured as total processing time for variety of products having different manufacturing processes. Based on due dates different level of priority are assigned to the jobs and the jobs are scheduled on the basis of priority. In view of the measured processing time, the times for processing of some new jobs are estimated and for efficient utilization of the machines available an algorithm is proposed and validated.

An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics

NASA Technical Reports Server (NTRS)

Baluja, Shumeet

1995-01-01

This report is a repository of the results obtained from a large scale empirical comparison of seven iterative and evolution-based optimization heuristics. Twenty-seven static optimization problems, spanning six sets of problem classes which are commonly explored in genetic algorithm literature, are examined. The problem sets include job-shop scheduling, traveling salesman, knapsack, binpacking, neural network weight optimization, and standard numerical optimization. The search spaces in these problems range from 2368 to 22040. The results indicate that using genetic algorithms for the optimization of static functions does not yield a benefit, in terms of the final answer obtained, over simpler optimization heuristics. Descriptions of the algorithms tested and the encodings of the problems are described in detail for reproducibility.

Two-MILP models for scheduling elective surgeries within a private healthcare facility.

PubMed

Khlif Hachicha, Hejer; Zeghal Mansour, Farah

2016-11-05

This paper deals with an Integrated Elective Surgery-Scheduling Problem (IESSP) that arises in a privately operated healthcare facility. It aims to optimize the resource utilization of the entire surgery process including pre-operative, per-operative and post-operative activities. Moreover, it addresses a specific feature of private facilities where surgeons are independent service providers and may conduct their surgeries in different private healthcare facilities. Thus, the problem requires the assignment of surgery patients to hospital beds, operating rooms and recovery beds as well as their sequencing over a 1-day period while taking into account surgeons' availability constraints. We present two Mixed Integer Linear Programs (MILP) that model the IESSP as a three-stage hybrid flow-shop scheduling problem with recirculation, resource synchronization, dedicated machines, and blocking constraints. To assess the empirical performance of the proposed models, we conducted experiments on real-world data of a Tunisian private clinic: Clinique Ennasr and on randomly generated instances. Two criteria were minimised: the patients' average length of stay and the number of patients' overnight stays. The computational results show that the proposed models can solve instances with up to 44 surgical cases in a reasonable CPU time using a general-purpose MILP solver.

Shopping Problems among High School Students

PubMed Central

Grant, Jon E.; Potenza, Marc N.; Krishnan-Sarin, Suchitra; Cavallo, Dana A.; Desai, Rani A.

2010-01-01

Background Although shopping behavior among adolescents is normal, for some the shopping becomes problematic. An assessment of adolescent shopping behavior along a continuum of severity and its relationship to other behaviors and health issues is incompletely understood. Methods A large sample of high school students (n=3999) was examined using a self-report survey with 153 questions concerning demographic characteristics, shopping behaviors, other health behaviors including substance use, and functioning variables such as grades and violent behavior. Results The overall prevalence of problem shopping was 3.5% (95%CI: 2.93–4.07). Regular smoking, marijuana and other drug use, sadness and hopelessness, and antisocial behaviors (e.g., fighting, carrying weapons) were associated with problem shopping behavior in both boys and girls. Heavy alcohol use was significantly associated with problem shopping only in girls. Conclusion Problem shopping appears fairly common among high school students and is associated with symptoms of depression and a range of potentially addictive and antisocial behaviors. Significant distress and diminished behavioral control suggest that excessive shopping may often have significant associated morbidity. Additional research is needed to develop specific prevention and treatment strategies for adolescents who report problems with shopping. PMID:21497217

Shopping problems among high school students.

PubMed

Grant, Jon E; Potenza, Marc N; Krishnan-Sarin, Suchitra; Cavallo, Dana A; Desai, Rani A

2011-01-01

Although shopping behavior among adolescents is normal, for some, the shopping becomes problematic. An assessment of adolescent shopping behavior along a continuum of severity and its relationship to other behaviors and health issues is incompletely understood. A large sample of high school students (n = 3999) was examined using a self-report survey with 153 questions concerning demographic characteristics, shopping behaviors, other health behaviors including substance use, and functioning variables such as grades and violent behavior. The overall prevalence of problem shopping was 3.5% (95% CI, 2.93-4.07). Regular smoking, marijuana and other drug use, sadness and hopelessness, and antisocial behaviors (e.g., fighting, carrying weapons) were associated with problem shopping behavior in both boys and girls. Heavy alcohol use was significantly associated with problem shopping only in girls. Problem shopping appears fairly common among high school students and is associated with symptoms of depression and a range of potentially addictive and antisocial behaviors. Significant distress and diminished behavioral control suggest that excessive shopping may often have significant associated morbidity. Additional research is needed to develop specific prevention and treatment strategies for adolescents who report problems with shopping. Copyright © 2011 Elsevier Inc. All rights reserved.

Evaluation and Selection of Best Priority Sequencing Rule in Job Shop Scheduling using Hybrid MCDM Technique

NASA Astrophysics Data System (ADS)

Kiran Kumar, Kalla; Nagaraju, Dega; Gayathri, S.; Narayanan, S.

2017-05-01

Priority Sequencing Rules provide the guidance for the order in which the jobs are to be processed at a workstation. The application of different priority rules in job shop scheduling gives different order of scheduling. More experimentation needs to be conducted before a final choice is made to know the best priority sequencing rule. Hence, a comprehensive method of selecting the right choice is essential in managerial decision making perspective. This paper considers seven different priority sequencing rules in job shop scheduling. For evaluation and selection of the best priority sequencing rule, a set of eight criteria are considered. The aim of this work is to demonstrate the methodology of evaluating and selecting the best priority sequencing rule by using hybrid multi criteria decision making technique (MCDM), i.e., analytical hierarchy process (AHP) with technique for order preference by similarity to ideal solution (TOPSIS). The criteria weights are calculated by using AHP whereas the relative closeness values of all priority sequencing rules are computed based on TOPSIS with the help of data acquired from the shop floor of a manufacturing firm. Finally, from the findings of this work, the priority sequencing rules are ranked from most important to least important. The comprehensive methodology presented in this paper is very much essential for the management of a workstation to choose the best priority sequencing rule among the available alternatives for processing the jobs with maximum benefit.

Doctor shopping: a concept analysis.

PubMed

Worley, Julie; Hall, Joanne M

2012-01-01

Prescription drug abuse is a significant problem in the United States that poses a serious health risk to Americans and is therefore significant to the field of nursing. The prescription drugs that are designated in the United States as having abuse potential are called controlled or scheduled drugs. The most common types of abused prescription drugs are benzodiazepines prescribed for anxiety, opioids prescribed for pain, and stimulants prescribed for attention deficit disorder. These prescription drugs are abused by taking larger doses than prescribed for nonmedical use to achieve a high or euphoric feeling, or are sold illicitly for profit. In 2009, there were 2.4 million nonmedical users of prescription opioids in the United States. These prescription drugs are often obtained by seeing multiple prescribers, often under false pretenses or with complicity from the prescribers that leads to abuse and illicit sales. The term doctor shopping has been used not only to refer to this phenomenon but has also had other meanings throughout the past decades. Thus, concept analysis is the focus of this article for clarification using the Walker and Avant method. Health implications and suggestions for minimizing doctor shopping are included.

An expert system for planning and scheduling in a telerobotic environment

NASA Technical Reports Server (NTRS)

Ntuen, Celestine A.; Park, Eui H.

1991-01-01

A knowledge based approach to assigning tasks to multi-agents working cooperatively in jobs that require a telerobot in the loop was developed. The generality of the approach allows for such a concept to be applied in a nonteleoperational domain. The planning architecture known as the task oriented planner (TOP) uses the principle of flow mechanism and the concept of planning by deliberation to preserve and use knowledge about a particular task. The TOP is an open ended architecture developed with a NEXPERT expert system shell and its knowledge organization allows for indirect consultation at various levels of task abstraction. Considering that a telerobot operates in a hostile and nonstructured environment, task scheduling should respond to environmental changes. A general heuristic was developed for scheduling jobs with the TOP system. The technique is not to optimize a given scheduling criterion as in classical job and/or flow shop problems. For a teleoperation job schedule, criteria are situation dependent. A criterion selection is fuzzily embedded in the task-skill matrix computation. However, goal achievement with minimum expected risk to the human operator is emphasized.

Genetic programming for evolving due-date assignment models in job shop environments.

PubMed

Nguyen, Su; Zhang, Mengjie; Johnston, Mark; Tan, Kay Chen

2014-01-01

Due-date assignment plays an important role in scheduling systems and strongly influences the delivery performance of job shops. Because of the stochastic and dynamic nature of job shops, the development of general due-date assignment models (DDAMs) is complicated. In this study, two genetic programming (GP) methods are proposed to evolve DDAMs for job shop environments. The experimental results show that the evolved DDAMs can make more accurate estimates than other existing dynamic DDAMs with promising reusability. In addition, the evolved operation-based DDAMs show better performance than the evolved DDAMs employing aggregate information of jobs and machines.

Bidding-based autonomous process planning and scheduling

NASA Astrophysics Data System (ADS)

Gu, Peihua; Balasubramanian, Sivaram; Norrie, Douglas H.

1995-08-01

Improving productivity through computer integrated manufacturing systems (CIMS) and concurrent engineering requires that the islands of automation in an enterprise be completely integrated. The first step in this direction is to integrate design, process planning, and scheduling. This can be achieved through a bidding-based process planning approach. The product is represented in a STEP model with detailed design and administrative information including design specifications, batch size, and due dates. Upon arrival at the manufacturing facility, the product registered in the shop floor manager which is essentially a coordinating agent. The shop floor manager broadcasts the product's requirements to the machines. The shop contains autonomous machines that have knowledge about their functionality, capabilities, tooling, and schedule. Each machine has its own process planner and responds to the product's request in a different way that is consistent with its capabilities and capacities. When more than one machine offers certain process(es) for the same requirements, they enter into negotiation. Based on processing time, due date, and cost, one of the machines wins the contract. The successful machine updates its schedule and advises the product to request raw material for processing. The concept was implemented using a multi-agent system with the task decomposition and planning achieved through contract nets. The examples are included to illustrate the approach.

Industrial Processes to Reduce Generation of Hazardous Waste at DoD Facilities. Phase III Report. Appendix C. Workshop Manual Centralized Vehicle Wash Racks and Scheduled Maintenance Facilities, Fort Lewis, Washington.

DTIC Science & Technology

1985-12-01

Lobster Shop - 759-2165. 4013 Ruston Way. Known for excellent seafood. Nautical The Bay Co. - 752-6661. 3327 Ruston Way. Various entrees. CI Shenanigans ...se- RCRA permit is inappropriate." Ac- forms of financial responsibility for rious potential health problem in New cording to Rogers and Darrah, under...admini- strative, monitoring, and financial standards for them. EPA will use these independently enforceable standards to issue permits to owners

117. ARAI Shop and maintenance (ARA627) building roof and floor ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

117. ARA-I Shop and maintenance (ARA-627) building roof and floor plan. Includes room finish and equipment schedule. Norman Engineering Company 961-area/SF-627-A-1. Date: January 1959. Ineel index code no. 068-0627-00-613-102759. - Idaho National Engineering Laboratory, Army Reactors Experimental Area, Scoville, Butte County, ID

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.

Operating the production calculus: ordering a production system in the print industry.

PubMed

Button, Graham; Sharrock, Wes

2002-06-01

The topic of shop-floor work has been extensively examined within sociology. However, the organizational structures within which this work takes place have, in the most part, been taken as unexamined givens. Yet, their operation is also the shop-floor work of some people. This paper examines the way in which the stable organizational structures within which shop-floor work takes place are achieved. It is based upon a fieldwork investigation of a large commercial printer and focuses upon the collaborative work of those who are involved in scheduling the production of a job and their use of 'the production calculus' in planning the work of the site. The print industry is undergoing considerable technological change and scheduling technologies have been developed to automate this work. However, there has been little take up of these technologies and the paper also considers how the characteristics of operating the production calculus in practice may account for this.

An engine awaits processing in the new engine shop at KSC

NASA Technical Reports Server (NTRS)

1998-01-01

In the Space Shuttle Main Engine Processing Facility (SSMEPF), a new Block 2A engine sits on the workstand as technicians process it. The engine is scheduled to fly on the Space Shuttle Endeavour during the STS-88 mission in December 1998. The SSMEPF officially opened on July 6, replacing the Shuttle Main Engine Shop.

An Integer Batch Scheduling Model for a Single Machine with Simultaneous Learning and Deterioration Effects to Minimize Total Actual Flow Time

NASA Astrophysics Data System (ADS)

Yusriski, R.; Sukoyo; Samadhi, T. M. A. A.; Halim, A. H.

2016-02-01

In the manufacturing industry, several identical parts can be processed in batches, and setup time is needed between two consecutive batches. Since the processing times of batches are not always fixed during a scheduling period due to learning and deterioration effects, this research deals with batch scheduling problems with simultaneous learning and deterioration effects. The objective is to minimize total actual flow time, defined as a time interval between the arrival of all parts at the shop and their common due date. The decision variables are the number of batches, integer batch sizes, and the sequence of the resulting batches. This research proposes a heuristic algorithm based on the Lagrange Relaxation. The effectiveness of the proposed algorithm is determined by comparing the resulting solutions of the algorithm to the respective optimal solution obtained from the enumeration method. Numerical experience results show that the average of difference among the solutions is 0.05%.

TEAM (Technologies Enabling Agile Manufacturing) shop floor control requirements guide: Version 1.0

DOE Office of Scientific and Technical Information (OSTI.GOV)

NONE

1995-03-28

TEAM will create a shop floor control system (SFC) to link the pre-production planning to shop floor execution. SFC must meet the requirements of a multi-facility corporation, where control must be maintained between co-located facilities down to individual workstations within each facility. SFC must also meet the requirements of a small corporation, where there may only be one small facility. A hierarchical architecture is required to meet these diverse needs. The hierarchy contains the following levels: Enterprise, Factory, Cell, Station, and Equipment. SFC is focused on the top three levels. Each level of the hierarchy is divided into three basicmore » functions: Scheduler, Dispatcher, and Monitor. The requirements of each function depend on the hierarchical level in which it is to be used. For example, the scheduler at the Enterprise level must allocate production to individual factories and assign due-dates; the scheduler at the Cell level must provide detailed start and stop times of individual operations. Finally the system shall have the following features: distributed and open-architecture. Open architecture software is required in order that the appropriate technology be used at each level of the SFC hierarchy, and even at different instances within the same hierarchical level (for example, Factory A uses discrete-event simulation scheduling software, and Factory B uses an optimization-based scheduler). A distributed implementation is required to reduce the computational burden of the overall system, and allow for localized control. A distributed, open-architecture implementation will also require standards for communication between hierarchical levels.« less

Waste-minimization opportunity assessment: Naval Undersea Warfare Engineering Station, Keyport, Washington. Final report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Not Available

The report describes the application of EPA's waste minimization assessment procedures to a torpedo maintenance facility at the Naval Undersea Warfare Engineering Station, Keyport, WA. The assessment focused on the Mark 48 shop and the Mark 46 shop. These shops service the Mark 48 torpedo and the Mark 46 torpedo respectively. The five waste minimization options presented are volume reduction of contaminated clothing, automated cleaning of parts, automated fuel tank draining, modification of the deep sink draining schedule and recycling of mineral spirits.

An iPad™-based picture and video activity schedule increases community shopping skills of a young adult with autism spectrum disorder and intellectual disability.

PubMed

Burckley, Elizabeth; Tincani, Matt; Guld Fisher, Amanda

2015-04-01

To evaluate the iPad 2™ with Book Creator™ software to provide visual cues and video prompting to teach shopping skills in the community to a young adult with an autism spectrum disorder and intellectual disability. A multiple probe across settings design was used to assess effects of the intervention on the participant's independence with following a shopping list in a grocery store across three community locations. Visual cues and video prompting substantially increased the participant's shopping skills within two of the three community locations, skill increases maintained after the intervention was withdrawn, and shopping skills generalized to two untaught shopping items. Social validity surveys suggested that the participant's parent and staff favorably viewed the goals, procedures, and outcomes of intervention. The iPad 2™ with Book Creator™ software may be an effective way to teach independent shopping skills in the community; additional replications are needed.

An engine awaits processing in the new engine shop at KSC

NASA Technical Reports Server (NTRS)

1998-01-01

In the Space Shuttle Main Engine Processing Facility (SSMEPF), a new Block 2A engine sits on the transport cradle before being moved to the workstand. The engine is scheduled to fly on the Space Shuttle Endeavour during the STS-88 mission in December 1998. The SSMEPF officially opened on July 6, replacing the Shuttle Main Engine Shop.

Envisioning Competence: Learning, Problem Solving, and Children at Work in the Exploratory Bicycle Shop

ERIC Educational Resources Information Center

Hammond, Charles Florian

2010-01-01

This study examines the conceptual learning and cognitive development processes of schoolchildren engaged in problem solving activities in a non-school, workplace setting known as the exploratory bicycle shop. The exploratory bike shop is a commercial bicycle shop: a) that has been adapted for combined retail and educational purposes and b) where…

Opioid shopping behavior: how often, how soon, which drugs, and what payment method.

PubMed

Cepeda, M Soledad; Fife, Daniel; Chow, Wing; Mastrogiovanni, Gregory; Henderson, Scott C

2013-01-01

Doctor shopping (obtaining opioid prescriptions from multiple prescribers) is one example of opioid abuse and diversion. The authors assessed how soon shopping behavior was observed after opioid exposure, number of events per shopper, preferred opioids, and method of payment. This was a cohort study. Individuals with ≤1 dispensing for any opioid in 2008 were followed for 18 months. Shopping behavior was defined as ≤2 prescriptions by different prescribers with ≤1 day of overlap and filled at ≤3 pharmacies. Of 25,161,024 subjects, 0.30% exhibited shopping behavior. Opioid-experienced subjects were 13.7 times more likely to exhibit shopping behavior and had more shopping episodes than opioid-naive subjects. Time to first shopping event was 246.90 ± 163.61 days. Number of episodes was 2.74 ± 4.66. Most subjects with shopping behavior (55.27%) had 1 shopping episode, whereas 9.52% had ≤6 episodes; 88.99% had ≤4 prescribers. Subjects with shopping behavior filled schedule II opioids more often than subjects without shopping behavior (19.51% vs 10.89%) and more often paid in cash (44.85% vs 18.54%). Three of 1000 people exposed to opioids exhibit shopping behavior, on average, 8 months after exposure. Opioid shoppers seek strong opioids, avoid combination products, often pay cash, and obtain prescriptions from few prescribers. © 2012 The Author(s).

Proposed algorithm to improve job shop production scheduling using ant colony optimization method

NASA Astrophysics Data System (ADS)

Pakpahan, Eka KA; Kristina, Sonna; Setiawan, Ari

2017-12-01

This paper deals with the determination of job shop production schedule on an automatic environment. On this particular environment, machines and material handling system are integrated and controlled by a computer center where schedule were created and then used to dictate the movement of parts and the operations at each machine. This setting is usually designed to have an unmanned production process for a specified interval time. We consider here parts with various operations requirement. Each operation requires specific cutting tools. These parts are to be scheduled on machines each having identical capability, meaning that each machine is equipped with a similar set of cutting tools therefore is capable of processing any operation. The availability of a particular machine to process a particular operation is determined by the remaining life time of its cutting tools. We proposed an algorithm based on the ant colony optimization method and embedded them on matlab software to generate production schedule which minimize the total processing time of the parts (makespan). We test the algorithm on data provided by real industry and the process shows a very short computation time. This contributes a lot to the flexibility and timelines targeted on an automatic environment.

Decision support for clinical laboratory capacity planning.

PubMed

van Merode, G G; Hasman, A; Derks, J; Goldschmidt, H M; Schoenmaker, B; Oosten, M

1995-01-01

The design of a decision support system for capacity planning in clinical laboratories is discussed. The DSS supports decisions concerning the following questions: how should the laboratory be divided into job shops (departments/sections), how should staff be assigned to workstations and how should samples be assigned to workstations for testing. The decision support system contains modules for supporting decisions at the overall laboratory level (concerning the division of the laboratory into job shops) and for supporting decisions at the job shop level (assignment of staff to workstations and sample scheduling). Experiments with these modules are described showing both the functionality and the validity.

An effective PSO-based memetic algorithm for flow shop scheduling.

PubMed

Liu, Bo; Wang, Ling; Jin, Yi-Hui

2007-02-01

This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem. In the proposed PSO-based MA (PSOMA), both PSO-based searching operators and some special local searching operators are designed to balance the exploration and exploitation abilities. In particular, the PSOMA applies the evolutionary searching mechanism of PSO, which is characterized by individual improvement, population cooperation, and competition to effectively perform exploration. On the other hand, the PSOMA utilizes several adaptive local searches to perform exploitation. First, to make PSO suitable for solving PFSSP, a ranked-order value rule based on random key representation is presented to convert the continuous position values of particles to job permutations. Second, to generate an initial swarm with certain quality and diversity, the famous Nawaz-Enscore-Ham (NEH) heuristic is incorporated into the initialization of population. Third, to balance the exploration and exploitation abilities, after the standard PSO-based searching operation, a new local search technique named NEH_1 insertion is probabilistically applied to some good particles selected by using a roulette wheel mechanism with a specified probability. Fourth, to enrich the searching behaviors and to avoid premature convergence, a simulated annealing (SA)-based local search with multiple different neighborhoods is designed and incorporated into the PSOMA. Meanwhile, an effective adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood to be used in SA-based local search. Finally, to further enhance the exploitation ability, a pairwise-based local search is applied after the SA-based search. Simulation results based on benchmarks demonstrate the effectiveness of the PSOMA. Additionally, the effects of some parameters on optimization performances are also discussed.

An engine awaits processing in the new engine shop at KSC

NASA Technical Reports Server (NTRS)

1998-01-01

A new Block 2A engine awaits processing in the low bay of the Space Shuttle Main Engine Processing Facility (SSMEPF). Officially opened on July 6, the new facility replaces the Shuttle Main Engine Shop. The SSMEPF is an addition to the existing Orbiter Processing Facility Bay 3. The engine is scheduled to fly on the Space Shuttle Endeavour during the STS-88 mission in December 1998.

Some Results of Weak Anticipative Concept Applied in Simulation Based Decision Support in Enterprise

NASA Astrophysics Data System (ADS)

Kljajić, Miroljub; Kofjač, Davorin; Kljajić Borštnar, Mirjana; Škraba, Andrej

2010-11-01

The simulation models are used as for decision support and learning in enterprises and in schools. Tree cases of successful applications demonstrate usefulness of weak anticipative information. Job shop scheduling production with makespan criterion presents a real case customized flexible furniture production optimization. The genetic algorithm for job shop scheduling optimization is presented. Simulation based inventory control for products with stochastic lead time and demand describes inventory optimization for products with stochastic lead time and demand. Dynamic programming and fuzzy control algorithms reduce the total cost without producing stock-outs in most cases. Values of decision making information based on simulation were discussed too. All two cases will be discussed from optimization, modeling and learning point of view.

Optimizing integrated airport surface and terminal airspace operations under uncertainty

NASA Astrophysics Data System (ADS)

Bosson, Christabelle S.

In airports and surrounding terminal airspaces, the integration of surface, arrival and departure scheduling and routing have the potential to improve the operations efficiency. Moreover, because both the airport surface and the terminal airspace are often altered by random perturbations, the consideration of uncertainty in flight schedules is crucial to improve the design of robust flight schedules. Previous research mainly focused on independently solving arrival scheduling problems, departure scheduling problems and surface management scheduling problems and most of the developed models are deterministic. This dissertation presents an alternate method to model the integrated operations by using a machine job-shop scheduling formulation. A multistage stochastic programming approach is chosen to formulate the problem in the presence of uncertainty and candidate solutions are obtained by solving sample average approximation problems with finite sample size. The developed mixed-integer-linear-programming algorithm-based scheduler is capable of computing optimal aircraft schedules and routings that reflect the integration of air and ground operations. The assembled methodology is applied to a Los Angeles case study. To show the benefits of integrated operations over First-Come-First-Served, a preliminary proof-of-concept is conducted for a set of fourteen aircraft evolving under deterministic conditions in a model of the Los Angeles International Airport surface and surrounding terminal areas. Using historical data, a representative 30-minute traffic schedule and aircraft mix scenario is constructed. The results of the Los Angeles application show that the integration of air and ground operations and the use of a time-based separation strategy enable both significant surface and air time savings. The solution computed by the optimization provides a more efficient routing and scheduling than the First-Come-First-Served solution. Additionally, a data driven analysis is performed for the Los Angeles environment and probabilistic distributions of pertinent uncertainty sources are obtained. A sensitivity analysis is then carried out to assess the methodology performance and find optimal sampling parameters. Finally, simulations of increasing traffic density in the presence of uncertainty are conducted first for integrated arrivals and departures, then for integrated surface and air operations. To compare the optimization results and show the benefits of integrated operations, two aircraft separation methods are implemented that offer different routing options. The simulations of integrated air operations and the simulations of integrated air and surface operations demonstrate that significant traveling time savings, both total and individual surface and air times, can be obtained when more direct routes are allowed to be traveled even in the presence of uncertainty. The resulting routings induce however extra take off delay for departing flights. As a consequence, some flights cannot meet their initial assigned runway slot which engenders runway position shifting when comparing resulting runway sequences computed under both deterministic and stochastic conditions. The optimization is able to compute an optimal runway schedule that represents an optimal balance between total schedule delays and total travel times.

Construction schedules slack time minimizing

NASA Astrophysics Data System (ADS)

Krzemiński, Michał

2017-07-01

The article presents two copyright models for minimizing downtime working brigades. Models have been developed for construction schedules performed using the method of work uniform. Application of flow shop models is possible and useful for the implementation of large objects, which can be divided into plots. The article also presents a condition describing gives which model should be used, as well as a brief example of optimization schedule. The optimization results confirm the legitimacy of the work on the newly-developed models.

Mathematical Sciences Division 1992 Programs

DTIC Science & Technology

1992-10-01

statistical theory that underlies modern signal analysis . There is a strong emphasis on stochastic processes and time series , particularly those which...include optimal resource planning and real- time scheduling of stochastic shop-floor processes. Scheduling systems will be developed that can adapt to...make forecasts for the length-of-service time series . Protocol analysis of these sessions will be used to idenify relevant contextual features and to

Shopping Parents: Patient Problem or Professional Problem?

ERIC Educational Resources Information Center

Keirn, William C.

1971-01-01

A survey of parents of retarded children showed less than 3 per cent of the parents were shopping parents, defined as those who pursue a third professional evaluation after receiving at least two others on previous occasions. (KW)

Fuzzy branching temporal logic.

PubMed

Moon, Seong-ick; Lee, Kwang H; Lee, Doheon

2004-04-01

Intelligent systems require a systematic way to represent and handle temporal information containing uncertainty. In particular, a logical framework is needed that can represent uncertain temporal information and its relationships with logical formulae. Fuzzy linear temporal logic (FLTL), a generalization of propositional linear temporal logic (PLTL) with fuzzy temporal events and fuzzy temporal states defined on a linear time model, was previously proposed for this purpose. However, many systems are best represented by branching time models in which each state can have more than one possible future path. In this paper, fuzzy branching temporal logic (FBTL) is proposed to address this problem. FBTL adopts and generalizes concurrent tree logic (CTL*), which is a classical branching temporal logic. The temporal model of FBTL is capable of representing fuzzy temporal events and fuzzy temporal states, and the order relation among them is represented as a directed graph. The utility of FBTL is demonstrated using a fuzzy job shop scheduling problem as an example.

On metaheuristic "failure modes": a case study in Tabu search for job-shop scheduling.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Watson, Jean-Paul

2005-06-01

In this paper, we analyze the relationship between pool maintenance schemes, long-term memory mechanisms, and search space structure, with the goal of placing metaheuristic design on a more concrete foundation.

Plant Operation: Exterior Maintenance, Work Hours

ERIC Educational Resources Information Center

Nation's Schools and Colleges, 1975

1975-01-01

A pitched roof built over a flat roof prevented leaking at a Vermont school. The University of New Hampshire paint shop has a flexible scheduling system that allows employees to choose their work hours each day. (Author/MLF)

Long-term results of two consecutive trials in childhood acute lymphoblastic leukaemia performed by the Spanish Cooperative Group for Childhood Acute Lymphoblastic Leukemia Group (SHOP) from 1989 to 1998.

PubMed

Badell, Isabel; Muñoz, Arturo; Estella, Jesús; Fernández-Delgado, Rafael; Javier, Germán; Verdeguer, Amparo; Cubells, Josep

2008-02-01

The first multi-centric protocol for childhood acute lymphoblastic leukaemia (ALL) treatment in Spain started in 1989 and was conducted by the Spanish Pediatric Hematology and Oncology Societies. A total of 673 patients were included in two consecutive trials, SHOP-89 (1989-1993) and SHOP- 94 (1994-1998). Approximately 67% of the children diagnosed with ALL in Spain during this period were enrolled in these trials. The 250 eligible patients enrolled in the SHOP- 89 study were stratified to either a standard or a high-risk group. Therapy schedule was based on the central nervous system (CNS) therapy designed by St Jude CRH and the Children's Cancer Group, and the post-induction intensification developed by the BFM group. In the SHOP-94 study, a further high-risk group was included in the stratification of the 423 enrolled patients. The therapeutic protocol was characterised by intensification of systemic chemotherapy and the administration of cranial radiotherapy only to patients at high risk of relapse or with CNS involvement at diagnosis. Event-free survival (EFS) increased from 0.57+/- 0.03 at 15 years in SHOP-89, to 0.68+/-0.03 at 11 years in SHOP-94 (p=0.01). Relapse rate decreased from SHOP-89 to SHOP-94: 0.38 vs. 0.25 (p=0.01). CNS relapse rate was 9.1% in SHOP-89 and 4.6% in SHOP-94 (p=0.001). EFS in patients with T-immunophenotype was 0.40+/-0.08 in SHOP-89 and 0.44+/-0.06 in SHOP-94 (p=ns). Our therapeutic results evidence a significant improvement in EFS and systemic and CNS relapse rates among the two consecutive trials after modification of patient stratification and intensification of systemic chemotherapy.

Optimizing human activity patterns using global sensitivity analysis.

PubMed

Fairchild, Geoffrey; Hickmann, Kyle S; Mniszewski, Susan M; Del Valle, Sara Y; Hyman, James M

2014-12-01

Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule's regularity for a population. We show how to tune an activity's regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. We use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.

The Science Shop for Physics: an interface between practical problems in society and physical knowledge

NASA Astrophysics Data System (ADS)

van den Berg, G. P.

1998-03-01

Since some 20 years most Dutch universities have one or more science shops. Central shops handle research questions for all disciplines. Specialized shops are part of a department of chemistry or medicine, history, social science, etc. The shops have evolved rather differently, but their main mission still is to help social groups that lack money and have no easy access to scientific knowledge, e.g. neighbourhood, environmental, third world or patient groups. Most also help non-commercial organizations such as schools, trade unions or local authorities. Low-cost help can be provided because students do the work as part of their training, mainly in student projects (literature search, practical work, graduation, etc.). A total staff of 80, helped by 600 students, 250 voluntary and 50 paid researchers, handle 1500 questions resulting in 300 reports (estimated figures 1995). Science shops for physics (`Physics Shop', PS) have to deal with practical problems, generally involving classical physics. Major topics are noise, vibration, radiation, indoor climate and energy: most of the work lies in estimating/measuring relevant parameters, assessing impact, seeking solutions. The 3 Dutch PS's have developed in different directions. One is run entirely by students and deals with small, concrete problems. The second PS is managed by a co-ordinator who mediates between client groups and physics staff members who assist students in small and larger projects. The third has a lot of in-house expertise, and the shop staff is in direct contact with client groups as well as students who work in the PS itself. In questions submitted to the PS it is not always immediately clear what to do or how to do it because of the non-scientific phrasing of the problems and problems include non-physical (e.g. technical, health or legal) aspects. Also, difficulties in solving the problems are typically not in the underlying physics, but in the lack of accurate data and of control of the complex environment. However, these very aspects are important from an educational point of view. Through these problems students (and physicists) may gain more insight into how lay people percieve and make use of science, and into the position of science in relation to other ways in which people try to understand their world.

Solid Waste Reduction--A Hands-on Study.

ERIC Educational Resources Information Center

Wiessinger, Diane

1991-01-01

This lesson plan uses grocery shopping to demonstrate the importance of source reduction in the handling of solid waste problems. Students consider different priorities in shopping (convenience, packaging, and waste reduction) and draw conclusions about the relationship between packaging techniques and solid waste problems. (MCO)

Putting it All Together: Has One-Stop Shopping Arrived?

ERIC Educational Resources Information Center

Flanagan, Patrick

1997-01-01

Reviews the current state of "one-stop shopping" for telecom services. Discusses regulatory obstacles; administrative problems with single billing; and resistance of telecom providers to change. Concludes that the leading one-stop shopping providers will be individual carriers who offer cost savings. (AEF)

Mothers and meals. The effects of mothers' meal planning and shopping motivations on children's participation in family meals.

PubMed

McIntosh, William Alex; Kubena, Karen S; Tolle, Glen; Dean, Wesley R; Jan, Jie-sheng; Anding, Jenna

2010-12-01

Participation in family meals has been associated with benefits for health and social development of children. The objective of the study was to identify the impact of mothers' work of caring through planning regularly scheduled meals, shopping and cooking, on children's participation in family meals. Parents of children aged 9-11 or 13-15 years from 300 Houston families were surveyed about parents' work, meal planning for and scheduling of meals, motivations for food purchases, importance of family meals, and children's frequency of eating dinner with their families. The children were interviewed about the importance of eating family meals. Hypotheses were tested using path analysis to calculate indirect and total effects of variables on the outcome variable of frequency of children eating dinner with their family. Mothers' belief in the importance of family meals increased likelihood of children eating dinner with families by increasing likelihood that mothers planned dinner and that dinners were regularly scheduled. Mothers' perception of time pressures on meal preparation had a negative, indirect effect on the frequency of children's participation in family dinners by reducing mothers' meal planning. Copyright © 2010 Elsevier Ltd. All rights reserved.

A new technology for manufacturing scheduling derived from space system operations

NASA Technical Reports Server (NTRS)

Hornstein, R. S.; Willoughby, J. K.

1993-01-01

A new technology for producing finite capacity schedules has been developed in response to complex requirements for operating space systems such as the Space Shuttle, the Space Station, and the Deep Space Network for telecommunications. This technology has proven its effectiveness in manufacturing environments where popular scheduling techniques associated with Materials Resources Planning (MRPII) and with factory simulation are not adequate for shop-floor work planning and control. The technology has three components. The first is a set of data structures that accommodate an extremely general description of a factory's resources, its manufacturing activities, and the constraints imposed by the environment. The second component is a language and set of software utilities that enable a rapid synthesis of functional capabilities. The third component is an algorithmic architecture called the Five Ruleset Model which accommodates the unique needs of each factory. Using the new technology, systems can model activities that generate, consume, and/or obligate resources. This allows work-in-process (WIP) to be generated and used; it permits constraints to be imposed or intermediate as well as finished goods inventories. It is also possible to match as closely as possible both the current factory state and future conditions such as promise dates. Schedule revisions can be accommodated without impacting the entire production schedule. Applications have been successful in both discrete and process manufacturing environments. The availability of a high-quality finite capacity production planning capability enhances the data management capabilities of MRP II systems. These schedules can be integrated with shop-floor data collection systems and accounting systems. Using the new technology, semi-custom systems can be developed at costs that are comparable to products that do not have equivalent functional capabilities and/or extensibility.

Your Shopping Dollar. [Revised.] Money Management.

ERIC Educational Resources Information Center

Baran, Nancy H., Ed.; Tarrant, Sharon M., Ed.

This booklet on shopping, 1 in a series of 12, covers all the basic aspects of personal- and family-money management. Suitable for use by high school and college students as well as adults, this handbook tells how to plan spending, develop shopping skills, and handle consumer problems effectively. Section 1 on consumers and the economy overviews…

Teacher Liability in School-Shop Accidents.

ERIC Educational Resources Information Center

Kegin, Denis J.

The intent of the book is to stimulate interest in the problem of shop-teacher liability and to identify certain needs which have not been adequately met by existing laws and statutes. Chapter 1, The Significance of Teacher Liability, discusses basic legal considerations, the environment of the school shop, and the possibility of liability.…

76 FR 4574 - Drawbridge Operation Regulations; Oakland Inner Harbor Tidal Canal, Oakland/Alameda, CA, Schedule...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-01-26

... Chance, Aroma Restaurant, Eskelund Marine, Bocanova, Vortex Marine Construction, British Marine, The Outboard Motor Shop, Waterfront Hotel-Miss Pearl's Restaurant, Encinal Yacht Club, Marina Village Inn, Kincaid's Restaurant, Scott's Seafood Restaurant, Captain Ed Payne Technical Services, Il Pescatore...

Mobile Equipment Expands Inventory.

ERIC Educational Resources Information Center

McGough, Robert L.; And Others

1978-01-01

Describes the Mobile Equipment Modules (MEM) system in Duluth, Minnesota. MEM is a way to hold down costs and increase learning opportunities by consolidating purchases of expensive shop equipment within the school district, grouping the equipment in modules, and scheduling and moving it from school to school as needed. (MF)

Doctor and pharmacy shopping for controlled substances.

PubMed

Peirce, Gretchen L; Smith, Michael J; Abate, Marie A; Halverson, Joel

2012-06-01

Prescription drug abuse is a major health concern nationwide, with West Virginia having one of the highest prescription drug death rates in the United States. Studies are lacking that compare living subjects with persons who died from drug overdose for evidence of doctor and pharmacy shopping for controlled substances. The study objectives were to compare deceased and living subjects in West Virginia for evidence of prior doctor and pharmacy shopping for controlled substances and to identify factors associated with drug-related death. A secondary data study was conducted using controlled substance, Schedule II-IV, prescription data from the West Virginia Controlled Substance Monitoring Program and drug-related death data compiled by the Forensic Drug Database between July 2005 and December 2007. A case-control design compared deceased subjects 18 years and older whose death was drug related with living subjects for prior doctor and pharmacy shopping. Logistic regression identified factors related to the odds of drug-related death. A significantly greater proportion of deceased subjects were doctor shoppers (25.21% vs. 3.58%) and pharmacy shoppers (17.48% vs. 1.30%) than living subjects. Approximately 20.23% of doctor shoppers were also pharmacy shoppers, and 55.60% of pharmacy shoppers were doctor shoppers. Younger age, greater number of prescriptions dispensed, exposure to opioids and benzodiazepines, and doctor and pharmacy shopping were factors with greater odds of drug-related death. Doctor and pharmacy shopping involving controlled substances were identified, and shopping behavior was associated with drug-related death. Prescription monitoring programs may be useful in identifying potential shoppers at the point of care.

Comparison of OPC job prioritization schemes to generate data for mask manufacturing

NASA Astrophysics Data System (ADS)

Lewis, Travis; Veeraraghavan, Vijay; Jantzen, Kenneth; Kim, Stephen; Park, Minyoung; Russell, Gordon; Simmons, Mark

2015-03-01

Delivering mask ready OPC corrected data to the mask shop on-time is critical for a foundry to meet the cycle time commitment for a new product. With current OPC compute resource sharing technology, different job scheduling algorithms are possible, such as, priority based resource allocation and fair share resource allocation. In order to maximize computer cluster efficiency, minimize the cost of the data processing and deliver data on schedule, the trade-offs of each scheduling algorithm need to be understood. Using actual production jobs, each of the scheduling algorithms will be tested in a production tape-out environment. Each scheduling algorithm will be judged on its ability to deliver data on schedule and the trade-offs associated with each method will be analyzed. It is now possible to introduce advance scheduling algorithms to the OPC data processing environment to meet the goals of on-time delivery of mask ready OPC data while maximizing efficiency and reducing cost.

Applying the Theory of Constraints to a Base Civil Engineering Operations Branch

DTIC Science & Technology

1991-09-01

Figure Page 1. Typical Work Order Processing . .......... 7 2. Typical Job Order Processing . .......... 8 3. Typical Simplified In-Service Work Plan for...Customers’ Customer Request Service Planning Unit Production] Control Center Material Control Scheduling CE Shops Figure 1.. Typical Work Order Processing 7

At-risk/problematic shopping and gambling in adolescence

PubMed Central

Pilver, Corey E.; Steinberg, Marvin A.; Rugle, Loreen J.; Krishnan-Sarin, Suchitra; Hoff, Rani A.; Potenza, Marc N.

2016-01-01

Elevated levels of both pathological gambling (PG) and problem shopping (PS) have been reported among adolescents, and each is associated with a range of other negative health/functioning measures. However, relationships between PS and PG, particularly during adolescence, are not well understood. In this study, we explored the relationship between different levels of problem-gambling severity and health/functioning characteristics, gambling-related social experiences, gambling behaviors and motivations among adolescents with and without at-risk/problematic shopping (ARPS). Survey data from Connecticut high school students (n=2,100) were analyzed using bivariate analyses and logistic regression modeling. Although at-risk/problematic gambling (ARPG) was not increased among adolescents with ARPS, adolescents with ARPG (versus non-gamblers) were more likely to report having experienced a growing tension or anxiety that could only be relieved by shopping and missing other obligations due to shopping. In comparison to the non-ARPS group, a smaller proportion of respondents in the ARPS group reported paid part-time employment, whereas a greater proportion of respondents reported excessive gambling by peers and feeling concerned over the gambling of a close family member. In general, similar associations between problem-gambling severity and measures of health/functioning and gambling-related behaviors and motivations were observed across ARPS and non-ARPS adolescents. However, associations were weaker among ARPS adolescents for several variables: engagement in extracurricular activities, alcohol and caffeine use and gambling for financial reasons. These findings suggest a complex relationship between problem-gambling severity and ARPS. They highlight the importance of considering co-occurring risk behaviors such as ARPS when treating adolescents with at-risk/problem gambling. PMID:25117852

At-Risk/Problematic Shopping and Gambling in Adolescence.

PubMed

Yip, Sarah W; Mei, Songli; Pilver, Corey E; Steinberg, Marvin A; Rugle, Loreen J; Krishnan-Sarin, Suchitra; Hoff, Rani A; Potenza, Marc N

2015-12-01

Elevated levels of both pathological gambling (PG) and problem shopping (PS) have been reported among adolescents, and each is associated with a range of other negative health/functioning measures. However, relationships between PS and PG, particularly during adolescence, are not well understood. In this study, we explored the relationship between different levels of problem-gambling severity and health/functioning characteristics, gambling-related social experiences, gambling behaviors and motivations among adolescents with and without at-risk/problematic shopping (ARPS). Survey data from Connecticut high school students (n = 2,100) were analyzed using bivariate analyses and logistic regression modeling. Although at-risk/problematic gambling (ARPG) was not increased among adolescents with ARPS, adolescents with ARPG (vs non-gamblers) were more likely to report having experienced a growing tension or anxiety that could only be relieved by shopping and missing other obligations due to shopping. In comparison to the non-ARPS group, a smaller proportion of respondents in the ARPS group reported paid part-time employment, whereas a greater proportion of respondents reported excessive gambling by peers and feeling concerned over the gambling of a close family member. In general, similar associations between problem-gambling severity and measures of health/functioning and gambling-related behaviors and motivations were observed across ARPS and non-ARPS adolescents. However, associations were weaker among ARPS adolescents for several variables: engagement in extracurricular activities, alcohol and caffeine use and gambling for financial reasons. These findings suggest a complex relationship between problem-gambling severity and ARPS. They highlight the importance of considering co-occurring risk behaviors such as ARPS when treating adolescents with at-risk/problem gambling.

Focus of attention in an activity-based scheduler

NASA Technical Reports Server (NTRS)

Sadeh, Norman; Fox, Mark S.

1989-01-01

Earlier research in job shop scheduling has demonstrated the advantages of opportunistically combining order-based and resource-based scheduling techniques. An even more flexible approach is investigated where each activity is considered a decision point by itself. Heuristics to opportunistically select the next decision point on which to focus attention (i.e., variable ordering heuristics) and the next decision to be tried at this point (i.e., value ordering heuristics) are described that probabilistically account for both activity precedence and resource requirement interactions. Preliminary experimental results indicate that the variable ordering heuristic greatly increases search efficiency. While least constraining value ordering heuristics have been advocated in the literature, the experimental results suggest that other value ordering heuristics combined with our variable-ordering heuristic can produce much better schedules without significantly increasing search.

Optimizing human activity patterns using global sensitivity analysis

PubMed Central

Hickmann, Kyle S.; Mniszewski, Susan M.; Del Valle, Sara Y.; Hyman, James M.

2014-01-01

Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule’s regularity for a population. We show how to tune an activity’s regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. We use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations. PMID:25580080

Optimizing human activity patterns using global sensitivity analysis

DOE PAGES

Fairchild, Geoffrey; Hickmann, Kyle S.; Mniszewski, Susan M.; ...

2013-12-10

Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule’s regularity for a population. We show how to tune an activity’s regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimizationmore » problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. Here we use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Finally, though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.« less

Cooperative quantum-behaved particle swarm optimization with dynamic varying search areas and Lévy flight disturbance.

PubMed

Li, Desheng

2014-01-01

This paper proposes a novel variant of cooperative quantum-behaved particle swarm optimization (CQPSO) algorithm with two mechanisms to reduce the search space and avoid the stagnation, called CQPSO-DVSA-LFD. One mechanism is called Dynamic Varying Search Area (DVSA), which takes charge of limiting the ranges of particles' activity into a reduced area. On the other hand, in order to escape the local optima, Lévy flights are used to generate the stochastic disturbance in the movement of particles. To test the performance of CQPSO-DVSA-LFD, numerical experiments are conducted to compare the proposed algorithm with different variants of PSO. According to the experimental results, the proposed method performs better than other variants of PSO on both benchmark test functions and the combinatorial optimization issue, that is, the job-shop scheduling problem.

Intermediate dose of imatinib in combination with chemotherapy followed by allogeneic stem cell transplantation improves early outcome in paediatric Philadelphia chromosome-positive acute lymphoblastic leukaemia (ALL): results of the Spanish Cooperative Group SHOP studies ALL-94, ALL-99 and ALL-2005.

PubMed

Rives, Susana; Estella, Jesús; Gómez, Pedro; López-Duarte, Mónica; de Miguel, Purificación García; Verdeguer, Amparo; Moreno, Maria José; Vivanco, José Luis; Couselo, José Miguel; Fernández-Delgado, Rafael; Maldonado, Marisol; Tasso, María; López-Ibor, Blanca; Lendínez, Francisco; López-Almaraz, Ricardo; Uriz, Javier; Melo, Montserrat; Fernández-Teijeiro, Ana; Rodríguez, Isidoro; Badell, Isabel

2011-09-01

Philadelphia-chromosome acute lymphoblastic leukaemia (Ph+ ALL) is a subgroup of ALL with very high risk of treatment failure. We report here the results of the Sociedad Española de Hematología y Oncología Pediátricas (SEHOP/SHOP) in paediatric Ph+ ALL treated with intermediate-dose imatinib concurrent with intensive chemotherapy. The toxicities and outcome of these patients were compared with historical controls not receiving imatinib. Patients with Ph+ ALL aged 1-18years were enrolled in three consecutive ALL/SHOP trials (SHOP-94/SHOP-99/SHOP-2005). In the SHOP-2005 trial, imatinib (260mg/m(2) per day) was given on day-15 of induction. Allogeneic haematopoietic stem-cell transplantation (HSCT) from a matched related or unrelated donor was scheduled in first complete remission (CR1). Forty-three patients were evaluable (22 boys, median age 6·8years, range, 1·2-15). Sixteen received imatinib whereas 27 received similar chemotherapy without imatinib. Seventeen of 27 and 15 of 16 patients in the non-imatinib and imatinib cohort, respectively, underwent HSCT in CR1. With a median follow-up of 109 and 39months for the non-imatinib and imatinib cohorts, the 3-year event-free survival (EFS) was 29·6% and 78·7%, respectively (P=0·01). These results show that, compared to historical controls, intermediate dose of imatinib given concomitantly with chemotherapy and followed by allogeneic HSCT markedly improved early EFS in paediatric Ph+ ALL. © 2011 Blackwell Publishing Ltd.

Postreinforcement Pause in Grocery Shopping: Comparing Interpurchase Times across Products and Consumers

ERIC Educational Resources Information Center

Oliveira-Castro, Jorge M.; James, Victoria K.; Foxall, Gordon R.

2007-01-01

Purchase probability as a function of interpurchase time was examined through comparison of findings from laboratory experiments on reinforcement schedules and from marketing investigations of consumers' interpurchase time. Panel data, based on a sample of 80 consumers who purchased nine supermarket food products during 16 weeks, were used. For…

Evaluation of RFID for Information Visibility Based Job-Shop Scheduling in Lean Manufacturing Environments

ERIC Educational Resources Information Center

Chongwatpol, Jongsawas

2012-01-01

This dissertation investigates the impact of radio frequency identification (RFID) in manufacturing. Two simulation studies of an organization that is considering implementing RFID on a production line are conducted. First, we investigate whether addition of RFID technologies in the manufacturing process can complement Lean initiatives.…

Development and preliminary validation of an index for indicating the risks of the design of working hours to health and wellbeing.

PubMed

Schomann, Carsten; Giebel, Ole; Nachreiner, Friedhelm

2006-01-01

BASS 4, a computer program for the design and evaluation of workings hours, is an example of an ergonomics-based software tool that can be used by safety practitioners at the shop floor with regard to legal, ergonomic, and economic criteria. Based on experiences with this computer program, a less sophisticated Working-Hours-Risk Index for assessing the quality of work schedules (including flexible work hours) to indicate risks to health and wellbeing has been developed to provide a quick and easy applicable tool for legally required risk assessments. The results of a validation study show that this risk index seems to be a promising indicator for predicting risks of health complaints and wellbeing. The purpose of the Risk Index is to simplify the evaluation process at the shop floor and provide some more general information about the quality of a work schedule that can be used for triggering preventive interventions. Such a risk index complies with practitioners' expectations and requests for easy, useful, and valid instruments.

Simulation of Energy Savings in Automotive Coatings Processes

NASA Astrophysics Data System (ADS)

Gerini Romagnoli, Marco

Recently, the automakers have become more and more aware of the environmental and economic impact of their manufacturing processes. The paint shop is the largest energy user in a vehicle manufacturing plant, and one way to reduce costs and energy usage is the optimization of this area. This project aims at providing a tool to model and simulate a paint shop, in order to run and analyze some scenarios and case studies, helping to take strategic decisions. Analytical computations and real data were merged to build a tool that can be used by FCA for their Sterling Heights plant. Convection and conduction heat losses were modeled for the dip processes and the ovens. Thermal balances were used to compute the consumptions of booths, decks and ovens, while pump and fan energy consumptions were modeled for each sub-process. The user acts on a calendar, scheduling a year of production, and the model predicts the energy consumption of the paint shop. Five scenarios were run to test different conditions and the influence of scheduling on the energy consumption. Two different sets of production schedules have been evaluated, the first one fulfilling the production requirement in one shift of 10 hours, at high rate, the second one using two 7-hour-long shifts at medium production rate. It was found that the unit cost was minimized in the warmest months of spring and fall, and system shutdown was a crucial factor to reduce energy consumption. A fifth hypothetical scenario was run, with a 4 month continuous production and an 8 month total shutdown, which reduced the energy consumption to a half of the best realistic scenario. When the plant was run in a two-shifts configuration, the cost to coat a vehicle was found to be 29 with weekend shutdown, and 39 without. In the one-shift configuration, the cost was slightly higher, but the difference was less than 5%. While the fifth scenario showed a consistent reduction of the unit cost, inventory and logistic expenses deriving from the production strategy make this scenario almost impossible to realize. A sensitivity analysis was run on several parameters influencing the energy consumption of the paint shop, and the booths set point temperature was found to be the most significant factor.

Treatment of chromium contaminated plating shop rinsewater streams by reverse osmosis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Walker, J.F.; Brown, C.H. Jr.; Wilson, J.H.

1988-01-01

Wastewater is discharged to the local sanitary sewer, which is regulated by a Metropolitan Sewer District (MSD). The MSD has established discharge limits and reports have indicated that the major source of wastewater and primary area of concern is the discharge from the industrial plating shop within the plant complex. This plating shop generates /approximately/1100 m/sup 3/ (300,000 gal) of wastewater per day. Because construction of a new plating shop is currently planned, a complete renovation of the existing plating shop is not economically feasible. The sponsor demonstrated the use of innovative wastewater treatment technologies that will minimize the amountmore » of wastewater generated from the plating processes and maintain compliance with MSD discharge limits until the new plating shop is constructed. The problems at the facility have been analyzed and a treatment system utilizing reverse osmosis (RO), with volume reduction of the RO concentrate by evaporation, has been recommended. The utilization of RO meets the specification for the demonstration of innovative technology. This paper discusses the problem analysis at the plant as well as the results of a pilot scale RO test program currently being conducted. The installation of the full scale unit is dependent on the successful completion of the RO pilot tests. 1 ref., 6 figs., 3 tabs.« less

Shopping for a safer car

DOT National Transportation Integrated Search

2010-01-01

This brochure provides some helpful tips on what to look for when shopping for a safer car. Automakers are increasingly advertising the safety features of their cars. The problem is sorting out their claims and zeroing in on the safety features that ...

Consumer Health.

ERIC Educational Resources Information Center

Harrelson, Orvis A.; And Others

This guide to consumer health contains two parts, the first of which covers consumerism, cosmetics (aids for skin problems, dandruff, deodorants, dentifrices), food shopping, and clothes shopping. Part 2 discusses health quackery, including arthritis quackery, and mail-order "doctoring", food quackery, weight-reducing products, and how…

Solving Power Tool Problems in the School Shop

ERIC Educational Resources Information Center

Irvin, Daniel W.

1976-01-01

The school shop instructor is largely responsible for the preventive maintenance of power tools. These preventive measures primarily involve proper alignment, good lubrication, a reasonable maintenance program, and good operating procedures. Suggestions for maintenance of specific equipment is provided. (Author/BP)

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times.

PubMed

Ćwik, Michał; Józefczyk, Jerzy

2018-01-01

An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations are applied to simplify the optimization procedure. First of all, a greedy procedure is used for calculating the criterion's value, as such calculation is NP-hard problem itself. Moreover, the lower bound is used instead of solving the internal deterministic flow-shop. The constructive heuristic algorithm is applied for the relaxed optimization problem. The algorithm is compared with previously elaborated other heuristic algorithms basing on the evolutionary and the middle interval approaches. The conducted computational experiments showed the advantage of the constructive heuristic algorithm with regards to both the criterion and the time of computations. The Wilcoxon paired-rank statistical test confirmed this conclusion.

A multiagent evolutionary algorithm for constraint satisfaction problems.

PubMed

Liu, Jing; Zhong, Weicai; Jiao, Licheng

2006-02-01

With the intrinsic properties of constraint satisfaction problems (CSPs) in mind, we divide CSPs into two types, namely, permutation CSPs and nonpermutation CSPs. According to their characteristics, several behaviors are designed for agents by making use of the ability of agents to sense and act on the environment. These behaviors are controlled by means of evolution, so that the multiagent evolutionary algorithm for constraint satisfaction problems (MAEA-CSPs) results. To overcome the disadvantages of the general encoding methods, the minimum conflict encoding is also proposed. Theoretical analyzes show that MAEA-CSPs has a linear space complexity and converges to the global optimum. The first part of the experiments uses 250 benchmark binary CSPs and 79 graph coloring problems from the DIMACS challenge to test the performance of MAEA-CSPs for nonpermutation CSPs. MAEA-CSPs is compared with six well-defined algorithms and the effect of the parameters is analyzed systematically. The second part of the experiments uses a classical CSP, n-queen problems, and a more practical case, job-shop scheduling problems (JSPs), to test the performance of MAEA-CSPs for permutation CSPs. The scalability of MAEA-CSPs along n for n-queen problems is studied with great care. The results show that MAEA-CSPs achieves good performance when n increases from 10(4) to 10(7), and has a linear time complexity. Even for 10(7)-queen problems, MAEA-CSPs finds the solutions by only 150 seconds. For JSPs, 59 benchmark problems are used, and good performance is also obtained.

77 FR 34854 - Prevailing Rate Systems; Special Wage Schedules for Nonappropriated Fund Automotive Mechanics

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-12

..., and job-grading standards for uniform application by all Federal agencies. While most FWS employees... hours required to complete a particular job. Since the change would de-link shop labor rates from... survey of similar jobs in the local area annually. An hourly flat rate would be established for each of...

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 Propagation techniques. A simulation platform, an analysis tool and different test case scenarios for CTA were developed to test the performance of the scheduler and are also described.

The "Shopping" Behavior of Parents of Mentally Retarded Children: The Professional Person's Role

ERIC Educational Resources Information Center

Anderson, Kathryn A.

1971-01-01

Discussed is the role of the professional in preventing or stopping diagnostic and therapeutic shopping (repeated visits to the same or different professionals without resolution of a resolvable problem), with emphasis on the initial informing interview. (KW)

Ant system: optimization by a colony of cooperating agents.

PubMed

Dorigo, M; Maniezzo, V; Colorni, A

1996-01-01

An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed methodology to the classical traveling salesman problem (TSP), and report simulation results. We also discuss parameter selection and the early setups of the model, and compare it with tabu search and simulated annealing using TSP. To demonstrate the robustness of the approach, we show how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling. Finally we discuss the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.

Cooperative Quantum-Behaved Particle Swarm Optimization with Dynamic Varying Search Areas and Lévy Flight Disturbance

PubMed Central

Li, Desheng

2014-01-01

This paper proposes a novel variant of cooperative quantum-behaved particle swarm optimization (CQPSO) algorithm with two mechanisms to reduce the search space and avoid the stagnation, called CQPSO-DVSA-LFD. One mechanism is called Dynamic Varying Search Area (DVSA), which takes charge of limiting the ranges of particles' activity into a reduced area. On the other hand, in order to escape the local optima, Lévy flights are used to generate the stochastic disturbance in the movement of particles. To test the performance of CQPSO-DVSA-LFD, numerical experiments are conducted to compare the proposed algorithm with different variants of PSO. According to the experimental results, the proposed method performs better than other variants of PSO on both benchmark test functions and the combinatorial optimization issue, that is, the job-shop scheduling problem. PMID:24851085

Application Of Interferometry To Optical Components And Systems Evaluation

NASA Astrophysics Data System (ADS)

Houston, Joseph B., Jr.

1982-05-01

Interferometry provides opticians and lens designers with the ability to evaluate optical components and systems quantitatively. A variety of interferometers and interferometric test procedures have evolved over the past several decades. This evolution has stimulated an ever-increasing amount of interest in using a new generation of instrumentation and computer software for solving cost and schedule problems both in the shop and at field test sites. Optical engineers and their customers continue to gain confidence in their abilities to perform several operations such as assure component quality, analyze and optimize lens assemblies, and accurately predict end-item performance. In this paper, a set of typical test situations are addressed and some standard instrumentation is described, as a means of illustrating the special advantages of interferometric testing. Emphasis will be placed on the proper application of currently available hardware and some of the latest proven techniques.

CONTROL OF CHELATOR-BASED UPSETS IN SURFACE FINISHING SHOP WASTE WATER TREATMENT SYSTEMS

EPA Science Inventory

Actual surface finishing shop examples are used to illustrate the use of process chemistry understanding and analyses to identify immediate, interim and permanent response options for industrial waste water treatment plant (IWTP) upset problems caused by chelating agents. There i...

Cooperative educational project for optical technicians utilizing amateur telescope making

NASA Astrophysics Data System (ADS)

Williamson, Ray

2004-01-01

In the modern optical shop, technicians are typically skilled machine operators who work on only one phase of the manufacture for each and every component. The product is designed, specified, methodized, scheduled and integrated by people off the shop floor. Even at the component level, the people inside the shop usually see only one stage of completion. In an effort to make the relevance of their work visible; to demonstrate competence to their peers; to gain appreciation for the work of others; and to give them a meaningful connection with the functions of optical systems, I created "The Telescope Project" for my former employer. I invited those interested to participate in an after-hours, partially subsidized project to build telescopes for themselves. The ground-rules included that we would all make the same design (thus practicing consensus and configuration management); that we would all work on every phase (thus learning from each other); and that we would obtain our parts by random lot at the end (thus making quality assurance a personal issue). In the process the participating technicians learned about optical theory, design, tolerancing, negotiation, scheduling, purchasing, fabrication, coating and assembly. They developed an appreciation for each other's contributions and a broader perspective on the consequences of their actions. In the end, each obtained a high-quality telescope for his or her personal use. Several developed an abiding love for astronomy. The project generated much interest from technicians who didn"t initially choose to participate. In this paper I describe the project in detail.

Characteristics of prescribers whose patients shop for opioids: results from a cohort study.

PubMed

Cepeda, M Soledad; Fife, Daniel; Berlin, Jesse A; Mastrogiovanni, Gregory; Yuan, Yingli

2012-01-01

Little is known about the prevalence of opioid shoppers in clinical practices and the relation between prescriber characteristics and the risk of having opioid shoppers. Describe the prevalence of opioid shoppers in prescribers' practices. Assess the relation between prescribers' characteristics and patient opioid shopping behavior. Retrospective cohort study using a large US retail prescription database. Patients with ≥1 opioid dispensing were followed 18 months. These patients' prescribers are the focus of the study. A patient was a "shopper" if he or she had opioid prescriptions written by ≥1 prescriber with ≥1 day of overlap filled at ≥3 pharmacies and a "heavy shopper" if he or she had ≥5 shopping episodes. The proportions of shoppers by prescriber and the proportion of prescribers with ≥1 shopper or heavy shopper were calculated. Among 858,290 opioid prescribers, most (87 percent) had no shoppers and 98 percent had no heavy shoppers. Prescribers who were aged 70-79 years, male, or who prescribed schedule II opioids had an increased likelihood of having shoppers. As the number of patients for whom a prescriber prescribed opioids increased, the proportion of shoppers also increased. Prescribers with 66 or more patients receiving opioids, who represented 25 percent of prescribers, prescribed for 82 percent of all shoppers. The great majority of opioid prescribers appear to have no shoppers in their practice. Any educational program will be more cost effective if targeted to prescribers of schedule II opioids with a large volume of patients requiring opioids.

Ethical Ideologies: Do They Affect Shopping Behaviors and Perceptions of Morality?

ERIC Educational Resources Information Center

Cho, Hyeon; Yoo, Jeong-Ju; Johnson, Kim K. P.

2005-01-01

Counterfeiting is a serious problem facing several industries, including the medical, agricultural, and apparel industries (Bloch, Bush, & Campbell, 1993). The authors investigated whether ethical viewpoints affect perceptions of the morality of particular shopping behaviors, attitudes toward counterfeit products, and intentions to purchase such…

Job-shop scheduling applied to computer vision

NASA Astrophysics Data System (ADS)

Sebastian y Zuniga, Jose M.; Torres-Medina, Fernando; Aracil, Rafael; Reinoso, Oscar; Jimenez, Luis M.; Garcia, David

1997-09-01

This paper presents a method for minimizing the total elapsed time spent by n tasks running on m differents processors working in parallel. The developed algorithm not only minimizes the total elapsed time but also reduces the idle time and waiting time of in-process tasks. This condition is very important in some applications of computer vision in which the time to finish the total process is particularly critical -- quality control in industrial inspection, real- time computer vision, guided robots. The scheduling algorithm is based on the use of two matrices, obtained from the precedence relationships between tasks, and the data obtained from the two matrices. The developed scheduling algorithm has been tested in one application of quality control using computer vision. The results obtained have been satisfactory in the application of different image processing algorithms.

KSC-04pd1056

NASA Image and Video Library

2004-05-07

KENNEDY SPACE CENTER, FLA. -- STS-114 Mission Specialist Soichi Noguchi looks closely at low pressure oxidizer duct in the Space Shuttle Main Engine Shop at KSC. He and other crew members are touring several areas on the Center. The STS-114 mission is Logistics Flight 1, which is scheduled to deliver supplies and equipment plus the external stowage platform to the International Space Station.

Shop Local—and Fresh—at the Summer Farmers' Market | Poster

Cancer.gov

The summer farmers’ market at NCI at Frederick is under way right on schedule, undeterred by a cool and rainy May. Shoppers can find fresh produce, starter plants, local meats and cheeses, coffee, crafts, and more in the front parking lot of Building 549 every Tuesday from 11 a.m. to 1 p.m. The market will run through Oct. 25.

Online Mall: How One District Got Started in E-Purchasing.

ERIC Educational Resources Information Center

Barclay, Brian

2001-01-01

To address the problem of outdated vendor catalogs, Edmonton (Alberta) Public Schools created a view-only online shopping mall that evolved into an electronic shopping program. Buyers can use credit cards for some transactions and cost coding for others. They can also sell unwanted items online. (MLH)

Shopping with Acquired Brain Injuries, Coping Strategies and Maslowian Principles.

PubMed

Andersson, Jonas E; Skehan, Terry; Rydén, Monica; Lagerkrans, Elisabeth

2016-01-01

A positive outcome of the modern welfare state is prolonged life expectancy. In Sweden, the expected life span has increased with approximatively 25 years during the 20th century [Statistics Sweden]. However, ageing is associated with an increased risk for acquiring cognitive and physical disabilities. This study is based on anonymized interviews with groups of older persons who experience cognitive problems and relatives. The interviewees were asked about everyday activities like shopping groceries, clothes or other necessities. The interviewees identified problems and described a series of strategies for coping. This paper uses fictionalized characters to present problems and coping strategies that the interviewees use to overcome cognitive challenges when shopping groceries. The strategies range from complete withdrawal, an increased dependency on proxies to the development of elaborate techniques to mask their problem and obtain assistance. Following the current trend in the design of the Swedish sales environment - large scale, abundance of goods and Maslowian strategies for making people stay longer (and spend more money) - accessibility in the built environment is often an absent friend.

Risk factors associated with purchasing pesticide from shops for self-poisoning: a protocol for a population-based case-control study.

PubMed

Weerasinghe, Manjula; Konradsen, Flemming; Eddleston, Michael; Pearson, Melissa; Gunnell, David; Hawton, Keith; Jayamanne, Shaluka; Pabasara, Chathurani; Jayathilaka, Tharidu; Dissanayaka, Kalpani; Rajapaksha, Sandamali; Thilakarathna, Prasanna; Agampodi, Suneth

2015-05-20

Pesticide self-poisoning is one of the most frequently used methods of suicide worldwide, killing over 300,000 people annually. Around 15-20% of pesticide self-poisonings occur soon after the person has bought the pesticide from a shop. We aim to determine the characteristics of individuals who purchase pesticides directly from shops and how they differ from individuals who access pesticides from other sources such as home, home garden or farmland. This information will help inform possible vendor/shop-based intervention strategies aimed at reducing access to pesticides used for self-harm. This study will investigate risk factors associated with purchasing pesticides for acts of self-poisoning from pesticide shops, including cases identified over a 9-month period using a population-based case-control group approach. Four interviewer-administered data collection tools will be used for this study: a semistructured questionnaire, Beck Suicidal Intent Scale (SIS), Clinical Interview Schedule-Sinhalese version (CIS-Sn) and Alcohol Use Disorders Identification Test (AUDIT). Each case (expected n=33) will be compared with two groups of individuals: (1) those who have self-poisoned using pesticides from the home, home garden or farmland and (2) those who bought pesticides from the same shops as the above cases, but not did not self-poison. Logistic regression models will be used to identify risk factors of purchasing pesticides for self-poisoning from shops. The study has received ethical approval from the Ethical Review Committee of the Faculty of Medicine and Allied Sciences, Rajarata University of Sri Lanka. A sensitive data collection technique will be used and ethical issues will be considered throughout the study. Results will be disseminated in scientific peer-reviewed articles. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.

How Knowledge Organisations Work: The Case of Software Firms

ERIC Educational Resources Information Center

Gottschalk, Petter

2007-01-01

Knowledge workers in software firms solve client problems in sequential and cyclical work processes. Sequential and cyclical work takes place in the value configuration of a value shop. While typical examples of value chains are manufacturing industries such as paper and car production, typical examples of value shops are law firms and medical…

Photocopy of drawing (this photograph is an 8" x 10" ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

Photocopy of drawing (this photograph is an 8" x 10" copy of an 8" x 10" negative; 1989 original architectural drawing located at Building No. 458, NAS Pensacola, Florida) Renovation and revised office layout, Building No. 45, third floor, architectural floor plans, details and schedules, Sheet 1 of 3 - U.S. Naval Air Station, Equipment Shops & Offices, 206 South Avenue, Pensacola, Escambia County, FL

KSC-04pd1058

NASA Image and Video Library

2004-05-07

KENNEDY SPACE CENTER, FLA. -- In the Space Shuttle Main Engine Shop at KSC, Boeing Product Support Director Dan Hausman (left) talks with STS-114 Mission Commander Eileen Collins. Behind them is one of the main engines. Crew members are touring several areas on Center. The STS-114 mission is Logistics Flight 1, which is scheduled to deliver supplies and equipment plus the external stowage platform to the International Space Station.

MANUFACTURING PROCESS FUNCTIONS--I. AN ALTERNATIVE MODEL AND ITS COMPARISON WITH EXISTING FUNCTIONS (AND)II. SELECTION OF TRAINEES AND CONTROL OF THEIR PROGRESS.

ERIC Educational Resources Information Center

GLOVER, J.H.

THE CHIEF OBJECTIVE OF THIS STUDY OF SPEED-SKILL ACQUISITION WAS TO FIND A MATHEMATICAL MODEL CAPABLE OF SIMPLE GRAPHIC INTERPRETATION FOR INDUSTRIAL TRAINING AND PRODUCTION SCHEDULING AT THE SHOP FLOOR LEVEL. STUDIES OF MIDDLE SKILL DEVELOPMENT IN MACHINE AND VEHICLE ASSEMBLY, AIRCRAFT PRODUCTION, SPOOLMAKING AND THE MACHINING OF PARTS CONFIRMED…

Fleet Sizing of Automated Material Handling Using Simulation Approach

NASA Astrophysics Data System (ADS)

Wibisono, Radinal; Ai, The Jin; Ratna Yuniartha, Deny

2018-03-01

Automated material handling tends to be chosen rather than using human power in material handling activity for production floor in manufacturing company. One critical issue in implementing automated material handling is designing phase to ensure that material handling activity more efficient in term of cost spending. Fleet sizing become one of the topic in designing phase. In this research, simulation approach is being used to solve fleet sizing problem in flow shop production to ensure optimum situation. Optimum situation in this research means minimum flow time and maximum capacity in production floor. Simulation approach is being used because flow shop can be modelled into queuing network and inter-arrival time is not following exponential distribution. Therefore, contribution of this research is solving fleet sizing problem with multi objectives in flow shop production using simulation approach with ARENA Software

An investigation of transitional management problems for the NSTS at NASA, executive summary

NASA Technical Reports Server (NTRS)

Hunsucker, John

1988-01-01

A summary is given of the work of the University of Houston research team for the third quarter of effort in a yearly grant for the National Space Transportation System (NSTS). As such it serves as a resting place for the ideas and concepts developed this quarter with the collaboration of the Management Integration Offices of NASA. Another objective is the hope that the report will help to stimulate the healthy problem solving process already present at NASA. The main goal of the contractual work is to help NASA to find ways and means of moving into a truly operational era with the shuttle program. This work is a continuation of early work and the reader is encouraged to read the final reports of earlier years. Chapter One of the report is an introduction. Chapter Two deals with industrial adaptation and is in two parts: theory and application. In the theory section, impressions of the management system immediately after reflight are discussed. A key issue, in the author's opinion is the seeming lack of purpose of the program. The application section has six appendices: 1988 Demographic Survey, Field Notes of Interview with HL/P South Texas Nuclear Project, a comparison of the Agendas of the current manager with that of a previous manager, a note on compartmentalization to assist in manifesting, a study on launch prediction for STS-26, and a discussion of a statistical decision-making course for upper level managers. Chapter Three deals with theoretical results returned on flow shop scheduling which will be of use downstream. Chapter Four deals with a statistical model developed to predict the flight rate in future years and indicates the program will have trouble making its schedule. Chapter Five covers the constructural effort and shows the work to be on schedule.

Change as Challenge for Shop-Floor Learning: The Case of Western and Local Manufacturing Companies in South China

NASA Astrophysics Data System (ADS)

Hong, Jianzhong

2000-11-01

This paper explores the process of workplace learning and problem solving by examining Western and local enterprises in South China. The paper addresses the subject on two levels. First, it examines the process of learning by solving problems on the shop floor. Second, it deals with certain managerial concepts embedded in Chinese culture and discusses whether these concepts help or impede collective learning. The article concludes that new ways of working and learning are emerging through the interaction of Western and Chinese culture.

Rules for Adaptive Learning and Assistance on the Shop Floor

ERIC Educational Resources Information Center

Ullrich, Carsten

2016-01-01

Today's shop floor, the area of a factory where operatives assemble products, is a complex and demanding work environment. The employed and produced technology becomes ever more complex, and employees are responsible for an increasing amount of tasks. As a consequence, the employee is under constant pressure to solve problems occurring on the shop…

KSC-04PD-1055

NASA Technical Reports Server (NTRS)

2004-01-01

KENNEDY SPACE CENTER, FLA. -- STS-114 Mission Specialist Charles Camarda and Boeing Tech Operations Team Manager Matthew McClelland look at an engine on a visit to the Space Shuttle Main Engine Shop at KSC. He and other crew members touring several areas on the Center. The STS-114 mission is Logistics Flight 1, which is scheduled to deliver supplies and equipment plus the external stowage platform to the International Space Station.

KSC-04pd1055

NASA Image and Video Library

2004-05-07

KENNEDY SPACE CENTER, FLA. -- STS-114 Mission Specialist Charles Camarda and Boeing Tech Operations’ Team Manager Matthew McClelland look at an engine on a visit to the Space Shuttle Main Engine Shop at KSC. He and other crew members touring several areas on the Center. The STS-114 mission is Logistics Flight 1, which is scheduled to deliver supplies and equipment plus the external stowage platform to the International Space Station.

Constraint-Directed Search: A Case Study of Job-Shop Scheduling.

DTIC Science & Technology

1983-12-13

Structures But Were Unable to Represent", Proceedings of the American Association for Aritificial Intelligence , pp. 212-214, Stanford University...under these constraints raises a number of issues of interest to the artificial intelligence community such as: - knowledge representation semantics for...Management Science 15 2.3. Artificial Intelligence 17 2.4. Relationship to Previous Research 21 3. ISIS Modeling System 23 3.1. Introduction 24 3.2. Layer

Psychiatric Prescribers' Experiences With Doctor Shoppers.

PubMed

Worley, Julie; Johnson, Mary; Karnik, Niranjan

2015-01-01

Doctor shopping is a primary method of prescription medication diversion. After opioids, benzodiazepines and stimulants are the next most common prescription medications used nonmedically. Studies have shown that patients who engage in doctor shopping find it fun, exciting, and easy to do. There is a lack of research on the prescriber's perspective on the phenomenon of doctor shopping. This study investigates the experiences of prescribers in psychiatry with patients who engage in doctor shopping. Fifteen prescribers including psychiatrists and psychiatric nurse practitioners working in outpatient psychiatry were interviewed to elicit detailed information about their experiences with patients who engage in doctor shopping. Themes found throughout the interview were that psychiatric prescribers' experience with patients who engage in doctor shopping includes (a) detecting red flags, (b) negative emotional responding, (c) addressing the patient and the problem, and (d) inconsistently implementing precautions. When red flags were detected when prescribing controlled drugs, prescribers in psychiatry experienced both their own negative emotional responses such as disappointment and resentment as well as the negative emotions of the patients such as anger and other extreme emotional responses. Psychiatric prescribers responded to patient's doctor shopping in a variety of ways such as changing their practice, discharging the patients or taking steps to not accept certain patients identified as being at risk for doctor shopping, as well as by talking to the patient and trying to offer them help. Despite experiencing doctor shopping, the prescribers inconsistently implemented precautionary measures such as checking prescription drug monitoring programs. © The Author(s) 2015.

Injuries sustained by students in shop class.

PubMed

Knight, S; Junkins, E P; Lightfoot, A C; Cazier, C F; Olson, L M

2000-07-01

Injuries in the school environment are a serious public health problem. Injuries occurring within the school shop class are a part of this problem that has received little to no attention. The purpose of our study was to describe the epidemiology of shop class injuries in Utah public schools for the years 1992-1996. Utah statewide grades 7 through 12 school injury data for 1992-1996 were used. The data were generated from a standardized Student Injury Report form completed by school personnel immediately after the occurrence of an injury on school premises that: 1) caused loss of at least one half of a day of school; and/or 2) warranted medical attention and treatment. Shop injuries were defined as injuries that occurred in industrial art classes, vocational educational classes, or automotive classes. To determine the medical outcome and hospital charges associated with shop class injuries, we linked the Student Injury Report database to Utah statewide emergency department (ED) records (available for 1996 only), and to Utah statewide hospital inpatient discharge records (1992-1996). During 1992-1996, 14 133 students in grades 7 through 12 were injured at school, of which 1008 (7.1%) were injured during a shop class. The majority (88. 4%) of shop injuries involved equipment use. Equipment was misused in 37.9% and malfunctioned in 3.5% of the incidents. The leading injuries reported for shop equipment were lacerations (70.9%), burns (6.0%), and abrasions (4.6%), whereas the leading for nonequipment injuries were lacerations (45.4%), fractures (9.2%), and pain/tenderness (6.7%). In 1996, 167 students were injured in a shop class and 45 (26.9%) visited an ED as a result of the shop injury. Equipment was a factor in 88.9% of the shop injuries admitted to the ED. Table saws (15.0%), other saws (15.0%), and band saws (12.5%) were involved in nearly one half of the equipment injuries. Equipment was misused in 44.7% and malfunctioned in 10.5% of the incidents resulting in an ED visit. The majority (64.4%) of students sustained an open wound injury. The total ED charges were $16 571. For 1992-1996, 1008 students were injured in a shop class, 7 (.7%) required inpatient hospital care. Six of the students were injured using a table saw and 1 sustained injuries attributable to automotive cleaning fluid. Equipment was used improperly in 4 of the table saw injuries. Six of the students sustained hand injuries, with 3 suffering a traumatic amputation of a finger or thumb. The total inpatient charges were $26 747. School shop injuries have a great impact on students, their families, and schools because of the loss of productivity for the student and the financial impact. Many of the injuries are preventable. These findings stress the need for school administrators, teachers, and students to develop and improve safety policies and practices in school shop classes. In addition, the findings may provide useful information to pediatricians and enable them to better inform patients of risks in school shop classes.

Exploring the status of retail private drug shops in Bangladesh and action points for developing an accredited drug shop model: a facility based cross-sectional study.

PubMed

Ahmed, Syed Masud; Naher, Nahitun; Hossain, Tarek; Rawal, Lal Bahadur

2017-01-01

The private retail drug shops market in Bangladesh is largely unregulated and unaccountable, giving rise to irrational use of drugs and high Out-of-pocket expenditure on health. These shops are served by salespersons with meagre or no formal training in dispensing. This facility-based cross-sectional study was undertaken to investigate how the drug shops currently operate vis-a-vis the regulatory regime including dispensing practices of the salespersons, for identifying key action points to develop an accredited model for Bangladesh. About 90 rural and 21 urban retail drug shops from seven divisions were included in the survey. The salespersons were interviewed for relevant information, supplemented by qualitative data on perceptions of the catchment community as well as structured observation of client-provider interactions from a sub-sample. In 76% of the shops, the owner and the salesperson was the same person, and >90% of these were located within 30 min walking distance from a public sector health facility. The licensing process was perceived to be a cumbersome, lengthy, and costly process. Shop visit by drug inspectors were brief, wasn't structured, and not problem solving. Only 9% shops maintained a stock register and 10% a drug sales record. Overall, 65% clients visited drug shops without a prescription. Forty-nine percent of the salespersons had no formal training in dispensing and learned the trade through apprenticeship with fellow drug retailers (42%), relatives (18%), and village doctors (16%) etc. The catchment population of the drug shops mostly did not bother about dispensing training, drug shop licensing and buying drugs without prescription. Observed client-dispenser interactions were found to concentrate mainly on financial transaction, unless, the client pro-actively sought advice regarding the use of the drug. Majority of the drug shops studied are run by salespersons who have informal 'training' through apprenticeship. Visiting drug shops without a prescription, and dispensing without counseling unless pro-actively sought by the client, was very common. The existing process is discouraging for the shop owners to seek license, and the shop inspection visits are irregular, unstructured and punitive. These facts should be considered while designing an accredited model of drug shop for Bangladesh.

An analysis of iterated local search for job-shop scheduling.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitley, L. Darrell; Howe, Adele E.; Watson, Jean-Paul

2003-08-01

Iterated local search, or ILS, is among the most straightforward meta-heuristics for local search. ILS employs both small-step and large-step move operators. Search proceeds via iterative modifications to a single solution, in distinct alternating phases. In the first phase, local neighborhood search (typically greedy descent) is used in conjunction with the small-step operator to transform solutions into local optima. In the second phase, the large-step operator is applied to generate perturbations to the local optima obtained in the first phase. Ideally, when local neighborhood search is applied to the resulting solution, search will terminate at a different local optimum, i.e.,more » the large-step perturbations should be sufficiently large to enable escape from the attractor basins of local optima. ILS has proven capable of delivering excellent performance on numerous N P-Hard optimization problems. [LMS03]. However, despite its implicity, very little is known about why ILS can be so effective, and under what conditions. The goal of this paper is to advance the state-of-the-art in the analysis of meta-heuristics, by providing answers to this research question. They focus on characterizing both the relationship between the structure of the underlying search space and ILS performance, and the dynamic behavior of ILS. The analysis proceeds in the context of the job-shop scheduling problem (JSP) [Tai94]. They begin by demonstrating that the attractor basins of local optima in the JSP are surprisingly weak, and can be escaped with high probaiblity by accepting a short random sequence of less-fit neighbors. this result is used to develop a new ILS algorithms for the JSP, I-JAR, whose performance is competitive with tabu search on difficult benchmark instances. They conclude by developing a very accurate behavioral model of I-JAR, which yields significant insights into the dynamics of search. The analysis is based on a set of 100 random 10 x 10 problem instances, in addition to some widely used benchmark instances. Both I-JAR and the tabu search algorithm they consider are based on the N1 move operator introduced by van Laarhoven et al. [vLAL92]. The N1 operator induces a connected search space, such that it is always possible to move from an arbitrary solution to an optimal solution; this property is integral to the development of a behavioral model of I-JAR. However, much of the analysis generalizes to other move operators, including that of Nowicki and Smutnick [NS96]. Finally the models are based on the distance between two solutions, which they take as the well-known disjunctive graph distance [MBK99].« less

KAMEDO report no. 87: bomb attack in Finnish shopping center, 2002.

PubMed

Deverell, Edward; Ortenwall, Per; Almgren, Ola; Riddez, Louis

2007-01-01

The detonation of a bomb in a shopping center in Vantaa, Finland, took place on 11 October 2002. Seven people died as a result and > 160 people required medical attention. Because the rescue teams were inadequately trained to respond to terrorist attacks, the event was handled according to protocol. A number of problems arose, including: people from different rescue agencies were difficult to distinguish from each other; there was inadequate communication between the incident site and the main hospital; relatives of victims were not kept informed; and psychiatric problems in the wake of the disaster were not addressed sufficiently.

Limitations to the Dutch cannabis toleration policy: Assumptions underlying the reclassification of cannabis above 15% THC.

PubMed

Van Laar, Margriet; Van Der Pol, Peggy; Niesink, Raymond

2016-08-01

The Netherlands has seen an increase in Δ9-tetrahydrocannabinol (THC) concentrations from approximately 8% in the 1990s up to 20% in 2004. Increased cannabis potency may lead to higher THC-exposure and cannabis related harm. The Dutch government officially condones the sale of cannabis from so called 'coffee shops', and the Opium Act distinguishes cannabis as a Schedule II drug with 'acceptable risk' from other drugs with 'unacceptable risk' (Schedule I). Even in 1976, however, cannabis potency was taken into account by distinguishing hemp oil as a Schedule I drug. In 2011, an advisory committee recommended tightening up legislation, leading to a 2013 bill proposing the reclassification of high potency cannabis products with a THC content of 15% or more as a Schedule I drug. The purpose of this measure was twofold: to reduce public health risks and to reduce illegal cultivation and export of cannabis by increasing punishment. This paper focuses on the public health aspects and describes the (explicit and implicit) assumptions underlying this '15% THC measure', as well as to what extent these are supported by scientific research. Based on scientific literature and other sources of information, we conclude that the 15% measure can provide in theory a slight health benefit for specific groups of cannabis users (i.e., frequent users preferring strong cannabis, purchasing from coffee shops, using 'steady quantities' and not changing their smoking behaviour), but certainly not for all cannabis users. These gains should be weighed against the investment in enforcement and the risk of unintended (adverse) effects. Given the many assumptions and uncertainty about the nature and extent of the expected buying and smoking behaviour changes, the measure is a political choice and based on thin evidence. Copyright © 2016 Springer. Published by Elsevier B.V. All rights reserved.

MO-E-BRD-03: Intra-Operative Breast Brachytherapy: Is One Stop Shopping Best? [Non-invasive Image-Guided Breast Brachytherapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Libby, B.

2015-06-15

Is Non-invasive Image-Guided Breast Brachytherapy Good? – Jess Hiatt, MS Non-invasive Image-Guided Breast Brachytherapy (NIBB) is an emerging therapy for breast boost treatments as well as Accelerated Partial Breast Irradiation (APBI) using HDR surface breast brachytherapy. NIBB allows for smaller treatment volumes while maintaining optimal target coverage. Considering the real-time image-guidance and immobilization provided by the NIBB modality, minimal margins around the target tissue are necessary. Accelerated Partial Breast Irradiation in brachytherapy: is shorter better? - Dorin Todor, PhD VCU A review of balloon and strut devices will be provided together with the origins of APBI: the interstitial multi-catheter implant.more » A dosimetric and radiobiological perspective will help point out the evolution in breast brachytherapy, both in terms of devices and the protocols/clinical trials under which these devices are used. Improvements in imaging, delivery modalities and convenience are among the factors driving the ultrashort fractionation schedules but our understanding of both local control and toxicities associated with various treatments is lagging. A comparison between various schedules, from a radiobiological perspective, will be given together with a critical analysis of the issues. to review and understand the evolution and development of APBI using brachytherapy methods to understand the basis and limitations of radio-biological ‘equivalence’ between fractionation schedules to review commonly used and proposed fractionation schedules Intra-operative breast brachytherapy: Is one stop shopping best?- Bruce Libby, PhD. University of Virginia A review of intraoperative breast brachytherapy will be presented, including the Targit-A and other trials that have used electronic brachytherapy. More modern approaches, in which the lumpectomy procedure is integrated into an APBI workflow, will also be discussed. Learning Objectives: To review past and current clinical trials for IORT To discuss lumpectomy-scan-plan-treat workflow for IORT.« less

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.

A meta-heuristic method for solving scheduling problem: crow search algorithm

NASA Astrophysics Data System (ADS)

Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

2018-04-01

Scheduling is one of the most important processes in an industry both in manufacturingand services. The scheduling process is the process of selecting resources to perform an operation on tasks. Resources can be machines, peoples, tasks, jobs or operations.. The selection of optimum sequence of jobs from a permutation is an essential issue in every research in scheduling problem. Optimum sequence becomes optimum solution to resolve scheduling problem. Scheduling problem becomes NP-hard problem since the number of job in the sequence is more than normal number can be processed by exact algorithm. In order to obtain optimum results, it needs a method with capability to solve complex scheduling problems in an acceptable time. Meta-heuristic is a method usually used to solve scheduling problem. The recently published method called Crow Search Algorithm (CSA) is adopted in this research to solve scheduling problem. CSA is an evolutionary meta-heuristic method which is based on the behavior in flocks of crow. The calculation result of CSA for solving scheduling problem is compared with other algorithms. From the comparison, it is found that CSA has better performance in term of optimum solution and time calculation than other algorithms.

Towards an understanding of Internet-based problem shopping behaviour: The concept of online shopping addiction and its proposed predictors

PubMed Central

ROSE, SUSAN; DHANDAYUDHAM, ARUN

2014-01-01

Background: Compulsive and addictive forms of consumption and buying behaviour have been researched in both business and medical literature. Shopping enabled via the Internet now introduces new features to the shopping experience that translate to positive benefits for the shopper. Evidence now suggests that this new shopping experience may lead to problematic online shopping behaviour. This paper provides a theoretical review of the literature relevant to online shopping addiction (OSA). Based on this selective review, a conceptual model of OSA is presented. Method: The selective review of the literature draws on searches within databases relevant to both clinical and consumer behaviour literature including EBSCO, ABI Pro-Quest, Web of Science – Social Citations Index, Medline, PsycINFO and Pubmed. The article reviews current thinking on problematic, and specifically addictive, behaviour in relation to online shopping. Results: The review of the literature enables the extension of existing knowledge into the Internet-context. A conceptual model of OSA is developed with theoretical support provided for the inclusion of 7 predictor variables: low self-esteem, low self-regulation; negative emotional state; enjoyment; female gender; social anonymity and cognitive overload. The construct of OSA is defined and six component criteria of OSA are proposed based on established technological addiction criteria. Conclusions: Current Internet-based shopping experiences may trigger problematic behaviours which can be classified on a spectrum which at the extreme end incorporates OSA. The development of a conceptual model provides a basis for the future measurement and testing of proposed predictor variables and the outcome variable OSA. PMID:25215218

Towards an understanding of Internet-based problem shopping behaviour: The concept of online shopping addiction and its proposed predictors.

PubMed

Rose, Susan; Dhandayudham, Arun

2014-06-01

Compulsive and addictive forms of consumption and buying behaviour have been researched in both business and medical literature. Shopping enabled via the Internet now introduces new features to the shopping experience that translate to positive benefits for the shopper. Evidence now suggests that this new shopping experience may lead to problematic online shopping behaviour. This paper provides a theoretical review of the literature relevant to online shopping addiction (OSA). Based on this selective review, a conceptual model of OSA is presented. The selective review of the literature draws on searches within databases relevant to both clinical and consumer behaviour literature including EBSCO, ABI Pro-Quest, Web of Science - Social Citations Index, Medline, PsycINFO and Pubmed. The article reviews current thinking on problematic, and specifically addictive, behaviour in relation to online shopping. The review of the literature enables the extension of existing knowledge into the Internet-context. A conceptual model of OSA is developed with theoretical support provided for the inclusion of 7 predictor variables: low self-esteem, low self-regulation; negative emotional state; enjoyment; female gender; social anonymity and cognitive overload. The construct of OSA is defined and six component criteria of OSA are proposed based on established technological addiction criteria. Current Internet-based shopping experiences may trigger problematic behaviours which can be classified on a spectrum which at the extreme end incorporates OSA. The development of a conceptual model provides a basis for the future measurement and testing of proposed predictor variables and the outcome variable OSA.

[The nutritional and dietary intake among community-dwelling elderly female users of mobile vendor vehicles].

PubMed

Yoshimura, Yukio; Ito, Hideki; Yoshimura, Hidenori; Kamada, Chiemi; Okumura, Ryota; Shinno, Yuki; Suzuki, Taro; Horie, Kazumi; Takaya, Koji; Omi, Hideaki

2018-01-01

We compared the nutritional and dietary intakes of users of mobile vendor vehicles and users of stores to clarify the problems in the nutritional intake of users of mobile vendor vehicles. We conducted a questionnaire about the food accessibility among 257 elderly women (age: ≥65 years) who used mobile vendor vehicles and/or stores to shop. The nutritional intake was assessed using the 24-hour recall method. We used an analysis of covariance (ANCOVA) to calculate the age-adjusted mean values for the total nutritional intake. The nutritional intake among users of mobile vendor vehicles included significantly lower intakes of energy (168 kcal), green vegetables, other vegetables, and meats. Furthermore, those who only shopped at mobile vendor vehicles consumed less energy and fewer nutrients than those who shopped at places other than mobile vendor vehicles. The comparison of the shopping frequency and nutritional intake of the subjects who used mobile vendor vehicles alone revealed that the energy and protein intakes of those who shopped once per week was significantly lower in comparison to those who shopped twice per week. Users of mobile vendor vehicles had lower intakes of macronutrients and various minerals and vitamins. Among the food groups, intakes of vegetables, meat, and dairy products were low. These findings suggest that the lack of means of shopping other than mobile vendor vehicles and shopping once per week may be associated with an inadequate dietary intake among users of mobile vendor vehicles. It would be desirable to develop the shopping environment is desirable.

Financial Irresponsibility: Background Information for Security Personnel

DTIC Science & Technology

1991-09-01

shoppers he has treated have also suffered from some eating disorder , usually bulimia .6 3 A study of Gamblers Anonymous members found that 52% also...ramifications--compulsive gambling, compulsive shopping, drug or alcohol abuse. Compulsive behavior is a form of emotional disorder in which one loses...financial problems, however, as this emotional disorder affects the wealthy as well as those with limited means. Like alcoholism, compulsive shopping

Software Reviews.

ERIC Educational Resources Information Center

Miller, Anne, Ed.; Radziemski, Cathy, Ed.

1988-01-01

Three pieces of computer software are described and reviewed: HyperCard, to build and use varied applications; Iggy's Gnees, for problem solving with shapes in grades kindergarten-two; and Algebra Shop, for practicing skills and problem solving. (MNS)

Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems

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.

Food Shopping and Acquisition Behaviors in Relation to BMI among Residents of Low-Income Communities in South Carolina.

PubMed

Liese, Angela D; Ma, Xiaonan; Hutto, Brent; Sharpe, Patricia A; Bell, Bethany A; Wilcox, Sara

2017-09-16

Low-income areas in which residents have poor access to healthy foods have been referred to as "food deserts." It is thought that improving food access may help curb the obesity epidemic. Little is known about where residents of food deserts shop and if shopping habits are associated with body mass index (BMI). We evaluated the association of food shopping and acquisition (e.g., obtaining food from church, food pantries, etc.) with BMI among 459 residents of low-income communities from two South Carolina counties, 81% of whom lived in United States Department of Agriculture-designated food deserts. Participants were interviewed about food shopping and acquisition and perceptions of their food environment, and weight and height were measured. Distances to food retail outlets were determined. Multivariable linear regression analysis was employed. Our study sample comprising largely African-American women had an average BMI of 32.5 kg/m². The vast majority of study participants shopped at supermarkets (61%) or supercenters/warehouse clubs (27%). Shopping at a supercenter or warehouse club as one's primary store was significantly associated with a 2.6 kg/m² higher BMI compared to shopping at a supermarket, independent of demographics, socioeconomics, physical activity, and all other food shopping/acquisition behaviors. Persons who reported shopping at a small grocery store or a convenience or dollar store as their tertiary store had a 2.6 kg/m² lower BMI. Respondents who perceived lack of access to adequate food shopping in their neighborhoods as a problem had higher BMI. Living in a food desert census tract was not significantly associated with BMI. Other shopping attributes, including distance to utilized and nearest grocery stores, were not independently associated with BMI. These findings call into question the idea that poor spatial access to grocery stores is a key underlying factor affecting the obesity epidemic. Future research should consider assessing foods purchased and dietary intake within a comprehensive study of food shopping behaviors and health outcomes among persons living in food deserts.

Food Shopping and Acquisition Behaviors in Relation to BMI among Residents of Low-Income Communities in South Carolina

PubMed Central

Liese, Angela D.; Ma, Xiaonan; Hutto, Brent; Sharpe, Patricia A.; Bell, Bethany A.; Wilcox, Sara

2017-01-01

Low-income areas in which residents have poor access to healthy foods have been referred to as “food deserts.” It is thought that improving food access may help curb the obesity epidemic. Little is known about where residents of food deserts shop and if shopping habits are associated with body mass index (BMI). We evaluated the association of food shopping and acquisition (e.g., obtaining food from church, food pantries, etc.) with BMI among 459 residents of low-income communities from two South Carolina counties, 81% of whom lived in United States Department of Agriculture-designated food deserts. Participants were interviewed about food shopping and acquisition and perceptions of their food environment, and weight and height were measured. Distances to food retail outlets were determined. Multivariable linear regression analysis was employed. Our study sample comprising largely African-American women had an average BMI of 32.5 kg/m2. The vast majority of study participants shopped at supermarkets (61%) or supercenters/warehouse clubs (27%). Shopping at a supercenter or warehouse club as one’s primary store was significantly associated with a 2.6 kg/m2 higher BMI compared to shopping at a supermarket, independent of demographics, socioeconomics, physical activity, and all other food shopping/acquisition behaviors. Persons who reported shopping at a small grocery store or a convenience or dollar store as their tertiary store had a 2.6 kg/m2 lower BMI. Respondents who perceived lack of access to adequate food shopping in their neighborhoods as a problem had higher BMI. Living in a food desert census tract was not significantly associated with BMI. Other shopping attributes, including distance to utilized and nearest grocery stores, were not independently associated with BMI. These findings call into question the idea that poor spatial access to grocery stores is a key underlying factor affecting the obesity epidemic. Future research should consider assessing foods purchased and dietary intake within a comprehensive study of food shopping behaviors and health outcomes among persons living in food deserts. PMID:28926937

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.

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).

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.

Starting and Managing a Retail Flower Shop. The Starting and Managing Series, Volume 18.

ERIC Educational Resources Information Center

Krone, Paul R.

This booklet is intended to give a general idea of what is required to set up and manage a flower shop, to point out some of the problems and rewards, and to tell where to find more detailed information. First, an overview of the business is provided, telling the background required in education and experience as well as the amount of profit that…

A Framework for Mining Actionable Navigation Patterns from In-Store RFID Datasets via Indoor Mapping

PubMed Central

Shen, Bin; Zheng, Qiuhua; Li, Xingsen; Xu, Libo

2015-01-01

With the quick development of RFID technology and the decreasing prices of RFID devices, RFID is becoming widely used in various intelligent services. Especially in the retail application domain, RFID is increasingly adopted to capture the shopping tracks and behavior of in-store customers. To further enhance the potential of this promising application, in this paper, we propose a unified framework for RFID-based path analytics, which uses both in-store shopping paths and RFID-based purchasing data to mine actionable navigation patterns. Four modules of this framework are discussed, which are: (1) mapping from the physical space to the cyber space, (2) data preprocessing, (3) pattern mining and (4) knowledge understanding and utilization. In the data preprocessing module, the critical problem of how to capture the mainstream shopping path sequences while wiping out unnecessary redundant and repeated details is addressed in detail. To solve this problem, two types of redundant patterns, i.e., loop repeat pattern and palindrome-contained pattern are recognized and the corresponding processing algorithms are proposed. The experimental results show that the redundant pattern filtering functions are effective and scalable. Overall, this work builds a bridge between indoor positioning and advanced data mining technologies, and provides a feasible way to study customers’ shopping behaviors via multi-source RFID data. PMID:25751076

Smuggling and cross border shopping of tobacco in Europe.

PubMed

Joossens, L; Raw, M

1995-05-27

Governments have recently become concerned about cross border shopping and smuggling because it can decrease tax revenue. The tobacco industry predicted that, with the removal of border controls in the European Union, price differences between neighbouring countries would lead to a diversion of tobacco trade, legally and illegally, to countries with cheaper cigarettes. According to them this diversion would be through increased cross border shopping for personal consumption or through increased smuggling of cheap cigarettes from countries with low tax to countries with high tax, where cigarettes are more expensive. These arguments have been used to urge governments not to increase tax on tobacco products. The evidence suggests, however, that cross border shopping is not yet a problem in Europe and that smuggling is not of cheap cigarettes to expensive countries. Instead, more expensive "international" brands are smuggled into northern Europe and sold illegally on the streets of the cheaper countries of southern Europe.

Smuggling and cross border shopping of tobacco in Europe.

PubMed Central

Joossens, L.; Raw, M.

1995-01-01

Governments have recently become concerned about cross border shopping and smuggling because it can decrease tax revenue. The tobacco industry predicted that, with the removal of border controls in the European Union, price differences between neighbouring countries would lead to a diversion of tobacco trade, legally and illegally, to countries with cheaper cigarettes. According to them this diversion would be through increased cross border shopping for personal consumption or through increased smuggling of cheap cigarettes from countries with low tax to countries with high tax, where cigarettes are more expensive. These arguments have been used to urge governments not to increase tax on tobacco products. The evidence suggests, however, that cross border shopping is not yet a problem in Europe and that smuggling is not of cheap cigarettes to expensive countries. Instead, more expensive "international" brands are smuggled into northern Europe and sold illegally on the streets of the cheaper countries of southern Europe. PMID:7787549

KSC-04pd1057

NASA Image and Video Library

2004-05-07

KENNEDY SPACE CENTER, FLA. -- In the Space Shuttle Main Engine Shop at KSC, Boeing Tech Operations’ Team Manager Matthew McClelland (left) talks with STS-114 Pilot James Kelly. At right are Mission Specialists Wendy Lawrence and Charles Camarda. One of the main engines is in the background. Crew members are touring several areas on Center. The STS-114 mission is Logistics Flight 1, which is scheduled to deliver supplies and equipment plus the external stowage platform to the International Space Station.

Scheduling a Medium-Sized Manufacturing Shop: A Simulation Study

DTIC Science & Technology

1993-09-01

distinction, elements of work order data include: the minimum machine type required for a work order, as well as the prgramming , set-up, and machining... prevent this from happening. Such a mechanism could take the form of a reprioritization function that is executed after a specified period of time...system for a very long time unless some mechanism is used to prevent this from happening. The jobs left in the system will be the ones that have very

KSC-04PD-1057

NASA Technical Reports Server (NTRS)

2004-01-01

KENNEDY SPACE CENTER, FLA. -- In the Space Shuttle Main Engine Shop at KSC, Boeing Tech Operations Team Manager Matthew McClelland (left) talks with STS-114 Pilot James Kelly. At right are Mission Specialists Wendy Lawrence and Charles Camarda. One of the main engines is in the background. Crew members are touring several areas on Center. The STS-114 mission is Logistics Flight 1, which is scheduled to deliver supplies and equipment plus the external stowage platform to the International Space Station.

Enhanced Critical Thinking Skills through Problem-Solving Games in Secondary Schools

ERIC Educational Resources Information Center

McDonald, Scott Douglas

2017-01-01

Aim/Purpose: Students face many challenges improving their soft skills such as critical thinking. This paper offers one possible solution to this problem. Background: This paper considers one method of enhancing critical thinking through a problem-solving game called the Coffee Shop. Problem-solving is a key component to critical thinking, and…

Noncontingent reinforcement without extinction plus differential reinforcement of alternative behavior during treatment of problem behavior.

PubMed

Fritz, Jennifer N; Jackson, Lynsey M; Stiefler, Nicole A; Wimberly, Barbara S; Richardson, Amy R

2017-07-01

The effects of noncontingent reinforcement (NCR) without extinction during treatment of problem behavior maintained by social positive reinforcement were evaluated for five individuals diagnosed with autism spectrum disorder. A continuous NCR schedule was gradually thinned to a fixed-time 5-min schedule. If problem behavior increased during NCR schedule thinning, a continuous NCR schedule was reinstated and NCR schedule thinning was repeated with differential reinforcement of alternative behavior (DRA) included. Results showed an immediate decrease in all participants' problem behavior during continuous NCR, and problem behavior maintained at low levels during NCR schedule thinning for three participants. Problem behavior increased and maintained at higher rates during NCR schedule thinning for two other participants; however, the addition of DRA to the intervention resulted in decreased problem behavior and increased mands. © 2017 Society for the Experimental Analysis of Behavior.

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.

NACA Lewis Researcher and Technicians Discuss a Test Setup

NASA Image and Video Library

1956-12-21

Researcher Bill Reiwaldt discusses the preparations for a test in the Altitude Wind Tunnel with technicians Jack Wagner and Dick Golladay at the National Advisory Committee for Aeronautics (NACA) Lewis Flight Propulsion Laboratory. Research engineers developed ideas for tests that were often in response to requests from the military or aircraft industry. Arrangements were made to obtain an engine for the study and to transport it to the Cleveland laboratory. The engine was brought into the facility’s shop area, where it was readied for investigation. It was common for several different engines to be worked on simultaneously in the shop. The researcher would discuss the engine and the test objectives with the Test Installation Division and the facility’s technicians. The operations team would handle the installation of the instrumentation and fitting the test into the facility’s schedule. Upon completion of the previous test, the engine was removed. The next engine was lifted by an overhead crane and transported from the shop to the test section. The engine was connected to the measurement devices and fuel and oil supply lines. Engines were tested over numerous runs under varying conditions and with variations on the configuration. The findings and test procedure were then described in research or technical memorandums and distributed to industry.

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.

Doctor shopping for medications used in the treatment of attention deficit hyperactivity disorder: shoppers often pay in cash and cross state lines.

PubMed

Cepeda, M Soledad; Fife, Daniel; Berwaerts, Joris; Friedman, Andrew; Yuan, Yingli; Mastrogiovanni, Greg

2015-05-01

Doctor shopping, defined by filling overlapping prescriptions from more than one prescriber at more than two pharmacies, is a way to obtain scheduled medications for diversion or abuse. Little is known about how far attention deficit hyperactivity disorder (ADHD) medication shoppers travel, how often they cross state lines to fill their ADHD prescriptions and how often they pay for their medication in cash, i.e. entirely out of pocket. We sought to describe the pattern of doctor shopping for ADHD medications: how far shoppers travel, how often they cross state lines to fill their prescriptions, and how often they pay in cash. Retrospective cohort study using LRx, a large US retail prescription database. We included subjects with any ADHD medication dispensed between 2011 and 2012. Subjects were followed for 18 months. Of a total of 4 402 464 subjects exposed to ADHD medications, 0.4% developed shopping behavior. Women were more likely to become shoppers. Shoppers travelled a median of 91.9 miles and non-shoppers 0.2 miles to fill their ADHD prescriptions. Almost 28% of the shoppers filled prescriptions in >1 state compared with 4.3% of non-shoppers. Of the shoppers, 27.3% paid at least one prescription in cash compared to 14.4% of the non-shoppers. Shoppers travelled larger distances, visited more states and paid in cash for ADHD medications more often than non-shoppers. Data sharing among prescriptions monitoring programs can improve their effectiveness and drug utilization studies should take account of cash purchases.

Performance, Life, and Operability Trade-Offs in VCE Control Logic Design.

DTIC Science & Technology

1981-08-01

primarily USAF Actuarial Reports), including all engine returns to the intermediate or depot shop - scheduled and unscheduled - engine and non-engine...Length (Min) Training * Air to Air (ATA) 30 576 87 e Air to Ground (ATG) 30 363 128 Combat e Air Superiority ( ASM ) 13 75 228 e Intercept 2 31 94... ASME , 16th Joint Propulsion Conference, Paper No. ALAA-80-1115, June 30 - July 2, 1980. 2. Akimov, V.M., Starik, D.E., et al., The Economic Efficiency

Linking search space structure, run-time dynamics, and problem difficulty : a step toward demystifying tabu search.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitley, L. Darrell; Howe, Adele E.; Watson, Jean-Paul

2004-09-01

Tabu search is one of the most effective heuristics for locating high-quality solutions to a diverse array of NP-hard combinatorial optimization problems. Despite the widespread success of tabu search, researchers have a poor understanding of many key theoretical aspects of this algorithm, including models of the high-level run-time dynamics and identification of those search space features that influence problem difficulty. We consider these questions in the context of the job-shop scheduling problem (JSP), a domain where tabu search algorithms have been shown to be remarkably effective. Previously, we demonstrated that the mean distance between random local optima and the nearestmore » optimal solution is highly correlated with problem difficulty for a well-known tabu search algorithm for the JSP introduced by Taillard. In this paper, we discuss various shortcomings of this measure and develop a new model of problem difficulty that corrects these deficiencies. We show that Taillard's algorithm can be modeled with high fidelity as a simple variant of a straightforward random walk. The random walk model accounts for nearly all of the variability in the cost required to locate both optimal and sub-optimal solutions to random JSPs, and provides an explanation for differences in the difficulty of random versus structured JSPs. Finally, we discuss and empirically substantiate two novel predictions regarding tabu search algorithm behavior. First, the method for constructing the initial solution is highly unlikely to impact the performance of tabu search. Second, tabu tenure should be selected to be as small as possible while simultaneously avoiding search stagnation; values larger than necessary lead to significant degradations in performance.« less

Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind

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 literature: The inability of a GA to properly improve schedules and the generation of schedules with frequent interruptions. Finally, we demonstrate the scheduling framework for several operating telescopes: (1) Dynamic re-scheduling with the AUT Warkworth 12m telescope, (2) Scheduling for the Australian Mopra 22m telescope and scheduling for the Allen Telescope Array. Furthermore, we discuss the applicability of the presented scheduling framework to the Atacama Large Millimeter/submillimeter Array (ALMA, in construction) and the SKA. In particular, during the development phase of the SKA, this dynamic, scalable scheduling framework can accommodate changing conditions.

The Bergen Shopping Addiction Scale: reliability and validity of a brief screening test.

PubMed

Andreassen, Cecilie S; Griffiths, Mark D; Pallesen, Ståle; Bilder, Robert M; Torsheim, Torbjørn; Aboujaoude, Elias

2015-01-01

Although excessive and compulsive shopping has been increasingly placed within the behavioral addiction paradigm in recent years, items in existing screens arguably do not assess the core criteria and components of addiction. To date, assessment screens for shopping disorders have primarily been rooted within the impulse-control or obsessive-compulsive disorder paradigms. Furthermore, existing screens use the terms 'shopping,' 'buying,' and 'spending' interchangeably, and do not necessarily reflect contemporary shopping habits. Consequently, a new screening tool for assessing shopping addiction was developed. Initially, 28 items, four for each of seven addiction criteria (salience, mood modification, conflict, tolerance, withdrawal, relapse, and problems), were constructed. These items and validated scales (i.e., Compulsive Buying Measurement Scale, Mini-International Personality Item Pool, Hospital Anxiety and Depression Scale, Rosenberg Self-Esteem Scale) were then administered to 23,537 participants (M age = 35.8 years, SD age = 13.3). The highest loading item from each set of four pooled items reflecting the seven addiction criteria were retained in the final scale, The Bergen Shopping Addiction Scale (BSAS). The factor structure of the BSAS was good (RMSEA = 0.064, CFI = 0.983, TLI = 0.973) and coefficient alpha was 0.87. The scores on the BSAS converged with scores on the Compulsive Buying Measurement Scale (CBMS; 0.80), and were positively correlated with extroversion and neuroticism, and negatively with conscientiousness, agreeableness, and intellect/imagination. The scores of the BSAS were positively associated with anxiety, depression, and low self-esteem and inversely related to age. Females scored higher than males on the BSAS. The BSAS is the first scale to fully embed shopping addiction within an addiction paradigm. A recommended cutoff score for the new scale and future research directions are discussed.

Doctor Shopping Behavior for Zolpidem Among Insomnia Patients in Taiwan: A Nationwide Population-Based Study

PubMed Central

Lu, Tzu-Hsuan; Lee, Yen-Ying; Lee, Hsin-Chien; Lin, You-Meei

2015-01-01

Objectives: Although zolpidem is listed as a controlled drug in Taiwan, patients' behavior has not been restricted and has led to the problem of doctor shopping behavior (DSB), leading to overutilization of medical resources and excess spending. The National Health Insurance Administration in Taiwan has instituted a new policy to regulate physicians' prescribing behavior and decrease DSB. This retrospective study aimed to analyze the DSB for zolpidem by insomnia patients and assess related factors. Design and Participants: Data were extracted from the Longitudinal Health Insurance Database in Taiwan. Individuals with a diagnosis of insomnia who received more than one prescription of zolpidem in 2008 were followed for 24 mo. Doctor shopping was defined as ≥ 2 prescriptions by different doctors within ≥ 1 day overlapping in the duration of therapy. The percentage of zolpidem obtained through doctor shopping was used as an indicator of the DSB of each patient. Results: Among the 6,947 insomnia patients who were prescribed zolpidem, 1,652 exhibited DSB (23.78%). The average dose of zolpidem dispensed for each patient during 24 mo was 244.21 daily defined doses. The doctor shopping indicator (DSI) was 0.20 (standard deviation, 0.23) among patients with DSB. Younger age, chronic diseases, high number of diseases, higher premium status, high socioeconomic status, and fewer people served per practicing physicians were all factors significantly related to doctor shopping behavior. Conclusion: Doctor shopping for zolpidem appears to be an important issue in Taiwan. Implementing a proper referral system with efficient data exchange by physician or pharmacist-led medication reconciliation process might reduce DSB. Citation: Lu TH, Lee YY, Lee HC, Lin YM. Doctor shopping behavior for zolpidem among insomnia patients in Taiwan: a nationwide population-based study. SLEEP 2015;38(7):1039–1044. PMID:25761979

The Bergen Shopping Addiction Scale: reliability and validity of a brief screening test

PubMed Central

Andreassen, Cecilie S.; Griffiths, Mark D.; Pallesen, Ståle; Bilder, Robert M.; Torsheim, Torbjørn; Aboujaoude, Elias

2015-01-01

Although excessive and compulsive shopping has been increasingly placed within the behavioral addiction paradigm in recent years, items in existing screens arguably do not assess the core criteria and components of addiction. To date, assessment screens for shopping disorders have primarily been rooted within the impulse-control or obsessive-compulsive disorder paradigms. Furthermore, existing screens use the terms ‘shopping,’ ‘buying,’ and ‘spending’ interchangeably, and do not necessarily reflect contemporary shopping habits. Consequently, a new screening tool for assessing shopping addiction was developed. Initially, 28 items, four for each of seven addiction criteria (salience, mood modification, conflict, tolerance, withdrawal, relapse, and problems), were constructed. These items and validated scales (i.e., Compulsive Buying Measurement Scale, Mini-International Personality Item Pool, Hospital Anxiety and Depression Scale, Rosenberg Self-Esteem Scale) were then administered to 23,537 participants (Mage = 35.8 years, SDage = 13.3). The highest loading item from each set of four pooled items reflecting the seven addiction criteria were retained in the final scale, The Bergen Shopping Addiction Scale (BSAS). The factor structure of the BSAS was good (RMSEA = 0.064, CFI = 0.983, TLI = 0.973) and coefficient alpha was 0.87. The scores on the BSAS converged with scores on the Compulsive Buying Measurement Scale (CBMS; 0.80), and were positively correlated with extroversion and neuroticism, and negatively with conscientiousness, agreeableness, and intellect/imagination. The scores of the BSAS were positively associated with anxiety, depression, and low self-esteem and inversely related to age. Females scored higher than males on the BSAS. The BSAS is the first scale to fully embed shopping addiction within an addiction paradigm. A recommended cutoff score for the new scale and future research directions are discussed. PMID:26441749

[Twisting and turning; the development of the Dutch science shops].

PubMed

Lursen, M; Mulder, H; Lieshout, M

2000-01-01

The concept of science shops (Wetenschapswinkels) originates from the Netherlands. Science shops were based on the idea that universities had to play a more prominent role in the solution of social problems - an outcome of the discussion, initiated by students, on the democratisation of universities in the early 1970s. Starting as voluntary student organisations supported by individual staff members from the universities, they were devoted to give oppressed minority groups and the financially weak access to scientific research. Slowly, acknowledgement came. Science shops began to receive financial support from university boards. Support also came from the Dutch government. By now science shops have professionalized and most of them are well embedded in their universities. Many developments within society and the universities influenced the work and structure of the science shops. Positive developments were professionalization, growth, becoming embedded, and the introduction of new research themes. There were also negative developments, such as budget cuts and the fact that 'service to society' ceased to be a government objective for the universities. These led to recurring struggles for survival, which were not always won. Interest in the science shop concept has grown in other countries over the last years. In the 1980s, the system spread within Western Europe. Similar activities, based on the Dutch model, have started in North America and Eastern Europe in the 1990s. The activities on the international level led to an E.U. financial project to prepare an international network of science shops, which commenced in 1999. With information exchange and international cooperation as its major goals, the network will create new opportunties for the future.

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.

Performance optimization of an online retailer by a unique online resilience engineering algorithm

NASA Astrophysics Data System (ADS)

Azadeh, A.; Salehi, V.; Salehi, R.; Hassani, S. M.

2018-03-01

Online shopping has become more attractive and competitive in electronic markets. Resilience engineering (RE) can help such systems divert to the normal state in case of encountering unexpected events. This study presents a unique online resilience engineering (ORE) approach for online shopping systems and customer service performance. Moreover, this study presents a new ORE algorithm for the performance optimisation of an actual online shopping system. The data are collected by standard questionnaires from both expert employees and customers. The problem is then formulated mathematically using data envelopment analysis (DEA). The results show that the design process which is based on ORE is more efficient than the conventional design approach. Moreover, on-time delivery is the most important factor from the personnel's perspective. In addition, according to customers' view, trust, security and good quality assurance are the most effective factors during transactions. This is the first study that introduces ORE for electronic markets. Second, it investigates impact of RE on online shopping through DEA and statistical methods. Third, a practical approach is employed in this study and it may be used for similar online shops. Fourth, the results are verified and validated through complete sensitivity analysis.

An Implicit Enumeration Algorithm with Binary-Valued Constraints.

DTIC Science & Technology

1986-03-01

problems is the National Basketball Association ( NBA -) schedul- ing problems developed by Bean (1980), as discussed in detail in the Appendix. These...fY! X F L- %n~ P ’ % -C-10 K7 K: K7 -L- -7".i - W. , W V APPENDIX The NBA Scheduling Problem §A.1 Formulation The National Basketball Association...16 2.2 4.9 40.2 15.14 §6.2.3 NBA Scheduling Problem The last set of testing problems involves the NBA scheduling problem. A detailed description of

Introducing rapid diagnostic tests for malaria into registered drug shops in Uganda: lessons learned and policy implications.

PubMed

Mbonye, Anthony K; Clarke, Sîan E; Lal, Sham; Chandler, Clare I; Hutchinson, Eleanor; Hansen, Kristian S; Magnussen, Pascal

2015-11-14

Malaria is a major public health problem in Uganda and the current policy recommends introduction of rapid diagnostic tests for malaria (RDTs) to facilitate effective case management. However, provision of RDTs in drug shops potentially raises a new set of issues, such as adherence to RDTs results, management of severe illnesses, referral of patients, and relationship with caretakers. The main objective of the study was to examine the impact of introducing RDTs in registered drug shops in Uganda and document lessons and policy implications for future scale-up of malaria control in the private health sector. A cluster-randomized trial introducing RDTs into registered drug shops was implemented in central Uganda from October 2010 to July 2012. An evaluation was undertaken to assess the impact and the processes involved with the introduction of RDTs into drug shops, the lessons learned and policy implications. Introducing RDTs into drug shops was feasible. To scale-up this intervention however, drug shop practices need to be regulated since the registration process was not clear, supervision was inadequate and record keeping was poor. Although initially it was anticipated that introducing a new practice of record keeping would be cumbersome, but at evaluation this was not found to be a constraint. This presents an important lesson for introducing health management information system into drug shops. Involving stakeholders, especially the district health team, in the design was important for ownership and sustainability. The involvement of village health teams in community sensitization to the new malaria treatment and diagnosis policy was a success and this strategy is recommended for future interventions. Introducing RDTs into drug shops was feasible and it increased appropriate treatment of malaria with artemisinin-based combination therapy. It is anticipated that the lessons presented will help better implementation of similar interventions in the private sector.

Doctor Shopping Behavior for Zolpidem Among Insomnia Patients in Taiwan: A Nationwide Population-Based Study.

PubMed

Lu, Tzu-Hsuan; Lee, Yen-Ying; Lee, Hsin-Chien; Lin, You-Meei

2015-07-01

Although zolpidem is listed as a controlled drug in Taiwan, patients' behavior has not been restricted and has led to the problem of doctor shopping behavior (DSB), leading to overutilization of medical resources and excess spending. The National Health Insurance Administration in Taiwan has instituted a new policy to regulate physicians' prescribing behavior and decrease DSB. This retrospective study aimed to analyze the DSB for zolpidem by insomnia patients and assess related factors. Data were extracted from the Longitudinal Health Insurance Database in Taiwan. Individuals with a diagnosis of insomnia who received more than one prescription of zolpidem in 2008 were followed for 24 mo. Doctor shopping was defined as ≥ 2 prescriptions by different doctors within ≥ 1 day overlapping in the duration of therapy. The percentage of zolpidem obtained through doctor shopping was used as an indicator of the DSB of each patient. Among the 6,947 insomnia patients who were prescribed zolpidem, 1,652 exhibited DSB (23.78%). The average dose of zolpidem dispensed for each patient during 24 mo was 244.21 daily defined doses. The doctor shopping indicator (DSI) was 0.20 (standard deviation, 0.23) among patients with DSB. Younger age, chronic diseases, high number of diseases, higher premium status, high socioeconomic status, and fewer people served per practicing physicians were all factors significantly related to doctor shopping behavior. Doctor shopping for zolpidem appears to be an important issue in Taiwan. Implementing a proper referral system with efficient data exchange by physician or pharmacist-led medication reconciliation process might reduce DSB. © 2015 Associated Professional Sleep Societies, LLC.

Compiling Planning into Scheduling: A Sketch

NASA Technical Reports Server (NTRS)

Bedrax-Weiss, Tania; Crawford, James M.; Smith, David E.

2004-01-01

Although there are many approaches for compiling a planning problem into a static CSP or a scheduling problem, current approaches essentially preserve the structure of the planning problem in the encoding. In this pape: we present a fundamentally different encoding that more accurately resembles a scheduling problem. We sketch the approach and argue, based on an example, that it is possible to automate the generation of such an encoding for problems with certain properties and thus produce a compiler of planning into scheduling problems. Furthermore we argue that many NASA problems exhibit these properties and that such a compiler would provide benefits to both theory and practice.

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.

A parent advice package for family shopping trips: development and evaluation1

PubMed Central

Clark, Hewitt B.; Greene, Brandon F.; Macrae, John W.; McNees, M. Patrick; Davis, Jerry L.; Risley, Todd R.

1977-01-01

This article reports on the primary steps in the development of parent advice for popular dissemination: (a) developing advice for one specific problem situation, family shopping trips; (b) testing the advice program for benefit to children and convenience to adults; and (c) packaging the advice so it can be used successfully by interested parents. Systematic observation of 12 families using the written advice package on shopping trips revealed its effectiveness in reducing child disruptions and increasing positive interactions between parents and children. These findings, along with interview information from families, showed that the package is usable, effective, and popular with both parents and children, and thus is ready for dissemination to a wide audience of parents—a step that in itself should involve research and evaluation. PMID:16795570

Interactive computer aided shift scheduling.

PubMed

Gaertner, J

2001-12-01

This paper starts with a discussion of computer aided shift scheduling. After a brief review of earlier approaches, two conceptualizations of this field are introduced: First, shift scheduling as a field that ranges from extremely stable rosters at one pole to rather market-like approaches on the other pole. Unfortunately, already small alterations of a scheduling problem (e.g., the number of groups, the number of shifts) may call for rather different approaches and tools. Second, their environment shapes scheduling problems and scheduling has to be done within idiosyncratic organizational settings. This calls for the amalgamation of scheduling with other tasks (e.g., accounting) and for reflections whether better solutions might become possible by changes in the problem definition (e.g., other service levels, organizational changes). Therefore shift scheduling should be understood as a highly connected problem. Building upon these two conceptualizations, a few examples of software that ease scheduling in some areas of this field are given and future research questions are outlined.

Alcoholic beverage server liability and the reduction of alcohol-related problems : evaluation of dram shop laws : final report

DOT National Transportation Integrated Search

1990-06-01

The project was an evaluation of the potential for the legal liability of alcoholic beverage servers to stimulate preventative serving practices and thus reduce alcohol-involved traffic problems. Legal analyses of judicial and legislative actions wit...

Alcoholic beverage server liability and the reduction of alcohol-related problems : evaluation of dram shop laws : summary report

DOT National Transportation Integrated Search

1990-06-01

The project was an evaluation of the potential for the legal liability of alcoholic beverage servers to stimulate preventative serving practices and thus reduce alcohol-involved traffic problems. Legal analyses of judicial and legislative actions wit...

Optimal recombination in genetic algorithms for flowshop scheduling problems

NASA Astrophysics Data System (ADS)

Kovalenko, Julia

2016-10-01

The optimal recombination problem consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We prove NP-hardness of the optimal recombination for various variants of the flowshop scheduling problem with makespan criterion and criterion of maximum lateness. An algorithm for solving the optimal recombination problem for permutation flowshop problems is built, using enumeration of prefect matchings in a special bipartite graph. The algorithm is adopted for the classical flowshop scheduling problem and for the no-wait flowshop problem. It is shown that the optimal recombination problem for the permutation flowshop scheduling problem is solvable in polynomial time for almost all pairs of parent solutions as the number of jobs tends to infinity.

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.

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.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kochin, I.V.; Belichenko, A.G.; Livshits, B.Ya.

Modern mechanical methods of coal processing involve crushing and the emission of coal dust in substantial amounts into the shop atmosphere, along with noise and vibration problems. Wet cleaning processes produce high humidity, while flotation involves the use of toxic reagents (alcohols, oils, kerosene). The air in flotation shops reaches humidities of 91 to 95% at 20.1 to 24.3/sup 0/C and contains 1.6 to 28.2 mg/m/sup 3/ of coal dust (with 1.4 to 7.9% SiO/sub 2/) and up to 600 mg/m/sup 3/ of kerosene vapors. The introduction of process improvements, automation, and mechanization brings about a correlated reduction in absenteeismmore » through illness. Automation in the flotation section has improved both technical and economic performance; the labor productivity index has risen by 40% and the ash of the tailings has increased by 10%, while the phenols content of the shop effluent and the concentration of kerosene vapors in the shop have decreased by factors of 6.5 and 3 respectively. The working conditions have been correspondingly improved. It is worthwhile and necessary to extend and improve the work of the medical-engineering team. This represents a novel form of collaboration between the medical services and the plant staff, to overcome health problems, control health and safety hazards and improve the health of the labor force. Reductions in man-hour losses from illness provide a major source of increased working time and labor productivity.« less

Solving a real-world problem using an evolving heuristically driven schedule builder.

PubMed

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.

Modelling Electrical Energy Consumption in Automotive Paint Shop

NASA Astrophysics Data System (ADS)

Oktaviandri, Muchamad; Safiee, Aidil Shafiza Bin

2018-03-01

Industry players are seeking ways to reduce operational cost to sustain in a challenging economic trend. One key aspect is an energy cost reduction. However, implementing energy reduction strategy often struggle with obstructions, which slow down their realization and implementation. Discrete event simulation method is an approach actively discussed in current research trend to overcome such obstructions because of its flexibility and comprehensiveness. Meanwhile, in automotive industry, paint shop is considered the most energy consumer area which is reported consuming about 50%-70% of overall automotive plant consumption. Hence, this project aims at providing a tool to model and simulate energy consumption at paint shop area by conducting a case study at XYZ Company, one of the automotive companies located at Pekan, Pahang. The simulation model was developed using Tecnomatix Plant Simulation software version 13. From the simulation result, the model was accurately within ±5% for energy consumption and ±15% for maximum demand after validation with real system. Two different energy saving scenarios were tested. Scenario 1 was based on production scheduling approach under low demand situation which results energy saving up to 30% on the consumption. Meanwhile scenario 2 was based on substituting high power compressor with the lower power compressor. The results were energy consumption saving of approximately 1.42% and maximum demand reduction about 1.27%. This approach would help managers and engineers to justify worthiness of investment for implementing the reduction strategies.

Testing Task Schedulers on Linux System

NASA Astrophysics Data System (ADS)

Jelenković, Leonardo; Groš, Stjepan; Jakobović, Domagoj

Testing task schedulers on Linux operating system proves to be a challenging task. There are two main problems. The first one is to identify which properties of the scheduler to test. The second problem is how to perform it, e.g., which API to use that is sufficiently precise and in the same time supported on most platforms. This paper discusses the problems in realizing test framework for testing task schedulers and presents one potential solution. Observed behavior of the scheduler is the one used for “normal” task scheduling (SCHED_OTHER), unlike one used for real-time tasks (SCHED_FIFO, SCHED_RR).

STS-95 Discovery in the VAB as launch preparations continue

NASA Technical Reports Server (NTRS)

1998-01-01

United Space Alliance Forward Shop workers stand near the orbiter Discovery in the Vehicle Assembly Building . The orbiter is being prepared for mating with the external tank. Discovery displays the recently painted NASA logo, termed the 'meatball,' on its left, or port, wing. The logo also has been painted on both sides of the aft fuselage. Discovery (OV-103), the first of the orbiters to be launched with the new art work, is scheduled for its 25th flight, from Launch Pad 39B, on Oct. 29, 1998, for the STS-95 mission.

KSC-98pc1070

NASA Image and Video Library

1998-09-14

United Space Alliance Forward Shop workers stand near the orbiter Discovery in the Vehicle Assembly Building . The orbiter is being prepared for mating with the external tank. Discovery displays the recently painted NASA logo, termed the "meatball," on its left, or port, wing. The logo also has been painted on both sides of the aft fuselage. Discovery (OV-103), the first of the orbiters to be launched with the new art work, is scheduled for its 25th flight, from Launch Pad 39B, on Oct. 29, 1998, for the STS-95 mission

The Small Retailer and His Problems

ERIC Educational Resources Information Center

Burstinger, Irving

1975-01-01

This study, through personal interviews, collected data on small retailers for three purposes: (1) to provide informative insights into small-scale retailing in New York City, (2) to explore retailers' opinions as to why customers shop at their stroes, and (3) to ascertain the more common problems experienced by retailers. (Author/BP)

101 Things You Can Do to Help Save Animals and Animal Habitats.

ERIC Educational Resources Information Center

Clearing, 1988

1988-01-01

The improper disposal of toxic or non-biodegradable wastes contributes to the problems of pollution, habitat destruction, and animal extinction. This list suggests ways that individuals can reduce their contribution to these problems in the home, yard, car, business, on vacation, and when shopping. (CW)

Sociodrama: Group Creative Problem Solving in Action.

ERIC Educational Resources Information Center

Riley, John F.

1990-01-01

Sociodrama is presented as a structured, yet flexible, method of encouraging the use of creative thinking to examine a difficult problem. An example illustrates the steps involved in putting sociodrama into action. Production techniques useful in sociodrama include the soliloquy, double, role reversal, magic shop, unity of opposites, and audience…

Teaching Math. Extending Problem Solving.

ERIC Educational Resources Information Center

May, Lola

1996-01-01

Describes four teaching activities to help children extend math problem-solving skills by using their own questions. Activities involve using a chart and symbols to develop equations adding up to 12, going on an imaginary shopping trip, using shapes to represent dollar amounts, using the date on a penny to engage in various mathematical…

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.

Aspects of job scheduling

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.

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.

Evaluation of scheduling techniques for payload activity planning

NASA Technical Reports Server (NTRS)

Bullington, Stanley F.

1991-01-01

Two tasks related to payload activity planning and scheduling were performed. The first task involved making a comparison of space mission activity scheduling problems with production scheduling problems. The second task consisted of a statistical analysis of the output of runs of the Experiment Scheduling Program (ESP). Details of the work which was performed on these two tasks are presented.

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.

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.

Allocation of surgical procedures to operating rooms.

PubMed

Ozkarahan, I

1995-08-01

Reduction of health care costs is of paramount importance in our time. This paper is a part of the research which proposes an expert hospital decision support system for resource scheduling. The proposed system combines mathematical programming, knowledge base, and database technologies, and what is more, its friendly interface is suitable for any novice user. Operating rooms in hospitals represent big investments and must be utilized efficiently. In this paper, first a mathematical model similar to job shop scheduling models is developed. The model loads surgical cases to operating rooms by maximizing room utilization and minimizing overtime in a multiple operating room setting. Then a prototype expert system which replaces the expertise of the operations research analyst for the model, drives the modelbase, database, and manages the user dialog is developed. Finally, an overview of the sequencing procedures for operations within an operating room is also presented.

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.

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.

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.

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

NASA Technical Reports Server (NTRS)

Chien, S.; Gratch, J.

1994-01-01

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

A New Lagrangian Relaxation Method Considering Previous Hour Scheduling for Unit Commitment Problem

NASA Astrophysics Data System (ADS)

Khorasani, H.; Rashidinejad, M.; Purakbari-Kasmaie, M.; Abdollahi, A.

2009-08-01

Generation scheduling is a crucial challenge in power systems especially under new environment of liberalization of electricity industry. A new Lagrangian relaxation method for unit commitment (UC) has been presented for solving generation scheduling problem. This paper focuses on the economical aspect of UC problem, while the previous hour scheduling as a very important issue is studied. In this paper generation scheduling of present hour has been conducted by considering the previous hour scheduling. The impacts of hot/cold start-up cost have been taken in to account in this paper. Case studies and numerical analysis presents significant outcomes while it demonstrates the effectiveness of the proposed method.

Production scheduling with ant colony optimization

NASA Astrophysics Data System (ADS)

Chernigovskiy, A. S.; Kapulin, D. V.; Noskova, E. E.; Yamskikh, T. N.; Tsarev, R. Yu

2017-10-01

The optimum solution of the production scheduling problem for manufacturing processes at an enterprise is crucial as it allows one to obtain the required amount of production within a specified time frame. Optimum production schedule can be found using a variety of optimization algorithms or scheduling algorithms. Ant colony optimization is one of well-known techniques to solve the global multi-objective optimization problem. In the article, the authors present a solution of the production scheduling problem by means of an ant colony optimization algorithm. A case study of the algorithm efficiency estimated against some others production scheduling algorithms is presented. Advantages of the ant colony optimization algorithm and its beneficial effect on the manufacturing process are provided.

Direct generation of event-timing equations for generalized flow shop systems

NASA Astrophysics Data System (ADS)

Doustmohammadi, Ali; Kamen, Edward W.

1995-11-01

Flow shop production lines are very common in manufacturing systems such as car assemblies, manufacturing of electronic circuits, etc. In this paper, a systematic procedure is given for generating event-timing equations directly from the machine interconnections for a generalized flow shop system. The events considered here correspond to completion times of machine operations. It is assumed that the scheduling policy is cyclic (periodic). For a given flow shop system, the open connection dynamics of the machines are derived first. Then interconnection matrices characterizing the routing of parts in the system are obtained from the given system configuration. The open connection dynamics of the machines and the interconnection matrices are then combined together to obtain the overall system dynamics given by an equation of the form X(k+1) equals A(k)X(k) B(k)V(k+1) defined over the max-plus algebra. Here the state X(k) is the vector of completion times and V(k+1) is an external input vector consisting of the arrival times of parts. It is shown that if the machines are numbered in an appropriate way and the states are selected according to certain rules, the matrix A(k) will be in a special (canonical) form. The model obtained here is useful or the analysis of system behavior and for carrying out simulations. In particular, the canonical form of A(k) enables one to study system bottlenecks and the minimal cycle time during steady-state operation. The approach presented in this paper is believed to be more straightforward compared to existing max-plus algebra formulations of flow shop systems. In particular, three advantages of the proposed approach are: (1) it yields timing equations directly from the system configuration and hence there is no need to first derive a Petri net or a digraph equivalent of the system; (2) a change in the system configuration only affects the interconnection matrices and hence does not require rederiving the entire set of equations; (3) the system model is easily put into code using existing software packages such as MATLAB.

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.

Preliminary Evaluation of BIM-based Approaches for Schedule Delay Analysis

NASA Astrophysics Data System (ADS)

Chou, Hui-Yu; Yang, Jyh-Bin

2017-10-01

The problem of schedule delay commonly occurs in construction projects. The quality of delay analysis depends on the availability of schedule-related information and delay evidence. More information used in delay analysis usually produces more accurate and fair analytical results. How to use innovative techniques to improve the quality of schedule delay analysis results have received much attention recently. As Building Information Modeling (BIM) technique has been quickly developed, using BIM and 4D simulation techniques have been proposed and implemented. Obvious benefits have been achieved especially in identifying and solving construction consequence problems in advance of construction. This study preforms an intensive literature review to discuss the problems encountered in schedule delay analysis and the possibility of using BIM as a tool in developing a BIM-based approach for schedule delay analysis. This study believes that most of the identified problems can be dealt with by BIM technique. Research results could be a fundamental of developing new approaches for resolving schedule delay disputes.

Household Everyday Functioning in the Internet Age: Online Shopping and Banking Skills Are Affected in HIV-Associated Neurocognitive Disorders.

PubMed

Woods, Steven Paul; Iudicello, Jennifer E; Morgan, Erin E; Verduzco, Marizela; Smith, Tyler V; Cushman, Clint

2017-08-01

The Internet is a fundamental tool for completing many different instrumental activities of daily living (IADL), including shopping and banking. Persons with HIV-associated Neurocognitive Disorders (HAND) are at heightened risk for IADL problems, but the extent to which HAND interferes with the performance of Internet-based household IADLs is not known. Ninety-three individuals with HIV disease, 43 of whom were diagnosed with HAND, and 42 HIV- comparison participants completed Internet-based tests of shopping and banking. Participants used mock credentials to log in to an experimenter-controlled Web site and independently performed a series of typical online shopping (e.g., purchasing household goods) and banking (e.g., transferring funds between accounts) tasks. Individuals with HAND were significantly more likely to fail the online shopping task than neurocognitively normal HIV+ and HIV- participants. HAND was also associated with poorer overall performance versus HIV+ normals on the online banking task. In the HAND group, Internet-based task scores were correlated with episodic memory, executive functions, motor skills, and numeracy. In the HIV+ sample as a whole, lower Internet-based task scores were uniquely associated with poorer performance-based functional capacity and self-reported declines in shopping and financial management in daily life, but not with global manifest functional status. Findings indicate that HAND is associated with difficulties in using the Internet to complete important household everyday functioning tasks. The development and validation of effective Internet training and compensatory strategies may help to improve the household management of persons with HAND. (JINS, 2017, 23, 605-615).

Production scheduling with discrete and renewable additional resources

NASA Astrophysics Data System (ADS)

Kalinowski, K.; Grabowik, C.; Paprocka, I.; Kempa, W.

2015-11-01

In this paper an approach to planning of additional resources when scheduling operations are discussed. The considered resources are assumed to be discrete and renewable. In most research in scheduling domain, the basic and often the only type of regarded resources is a workstation. It can be understood as a machine, a device or even as a separated space on the shop floor. In many cases, during the detailed scheduling of operations the need of using more than one resource, required for its implementation, can be indicated. Resource requirements for an operation may relate to different resources or resources of the same type. Additional resources are most often referred to these human resources, tools or equipment, for which the limited availability in the manufacturing system may have an influence on the execution dates of some operations. In the paper the concept of the division into basic and additional resources and their planning method was shown. A situation in which sets of basic and additional resources are not separable - the same additional resource may be a basic resource for another operation is also considered. Scheduling of operations, including greater amount of resources can cause many difficulties, depending on whether the resource is involved in the entire time of operation, only in the selected part(s) of operation (e.g. as auxiliary staff at setup time) or cyclic - e.g. when an operator supports more than one machine, or supervises the execution of several operations. For this reason the dates and work times of resources participation in the operation can be different. Presented issues are crucial when modelling of production scheduling environment and designing of structures for the purpose of scheduling software development.

Increasing Trends in Schedule II Opioid Use and Doctor Shopping during 1999–2007 in California

PubMed Central

Han, Huijun; Kass, Philip H.; Wilsey, Barth L.; Li, Chin-Shang

2013-01-01

Purpose To examine the age and gender-specific trends of schedule II opioid use among California residents, with special reference to multiple provider users (“doctor shoppers”). Methods Utilizing data from the California Prescription Drug Monitoring Program, we examined age and gender-specific trends of Schedule II opioid use during calendar years 1999–2007. Specifically, we analyzed: 1) the prevalence of Schedule II opioid users among California’s population, and 2) the proportion of these opioid users who were doctor shoppers (defined as an individual who used more than five different prescribers for all schedule II opioids he/she obtained in a calendar year). Results Among all age and gender groups, the prevalence of Schedule II opioid users in California increased by 150%–280% and the prevalence of doctor shoppers among users increased by 111%–213% over nine years. The prevalence of opioid users was lowest among 18–44 year-old males (1.25%) and highest among 65 years and older females (5.31%) by 2007. The prevalence of doctor shoppers was approximately 1.4% among those up to age 64 and 0.5% among those 65 years and older. The gender difference in doctor shoppers among all age groups was negligible. On average, the cumulative morphine-equivalent amount of Schedule II opioid per individual obtained per year was three- to six-fold higher for doctor shoppers than for the general population across different age and gender groups. Conclusions Age and gender differences in opioid use were relatively small, while the trends for use of opioids and multiple providers grew at a disquieting rate. PMID:23956137

2007 SB14 Source Reduction Plan/Report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chang, L

2007-07-24

Aqueous solutions (mixed waste) generated from various LLNL operations, such as debris washing, sample preparation and analysis, and equipment maintenance and cleanout, were combined for storage in the B695 tank farm. Prior to combination the individual waste streams had different codes depending on the particular generating process and waste characteristics. The largest streams were CWC 132, 791, 134, 792. Several smaller waste streams were also included. This combined waste stream was treated at LLNL's waste treatment facility using a vacuum filtration and cool vapor evaporation process in preparation for discharge to sanitary sewer. Prior to discharge, the treated waste streammore » was sampled and the results were reviewed by LLNL's water monitoring specialists. The treated solution was discharged following confirmation that it met the discharge criteria. A major source, accounting for 50% for this waste stream, is metal machining, cutting and grinding operations in the engineering machine shops in B321/B131. An additional 7% was from similar operations in B131 and B132S. This waste stream primarily contains metal cuttings from machined parts, machining coolant and water, with small amounts of tramp oil from the machining and grinding equipment. Several waste reduction measures for the B321 machine shop have been taken, including the use of a small point-of-use filtering/tramp-oil coalescing/UV-sterilization coolant recycling unit, and improved management techniques (testing and replenishing) for coolants. The recycling unit had some operational problems during 2006. The machine shop is planning to have it repaired in the near future. A major source, accounting for 50% for this waste stream, is metal machining, cutting and grinding operations in the engineering machine shops in B321/B131. An additional 7% was from similar operations in B131 and B132S. This waste stream primarily contains metal cuttings from machined parts, machining coolant and water, with small amounts of tramp oil from the machining and grinding equipment. Several waste reduction measures for the B321 machine shop have been taken, including the use of a small point-of-use filtering/tramp-oil coalescing/UV-sterilization coolant recycling unit, and improved management techniques (testing and replenishing) for coolants. The recycling unit had some operational problems during 2006. The machine shop is planning to have it repaired in the near future. Quarterly waste generation data prepared by the Environmental Protection Department's P2 Team are regularly provided to engineering shops as well as other facilities so that generators can track the effectiveness of their waste minimization efforts.« less

Further Evaluation of the Use of Multiple Schedules for Behavior Maintained by Negative Reinforcement.

PubMed

Campos, Claudia; Leon, Yanerys; Sleiman, Andressa; Urcuyo, Beatriz

2017-03-01

One potential limitation of functional communication training (FCT) is that after the functional communication response (FCR) is taught, the response may be emitted at high rates or inappropriate times. Thus, schedule thinning is often necessary. Previous research has demonstrated that multiple schedules can facilitate schedule thinning by establishing discriminative control of the communication response while maintaining low rates of problem behavior. To date, most applied research evaluating the clinical utility of multiple schedules has done so in the context of behavior maintained by positive reinforcement (e.g., attention or tangible items). This study examined the use of a multiple schedule with alternating Fixed Ratio (FR 1)/extinction (EXT) components for two individuals with developmental disabilities who emitted escape-maintained problem behavior. Although problem behavior remained low during all FCT and multiple schedule phases, the use of the multiple schedule alone did not result in discriminated manding.

Eldercare at Home: Problems of Daily Living

MedlinePlus

... as cooking, cleaning, doing the laundry, shopping, handling money, writing checks, driving, using public transportation, and using ... sure to attach the Velcro strips together when laundering the clothing or the Velcro will stick to ...

Simulating large-scale pedestrian movement using CA and event driven model: Methodology and case study

NASA Astrophysics Data System (ADS)

Li, Jun; Fu, Siyao; He, Haibo; Jia, Hongfei; Li, Yanzhong; Guo, Yi

2015-11-01

Large-scale regional evacuation is an important part of national security emergency response plan. Large commercial shopping area, as the typical service system, its emergency evacuation is one of the hot research topics. A systematic methodology based on Cellular Automata with the Dynamic Floor Field and event driven model has been proposed, and the methodology has been examined within context of a case study involving the evacuation within a commercial shopping mall. Pedestrians walking is based on Cellular Automata and event driven model. In this paper, the event driven model is adopted to simulate the pedestrian movement patterns, the simulation process is divided into normal situation and emergency evacuation. The model is composed of four layers: environment layer, customer layer, clerk layer and trajectory layer. For the simulation of movement route of pedestrians, the model takes into account purchase intention of customers and density of pedestrians. Based on evacuation model of Cellular Automata with Dynamic Floor Field and event driven model, we can reflect behavior characteristics of customers and clerks at the situations of normal and emergency evacuation. The distribution of individual evacuation time as a function of initial positions and the dynamics of the evacuation process is studied. Our results indicate that the evacuation model using the combination of Cellular Automata with Dynamic Floor Field and event driven scheduling can be used to simulate the evacuation of pedestrian flows in indoor areas with complicated surroundings and to investigate the layout of shopping mall.

Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multi-cell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Further, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

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.

An investigation of the use of temporal decomposition in space mission scheduling

NASA Technical Reports Server (NTRS)

Bullington, Stanley E.; Narayanan, Venkat

1994-01-01

This research involves an examination of techniques for solving scheduling problems in long-duration space missions. The mission timeline is broken up into several time segments, which are then scheduled incrementally. Three methods are presented for identifying the activities that are to be attempted within these segments. The first method is a mathematical model, which is presented primarily to illustrate the structure of the temporal decomposition problem. Since the mathematical model is bound to be computationally prohibitive for realistic problems, two heuristic assignment procedures are also presented. The first heuristic method is based on dispatching rules for activity selection, and the second heuristic assigns performances of a model evenly over timeline segments. These heuristics are tested using a sample Space Station mission and a Spacelab mission. The results are compared with those obtained by scheduling the missions without any problem decomposition. The applicability of this approach to large-scale mission scheduling problems is also discussed.

Analysis of Issues for Project Scheduling by Multiple, Dispersed Schedulers (distributed Scheduling) and Requirements for Manual Protocols and Computer-based Support

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.

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.

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.

Mask quality assessment

NASA Astrophysics Data System (ADS)

Regis, Larry; Paulson, Neil; Reynolds, James A.

1994-02-01

Product quality and timely delivery are two of the most important parameters, determining the success of a mask manufacturing facility. Because of the sensitivity of this data, however, very little is known about industry performance in these areas. Using Arthur Andersen & Co. to protect contributor identity, the authors have conducted a blind quality survey of mask shops which represents over 75% of the total merchant and captive mask volume in the US. Quantities such as return rate, plate survival yield, performance to schedule and reason for return were requested from 1988 through Q2 1993. Data is analyzed and conclusions are presented.

Genetic algorithm to solve the problems of lectures and practicums scheduling

NASA Astrophysics Data System (ADS)

Syahputra, M. F.; Apriani, R.; Sawaluddin; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.

2018-02-01

Generally, the scheduling process is done manually. However, this method has a low accuracy level, along with possibilities that a scheduled process collides with another scheduled process. When doing theory class and practicum timetable scheduling process, there are numerous problems, such as lecturer teaching schedule collision, schedule collision with another schedule, practicum lesson schedules that collides with theory class, and the number of classrooms available. In this research, genetic algorithm is implemented to perform theory class and practicum timetable scheduling process. The algorithm will be used to process the data containing lists of lecturers, courses, and class rooms, obtained from information technology department at University of Sumatera Utara. The result of scheduling process using genetic algorithm is the most optimal timetable that conforms to available time slots, class rooms, courses, and lecturer schedules.

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.

Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1995-01-01

A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.

Designing a fuzzy scheduler for hard real-time systems

NASA Technical Reports Server (NTRS)

Yen, John; Lee, Jonathan; Pfluger, Nathan; Natarajan, Swami

1992-01-01

In hard real-time systems, tasks have to be performed not only correctly, but also in a timely fashion. If timing constraints are not met, there might be severe consequences. Task scheduling is the most important problem in designing a hard real-time system, because the scheduling algorithm ensures that tasks meet their deadlines. However, the inherent nature of uncertainty in dynamic hard real-time systems increases the problems inherent in scheduling. In an effort to alleviate these problems, we have developed a fuzzy scheduler to facilitate searching for a feasible schedule. A set of fuzzy rules are proposed to guide the search. The situation we are trying to address is the performance of the system when no feasible solution can be found, and therefore, certain tasks will not be executed. We wish to limit the number of important tasks that are not scheduled.

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.

Improving Hospital-wide Patient Scheduling Decisions by Clinical Pathway Mining.

PubMed

Gartner, Daniel; Arnolds, Ines V; Nickel, Stefan

2015-01-01

Recent research has highlighted the need for solving hospital-wide patient scheduling problems. Inpatient scheduling, patient activities have to be scheduled on scarce hospital resources such that temporal relations between activities (e.g. for recovery times) are ensured. Common objectives are, among others, the minimization of the length of stay (LOS). In this paper, we consider a hospital-wide patient scheduling problem with LOS minimization based on uncertain clinical pathways. We approach the problem in three stages: First, we learn most likely clinical pathways using a sequential pattern mining approach. Second, we provide a mathematical model for patient scheduling and finally, we combine the two approaches. In an experimental study carried out using real-world data, we show that our approach outperforms baseline approaches on two metrics.

The Association between Food Security and Store-Specific and Overall Food Shopping Behaviors.

PubMed

Ma, Xiaonan; Liese, Angela D; Hibbert, James; Bell, Bethany A; Wilcox, Sara; Sharpe, Patricia A

2017-12-01

Food security is a severe problem in the United States. Few studies have examined its relationship with food shopping behaviors. This study aimed to examine the association between food security and store-specific and overall food shopping among residents of low-income neighborhoods. We conducted a cross-sectional study. Five hundred twenty-seven households were recruited from two counties in South Carolina from November 2013 to May 2014, and 474 households were included in the final analysis. Food security was assessed using the 18-item US-Household Food Security Module questionnaire, and classified into three categories: high or marginal food security (FS), low food security (LFS), and very low food security (VLFS). Store-specific shopping behaviors including frequency, store type, and transportation were queried via in-person interview for the three most-frequented grocery stores. Distance from participants' homes to their reported stores was calculated using Geographic Information Systems. Multivariate linear regression for analyses of distance and frequency and multinomial/ordinary logistic regression for analyses of store type and transportation were used. Compared to FS participants, a significantly higher proportion of VLFS participants reported a convenience/dollar store as their most-frequented store (odds ratio [OR] 2.31, 95% CI 1.08 to 4.95) or a lack of transportation (OR 2.04, 95% CI 1.25 to 3.33). They also shopped less frequently (b=-.31, P=0.03) at their third most-frequented store and traveled fewer total miles for shopping (b=-4.71, P=0.04). In analyses considering all stores jointly, LFS participants had lower odds of shopping at both supermarkets and convenience/dollar stores (OR 0.44, 95% CI 0.21 to 0.91) compared to food-secure residents. The current findings suggest that households with VLFS tend to shop more frequently in stores that have less-healthful options, such as convenience/dollar stores. These findings lend support to ongoing community and policy interventions aimed at improving food access among food-insecure populations. Copyright © 2017 Academy of Nutrition and Dietetics. Published by Elsevier Inc. All rights reserved.

A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.

PubMed

Wang, Zhaocai; Ji, Zuwen; Wang, Xiaoming; Wu, Tunhua; Huang, Wei

2017-12-01

As a promising approach to solve the computationally intractable problem, the method based on DNA computing is an emerging research area including mathematics, computer science and molecular biology. The task scheduling problem, as a well-known NP-complete problem, arranges n jobs to m individuals and finds the minimum execution time of last finished individual. In this paper, we use a biologically inspired computational model and describe a new parallel algorithm to solve the task scheduling problem by basic DNA molecular operations. In turn, we skillfully design flexible length DNA strands to represent elements of the allocation matrix, take appropriate biological experiment operations and get solutions of the task scheduling problem in proper length range with less than O(n 2 ) time complexity. Copyright © 2017. Published by Elsevier B.V.

Comprehensive Evaluation and Implementation of Improvement Actions in Butcher Shops

PubMed Central

Leotta, Gerardo A.; Brusa, Victoria; Galli, Lucía; Adriani, Cristian; Linares, Luciano; Etcheverría, Analía; Sanz, Marcelo; Sucari, Adriana; Peral García, Pilar; Signorini, Marcelo

2016-01-01

Foodborne pathogens can cause acute and chronic diseases and produce a wide range of symptoms. Since the consumption of ground beef is a risk factor for infections with some bacterial pathogens, we performed a comprehensive evaluation of butcher shops, implemented improvement actions for both butcher shops and consumers, and verified the impact of those actions implemented. A comprehensive evaluation was made and risk was quantified on a 1–100 scale as high-risk (1–40), moderate-risk (41–70) or low-risk (71–100). A total of 172 raw ground beef and 672 environmental samples were collected from 86 butcher shops during the evaluation (2010–2011) and verification (2013) stages of the study. Ground beef samples were analyzed for mesophilic aerobic organisms, Escherichia coli and coagulase-positive Staphylococcus aureus enumeration. Salmonella spp., E. coli O157:H7, non-O157 Shiga toxin-producing E. coli (STEC), and Listeria monocytogenes were detected and isolated from all samples. Risk quantification resulted in 43 (50.0%) high-risk, 34 (39.5%) moderate-risk, and nine (10.5%) low-risk butcher shops. Training sessions for 498 handlers and 4,506 consumers were held. Re-evaluation by risk quantification and microbiological analyses resulted in 19 (22.1%) high-risk, 42 (48.8%) moderate-risk and 25 (29.1%) low-risk butcher shops. The count of indicator microorganisms decreased with respect to the 2010–2011 period. After the implementation of improvement actions, the presence of L. monocytogenes, E. coli O157:H7 and stx genes in ground beef decreased. Salmonella spp. was isolated from 10 (11.6%) ground beef samples, without detecting statistically significant differences between both study periods (evaluation and verification). The percentage of pathogens in environmental samples was reduced in the verification period (Salmonella spp., 1.5%; L. monocytogenes, 10.7%; E. coli O157:H7, 0.6%; non-O157 STEC, 6.8%). Risk quantification was useful to identify those relevant facts in butcher shops. The reduction of contamination in ground beef and the environment was possible after training handlers based on the problems identified in their own butcher shops. Our results confirm the feasibility of implementing a comprehensive risk management program in butcher shops, and the importance of information campaigns targeting consumers. Further collaborative efforts would be necessary to improve foodstuffs safety at retail level and at home. PMID:27618439

Comprehensive Evaluation and Implementation of Improvement Actions in Butcher Shops.

PubMed

Leotta, Gerardo A; Brusa, Victoria; Galli, Lucía; Adriani, Cristian; Linares, Luciano; Etcheverría, Analía; Sanz, Marcelo; Sucari, Adriana; Peral García, Pilar; Signorini, Marcelo

2016-01-01

Foodborne pathogens can cause acute and chronic diseases and produce a wide range of symptoms. Since the consumption of ground beef is a risk factor for infections with some bacterial pathogens, we performed a comprehensive evaluation of butcher shops, implemented improvement actions for both butcher shops and consumers, and verified the impact of those actions implemented. A comprehensive evaluation was made and risk was quantified on a 1-100 scale as high-risk (1-40), moderate-risk (41-70) or low-risk (71-100). A total of 172 raw ground beef and 672 environmental samples were collected from 86 butcher shops during the evaluation (2010-2011) and verification (2013) stages of the study. Ground beef samples were analyzed for mesophilic aerobic organisms, Escherichia coli and coagulase-positive Staphylococcus aureus enumeration. Salmonella spp., E. coli O157:H7, non-O157 Shiga toxin-producing E. coli (STEC), and Listeria monocytogenes were detected and isolated from all samples. Risk quantification resulted in 43 (50.0%) high-risk, 34 (39.5%) moderate-risk, and nine (10.5%) low-risk butcher shops. Training sessions for 498 handlers and 4,506 consumers were held. Re-evaluation by risk quantification and microbiological analyses resulted in 19 (22.1%) high-risk, 42 (48.8%) moderate-risk and 25 (29.1%) low-risk butcher shops. The count of indicator microorganisms decreased with respect to the 2010-2011 period. After the implementation of improvement actions, the presence of L. monocytogenes, E. coli O157:H7 and stx genes in ground beef decreased. Salmonella spp. was isolated from 10 (11.6%) ground beef samples, without detecting statistically significant differences between both study periods (evaluation and verification). The percentage of pathogens in environmental samples was reduced in the verification period (Salmonella spp., 1.5%; L. monocytogenes, 10.7%; E. coli O157:H7, 0.6%; non-O157 STEC, 6.8%). Risk quantification was useful to identify those relevant facts in butcher shops. The reduction of contamination in ground beef and the environment was possible after training handlers based on the problems identified in their own butcher shops. Our results confirm the feasibility of implementing a comprehensive risk management program in butcher shops, and the importance of information campaigns targeting consumers. Further collaborative efforts would be necessary to improve foodstuffs safety at retail level and at home.

A hybrid online scheduling mechanism with revision and progressive techniques for autonomous Earth observation satellite

NASA Astrophysics Data System (ADS)

Li, Guoliang; Xing, Lining; Chen, Yingwu

2017-11-01

The autonomicity of self-scheduling on Earth observation satellite and the increasing scale of satellite network attract much attention from researchers in the last decades. In reality, the limited onboard computational resource presents challenge for the online scheduling algorithm. This study considered online scheduling problem for a single autonomous Earth observation satellite within satellite network environment. It especially addressed that the urgent tasks arrive stochastically during the scheduling horizon. We described the problem and proposed a hybrid online scheduling mechanism with revision and progressive techniques to solve this problem. The mechanism includes two decision policies, a when-to-schedule policy combining periodic scheduling and critical cumulative number-based event-driven rescheduling, and a how-to-schedule policy combining progressive and revision approaches to accommodate two categories of task: normal tasks and urgent tasks. Thus, we developed two heuristic (re)scheduling algorithms and compared them with other generally used techniques. Computational experiments indicated that the into-scheduling percentage of urgent tasks in the proposed mechanism is much higher than that in periodic scheduling mechanism, and the specific performance is highly dependent on some mechanism-relevant and task-relevant factors. For the online scheduling, the modified weighted shortest imaging time first and dynamic profit system benefit heuristics outperformed the others on total profit and the percentage of successfully scheduled urgent tasks.

Smart sign ordering system : executive summary report.

DOT National Transportation Integrated Search

2004-05-01

Problem: The districts submit sign orders to the Sign Shop, : where all approved orders are processed in : production planning, fabrication, and subsequent : shipping. Due to lack of data automation and : efficient means of data exchange and manageme...

Aging Parents: 7 Warning Signs of Health Problems

MedlinePlus

... or smell as good as it used to. Social issues. Your parents might have difficulty shopping or have ... 27, 2017. Tomioka K, et al. Association between social participation and ... 2018. Dec. 13, 2017 Original article: http://www. ...

On salesmen and tourists: Two-step optimization in deterministic foragers

NASA Astrophysics Data System (ADS)

Maya, Miguel; Miramontes, Octavio; Boyer, Denis

2017-02-01

We explore a two-step optimization problem in random environments, the so-called restaurant-coffee shop problem, where a walker aims at visiting the nearest and better restaurant in an area and then move to the nearest and better coffee-shop. This is an extension of the Tourist Problem, a one-step optimization dynamics that can be viewed as a deterministic walk in a random medium. A certain amount of heterogeneity in the values of the resources to be visited causes the emergence of power-laws distributions for the steps performed by the walker, similarly to a Lévy flight. The fluctuations of the step lengths tend to decrease as a consequence of multiple-step planning, thus reducing the foraging uncertainty. We find that the first and second steps of each planned movement play very different roles in heterogeneous environments. The two-step process improves only slightly the foraging efficiency compared to the one-step optimization, at a much higher computational cost. We discuss the implications of these findings for animal and human mobility, in particular in relation to the computational effort that informed agents should deploy to solve search problems.

Investigations into Generalization of Constraint-Based Scheduling Theories with Applications to Space Telescope Observation Scheduling

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.

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.

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.

From 'solution shop' model to 'focused factory' in hospital surgery: increasing care value and predictability.

PubMed

Cook, David; Thompson, Jeffrey E; Habermann, Elizabeth B; Visscher, Sue L; Dearani, Joseph A; Roger, Veronique L; Borah, Bijan J

2014-05-01

The full-service US hospital has been described organizationally as a "solution shop," in which medical problems are assumed to be unstructured and to require expert physicians to determine each course of care. If universally applied, this model contributes to unwarranted variation in care, which leads to lower quality and higher costs. We purposely disrupted the adult cardiac surgical practice that we led at Mayo Clinic, in Rochester, Minnesota, by creating a "focused factory" model (characterized by a uniform approach to delivering a limited set of high-quality products) within the practice's solution shop. Key elements of implementing the new model were mapping the care process, segmenting the patient population, using information technology to communicate clearly defined expectations, and empowering nonphysician providers at the bedside. Using a set of criteria, we determined that the focused-factory model was appropriate for 67 percent of cardiac surgical patients. We found that implementation of the model reduced resource use, length-of-stay, and cost. Variation was markedly reduced, and outcomes were improved. Assigning patients to different care models increases care value and the predictability of care process, outcomes, and costs while preserving (in a lesser clinical footprint) the strengths of the solution shop. We conclude that creating a focused-factory model within a solution shop, by applying industrial engineering principles and health information technology tools and changing the model of work, is very effective in both improving quality and reducing costs.

What work schedule characteristics constitute a problem to the individual? A representative study of Swedish shift workers.

PubMed

Åkerstedt, Torbjörn; Kecklund, Göran

2017-03-01

The purpose was to investigate which detailed characteristics of shift schedules that are seen as problems to those exposed. A representative national sample of non-day workers (N = 2031) in Sweden was asked whether they had each of a number of particular work schedule characteristics and, if yes, to what extent this constituted a "big problem in life". It was also inquired whether the individual's work schedules had negative consequences for fatigue, sleep and social life. The characteristic with the highest percentage reporting a big problem was "short notice (<1 month) of a new work schedule" (30.5%), <11 h off between shifts (27.8%), and split duty (>1.5 h break at mid-shift, 27.2%). Overtime (>10 h/week), night work, morning work, day/night shifts showed lower prevalences of being a "big problem". Women indicated more problems in general. Short notice was mainly related to negative social effects, while <11 h off between shifts was related to disturbed sleep, fatigue and social difficulties. It was concluded that schedules involving unpredictable working hours (short notice), short daily rest between shifts, and split duty shifts constitute big problems. The results challenge current views of what aspects of shift work need improvement, and negative social consequences seem more important than those related to health. Copyright © 2016 Elsevier Ltd. All rights reserved.

Service-Oriented Node Scheduling Scheme for Wireless Sensor Networks Using Markov Random Field Model

PubMed Central

Cheng, Hongju; Su, Zhihuang; Lloret, Jaime; Chen, Guolong

2014-01-01

Future wireless sensor networks are expected to provide various sensing services and energy efficiency is one of the most important criterions. The node scheduling strategy aims to increase network lifetime by selecting a set of sensor nodes to provide the required sensing services in a periodic manner. In this paper, we are concerned with the service-oriented node scheduling problem to provide multiple sensing services while maximizing the network lifetime. We firstly introduce how to model the data correlation for different services by using Markov Random Field (MRF) model. Secondly, we formulate the service-oriented node scheduling issue into three different problems, namely, the multi-service data denoising problem which aims at minimizing the noise level of sensed data, the representative node selection problem concerning with selecting a number of active nodes while determining the services they provide, and the multi-service node scheduling problem which aims at maximizing the network lifetime. Thirdly, we propose a Multi-service Data Denoising (MDD) algorithm, a novel multi-service Representative node Selection and service Determination (RSD) algorithm, and a novel MRF-based Multi-service Node Scheduling (MMNS) scheme to solve the above three problems respectively. Finally, extensive experiments demonstrate that the proposed scheme efficiently extends the network lifetime. PMID:25384005

A bicriteria heuristic for an elective surgery scheduling problem.

PubMed

Marques, Inês; Captivo, M Eugénia; Vaz Pato, Margarida

2015-09-01

Resource rationalization and reduction of waiting lists for surgery are two main guidelines for hospital units outlined in the Portuguese National Health Plan. This work is dedicated to an elective surgery scheduling problem arising in a Lisbon public hospital. In order to increase the surgical suite's efficiency and to reduce the waiting lists for surgery, two objectives are considered: maximize surgical suite occupation and maximize the number of surgeries scheduled. This elective surgery scheduling problem consists of assigning an intervention date, an operating room and a starting time for elective surgeries selected from the hospital waiting list. Accordingly, a bicriteria surgery scheduling problem arising in the hospital under study is presented. To search for efficient solutions of the bicriteria optimization problem, the minimization of a weighted Chebyshev distance to a reference point is used. A constructive and improvement heuristic procedure specially designed to address the objectives of the problem is developed and results of computational experiments obtained with empirical data from the hospital are presented. This study shows that by using the bicriteria approach presented here it is possible to build surgical plans with very good performance levels. This method can be used within an interactive approach with the decision maker. It can also be easily adapted to other hospitals with similar scheduling conditions.

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.

Paint shop, coach shop, car shop, and blacksmith shop (all ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

Paint shop, coach shop, car shop, and blacksmith shop (all car department), all north of the roadhouse and locomotive shops. Photographed between 1880 and 1888 - Chicago, Burlington & Quincy Railroad, Roundhouse & Shops, Broadway & Spring Streets, Aurora, Kane County, IL

Competitive Facility Location with Random Demands

NASA Astrophysics Data System (ADS)

Uno, Takeshi; Katagiri, Hideki; Kato, Kosuke

2009-10-01

This paper proposes a new location problem of competitive facilities, e.g. shops and stores, with uncertain demands in the plane. By representing the demands for facilities as random variables, the location problem is formulated to a stochastic programming problem, and for finding its solution, three deterministic programming problems: expectation maximizing problem, probability maximizing problem, and satisfying level maximizing problem are considered. After showing that one of their optimal solutions can be found by solving 0-1 programming problems, their solution method is proposed by improving the tabu search algorithm with strategic vibration. Efficiency of the solution method is shown by applying to numerical examples of the facility location problems.

Optimizing an F-16 Squadron Weekly Pilot Schedule for the Turkish Air Force

DTIC Science & Technology

2010-03-01

disrupted schedules are rescheduled , minimizing the total number of changes with respect to the previous schedule’s objective function. Output...producing rosters for a nursing staff in a large general hospital (Dowsland, 1998) and afterwards Aickelin and Dowsland use an Indirect Genetic...algorithm to improve the solutions of the nurse scheduling problem which is similar to the fighter squadron pilot scheduling problem (Aickelin and

Multi-trip vehicle routing and scheduling problem with time window in real life

NASA Astrophysics Data System (ADS)

Sze, San-Nah; Chiew, Kang-Leng; Sze, Jeeu-Fong

2012-09-01

This paper studies a manpower scheduling problem with multiple maintenance operations and vehicle routing considerations. Service teams located at a common service centre are required to travel to different customer sites. All customers must be served within given time window, which are known in advance. The scheduling process must take into consideration complex constraints such as a meal break during the team's shift, multiple travelling trips, synchronisation of service teams and working shifts. The main objective of this study is to develop a heuristic that can generate high quality solution in short time for large problem instances. A Two-stage Scheduling Heuristic is developed for different variants of the problem. Empirical results show that the proposed solution performs effectively and efficiently. In addition, our proposed approximation algorithm is very flexible and can be easily adapted to different scheduling environments and operational requirements.

Scheduling language and algorithm development study. Volume 1, phase 2: Design considerations for a scheduling and resource allocation system

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.

Globalization causes a world of health problems.

PubMed

Abell, H

1998-01-01

Many countries in Asia, Africa, Latin America, and the Caribbean offer substantial tax breaks to foreign corporations that set up shops in free-trade zones and waive environmental regulations and repress trade unions to further induce this practice. Workers in these shops--mainly women--perform repetitive machine-based motions, are exposed to toxic chemicals and unsafe equipment, and face dangerously high production quotas. Health problems caused by these working conditions include headache and dizziness, fatigue, anemia, forgetfulness, stomach pains, respiratory problems, hypertension, heart disease, and allergies. Water and air pollution and dumping of hazardous waste affect the health of entire communities. Since free-trade zones are a permanent feature of the global economy, organizing to protect workers and communities assumes critical importance. Groups such as the Border Committee of Women Workers in Mexico are providing workers with skills and support to make demands such as better treatment of pregnant workers. International labor, environmental, and public health advocates can support such efforts by providing assistance to worker-controlled organizations and pressuring governments to enforce laws intended to protect workers and their communities.

Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects.

PubMed

Yue, Lei; Guan, Zailin; Saif, Ullah; Zhang, Fei; Wang, Hao

2016-01-01

Group scheduling is significant for efficient and cost effective production system. However, there exist setup times between the groups, which require to decrease it by sequencing groups in an efficient way. Current research is focused on a sequence dependent group scheduling problem with an aim to minimize the makespan in addition to minimize the total weighted tardiness simultaneously. In most of the production scheduling problems, the processing time of jobs is assumed as fixed. However, the actual processing time of jobs may be reduced due to "learning effect". The integration of sequence dependent group scheduling problem with learning effects has been rarely considered in literature. Therefore, current research considers a single machine group scheduling problem with sequence dependent setup times and learning effects simultaneously. A novel hybrid Pareto artificial bee colony algorithm (HPABC) with some steps of genetic algorithm is proposed for current problem to get Pareto solutions. Furthermore, five different sizes of test problems (small, small medium, medium, large medium, large) are tested using proposed HPABC. Taguchi method is used to tune the effective parameters of the proposed HPABC for each problem category. The performance of HPABC is compared with three famous multi objective optimization algorithms, improved strength Pareto evolutionary algorithm (SPEA2), non-dominated sorting genetic algorithm II (NSGAII) and particle swarm optimization algorithm (PSO). Results indicate that HPABC outperforms SPEA2, NSGAII and PSO and gives better Pareto optimal solutions in terms of diversity and quality for almost all the instances of the different sizes of problems.

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.

Decomposition of timed automata for solving scheduling problems

NASA Astrophysics Data System (ADS)

Nishi, Tatsushi; Wakatake, Masato

2014-03-01

A decomposition algorithm for scheduling problems based on timed automata (TA) model is proposed. The problem is represented as an optimal state transition problem for TA. The model comprises of the parallel composition of submodels such as jobs and resources. The procedure of the proposed methodology can be divided into two steps. The first step is to decompose the TA model into several submodels by using decomposable condition. The second step is to combine individual solution of subproblems for the decomposed submodels by the penalty function method. A feasible solution for the entire model is derived through the iterated computation of solving the subproblem for each submodel. The proposed methodology is applied to solve flowshop and jobshop scheduling problems. Computational experiments demonstrate the effectiveness of the proposed algorithm compared with a conventional TA scheduling algorithm without decomposition.

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.

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.

Contingency rescheduling of spacecraft operations

NASA Technical Reports Server (NTRS)

Britt, Daniel L.; Geoffroy, Amy L.; Gohring, John R.

1988-01-01

Spacecraft activity scheduling was a focus of attention in artificial intelligence recently. Several scheduling systems were devised which more-or-less successfully address various aspects of the activity scheduling problem, though most of these are not yet mature, with the notable expection of NASA's ESP. Few current scheduling systems, however, make any attempt to deal fully with the problem of modifying a schedule in near-real-time in the event of contingencies which may arise during schedule execution. These contingencies can include resources becoming unavailable unpredictably, a change in spacecraft conditions or environment, or the need to perform an activity not scheduled. In these cases it becomes necessary to repair an existing schedule, disrupting ongoing operations as little as possible. Normal scheduling is just a part of that which must be accomplished during contingency rescheduling. A prototype system named MAESTRO was developed for spacecraft activity scheduling. MAESTRO is briefly described with a focus on recent work in the area of real-time contingency handling. Included is a discussion of some of the complexities of the scheduling problem and how they affect contingency rescheduling, such as temporal constraints between activities, activities which may be interrupted and continued in any of several ways, and different ways to choose a resource complement which will allow continuation of an activity. Various heuristics used in MAESTRO for contingency rescheduling is discussed, as are operational concerns such as interaction of the scheduler with spacecraft subsystems controllers.

Structural investigation of websites of selected educational hospitals of Shiraz University of Medical Sciences from Patient Relationship Management (PRM) perspective.

PubMed

Bakhshi, Mahdieh; Monem, Hossein; Barati, Omid; Sharifian, Roxana; Nematollahi, Mohtaram

2017-07-01

Hospital websites are considered as an appropriate system for exchanging information and establishing communication between patients, hospitals, and medical staff. Website character, website contact interactivity, shopping convenience, as well as care and service are the factors that the present study investigated as far as the patient relationship management is concerned. This descriptive-analytical study was conducted on 206 patients visiting Shahid Faghihi and Ali Asghar Hospitals in Shiraz, which were capable of offering electronic services. The data collection tool was a researcher-made questionnaire based on the Mekkamol model and other similar studies, as well as investigations into the websites of the world's top hospitals. The questionnaire's validity was approved by a committee of experts and its reliability was approved based on a 54-patient sample with a Cronbach's alpha of 0.94. The data were analyzed using the Structural Equation Modeling (SEM) with partial least squares (PLS) approach and by utilizing SPSS and Smart-PLS V2 software programs. The results showed that there are significant relationships between "website character" and "website contact interactivity" (p=0.00), between "shopping convenience" and "website contact interactivity" (p=0.00), and between "website contact interactivity" and "care and service" (p=0.00). Website design with such characteristics as website simplicity, shopping convenience, authenticity of information, and provision of such services as admission, scheduling appointments, and electronic payment of bills will result in interaction and communication between patients and hospital websites. This will, for its turn, pave the way for attracting more patients.

Using Multiple Schedules During Functional Communication Training to Promote Rapid Transfer of Treatment Effects

PubMed Central

Fisher, Wayne W.; Greer, Brian D.; Fuhrman, Ashley M.; Querim, Angie C.

2016-01-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects from one setting to the next and from one therapist to the next. With two children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. PMID:26384141

A Simulation Based Approach to Optimize Berth Throughput Under Uncertainty at Marine Container Terminals

NASA Technical Reports Server (NTRS)

Golias, Mihalis M.

2011-01-01

Berth scheduling is a critical function at marine container terminals and determining the best berth schedule depends on several factors including the type and function of the port, size of the port, location, nearby competition, and type of contractual agreement between the terminal and the carriers. In this paper we formulate the berth scheduling problem as a bi-objective mixed-integer problem with the objective to maximize customer satisfaction and reliability of the berth schedule under the assumption that vessel handling times are stochastic parameters following a discrete and known probability distribution. A combination of an exact algorithm, a Genetic Algorithms based heuristic and a simulation post-Pareto analysis is proposed as the solution approach to the resulting problem. Based on a number of experiments it is concluded that the proposed berth scheduling policy outperforms the berth scheduling policy where reliability is not considered.

Using multiple schedules during functional communication training to promote rapid transfer of treatment effects.

PubMed

Fisher, Wayne W; Greer, Brian D; Fuhrman, Ashley M; Querim, Angie C

2015-12-01

Multiple schedules with signaled periods of reinforcement and extinction have been used to thin reinforcement schedules during functional communication training (FCT) to make the intervention more practical for parents and teachers. We evaluated whether these signals would also facilitate rapid transfer of treatment effects across settings and therapists. With 2 children, we conducted FCT in the context of mixed (baseline) and multiple (treatment) schedules introduced across settings or therapists using a multiple baseline design. Results indicated that when the multiple schedules were introduced, the functional communication response came under rapid discriminative control, and problem behavior remained at near-zero rates. We extended these findings with another individual by using a more traditional baseline in which problem behavior produced reinforcement. Results replicated those of the previous participants and showed rapid reductions in problem behavior when multiple schedules were implemented across settings. © Society for the Experimental Analysis of Behavior.

Capability of the Maximax&Maximin selection operator in the evolutionary algorithm for a nurse scheduling problem

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.

Scheduling multirobot operations in manufacturing by truncated Petri nets

NASA Astrophysics Data System (ADS)

Chen, Qin; Luh, J. Y.

1995-08-01

Scheduling of operational sequences in manufacturing processes is one of the important problems in automation. Methods of applying Petri nets to model and analyze the problem with constraints on precedence relations, multiple resources allocation, etc. have been available in literature. Searching for an optimum schedule can be implemented by combining the branch-and-bound technique with the execution of the timed Petri net. The process usually produces a large Petri net which is practically not manageable. This disadvantage, however, can be handled by a truncation technique which divides the original large Petri net into several smaller size subnets. The complexity involved in the analysis of each subnet individually is greatly reduced. However, when the locally optimum schedules of the resulting subnets are combined together, it may not yield an overall optimum schedule for the original Petri net. To circumvent this problem, algorithms are developed based on the concepts of Petri net execution and modified branch-and-bound process. The developed technique is applied to a multi-robot task scheduling problem of the manufacturing work cell.

Natural course of behavioral addictions: a 5-year longitudinal study.

PubMed

Konkolÿ Thege, Barna; Woodin, Erica M; Hodgins, David C; Williams, Robert J

2015-01-22

Resolving the theoretical controversy on the labeling of an increasing number of excessive behaviors as behavioral addictions may also be facilitated by more empirical data on these behavioral problems. For instance, an essential issue to the classification of psychiatric disorders is information on their natural course. However, longitudinal research on the chronic vs. episodic nature of behavioral addictions is scarce. The aim of the present study, therefore, was to provide data on prevalence, substance use comorbidity, and five-year trajectories of six excessive behaviors-namely exercising, sexual behavior, shopping, online chatting, video gaming, and eating. Analyses were based on the data of the Quinte Longitudinal Study, where a cohort of 4,121 adults from Ontario, Canada was followed for 5 years (2006 to 2011). The response rate was 21.3%, while retention rate was 93.9%. To assess the occurrence of each problem behavior, a single self-diagnostic question asked people whether their over-involvement in the behavior had caused significant problems for them in the past 12 months. To assess the severity of each problem behavior reported, the Behavioral Addiction Measure was administered. A mixed design ANOVA was used to investigate symptom trajectories over time for each problem behavior and whether these symptom trajectories varied as a function of sex. The large majority of people reported having problematic over-involvement for just one of these behaviors and just in a single time period. A main effect of time was found for each problem behavior, indicating a moderately strong decrease in symptom severity across time. The time x sex interaction was insignificant in each model indicating that the decreasing trend is similar for males and females. The data also showed that help seeking was very low in the case of excessive sexual behavior, shopping, online chatting, and video gaming but substantially more prevalent in the case of excessive eating and exercising. The present results indicate that self-identified excessive exercising, sexual behavior, shopping, online chatting, video gaming, and/or eating tend to be fairly transient for most people. This aspect of the results is inconsistent with conceptualizations of addictions as progressive in nature, unless treated.

[Clandestine slaughtering in Tunisia: investigation on the knowledge and practices of butchers concerning hydatidosis].

PubMed

Besbes, M; Sellami, H; Cheikhrouhou, F; Makni, F; Ayadi, A

2003-11-01

Echinococcosis is one of the major parasitic diseases in Tunisia, accounting for a considerable public health problem. We propose in this work to analyse the behaviour of butchers and to evaluate its impact on the hydatic cyst transmission. We carried out a national transversal descriptive survey that included 97 butcher shops using illegal practice, located in 18 regions (governorats) of Tunisia. The sampling procedure was implemented according to the level of disease endemicity. 60.8% of butcher shops were located along main roads and therefore supplying travellers. Among the animals slaughtered sheep come in first position (97.9%). More than 80% of the butchers kept aside a place around the butcher shop to sacrifice their animals. We noted the presence of dogs near butcher shop in 52.6% of cases and stray dogs in 43.3% of cases. Only 13.4% of the butchers knew the disease mode of transmission. Parasitized viscera were thrown into dustbins or further in the riverbed in 56.7%. More than 50% of butchers, having an inadequate behaviour in front of parasitized viscera or ignoring the disease cycle, were originating from an hyper or holoendemic area. Illegal slaughtering practices have an important impact on transmission of cystic echinococcosis in Tunisia.

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.

Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

NASA Astrophysics Data System (ADS)

Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

2018-01-01

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

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.

Sensitivity and bias under conditions of equal and unequal academic task difficulty.

PubMed

Reed, Derek D; Martens, Brian K

2008-01-01

We conducted an experimental analysis of children's relative problem-completion rates across two workstations under conditions of equal (Experiment 1) and unequal (Experiment 2) problem difficulty. Results were described using the generalized matching equation and were evaluated for degree of schedule versus stimulus control. Experiment 1 involved a symmetrical choice arrangement in which the children could earn points exchangeable for rewards contingent on correct math problem completion. Points were delivered according to signaled variable-interval schedules at each workstation. For 2 children, relative rates of problem completion appeared to have been controlled by the schedule requirements in effect and matched relative rates of reinforcement, with sensitivity values near 1 and bias values near 0. Experiment 2 involved increasing the difficulty of math problems at one of the workstations. Sensitivity values for all 3 participants were near 1, but a substantial increase in bias toward the easier math problems was observed. This bias was possibly associated with responding at the more difficult workstation coming under stimulus control rather than schedule control.

Analysis of Feeder Bus Network Design and Scheduling Problems

PubMed Central

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

Optimization of multi-objective integrated process planning and scheduling problem using a priority based optimization algorithm

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.

Some Advertising Sales Tips.

ERIC Educational Resources Information Center

Schick, C. Dennis

1980-01-01

Enumerates information that advertising sales people for school newspapers should have before they call on potential customers. Includes ideas on what to know about a number of items, including the publication, readers and nonreaders, advertising, sales opportunities, prospects, prospects' problems, shopping factors, and stores' images. (TJ)

Profits and Perils in Real Estate.

ERIC Educational Resources Information Center

McMillen, Liz; Mangan, Katherine S.

1989-01-01

In an effort to diversify their investments, colleges are pouring money into hotels, shopping centers, research parks, and apartment buildings. Institutional involvement in real estate takes a variety of forms, some considered risky, and has resulted in both profit and public-relations problems. (MSE)

"Science Shops" Flourish in Europe.

ERIC Educational Resources Information Center

Dickson, David

1984-01-01

Small organizations have been forming in many European countries which provide direct links between university researchers and the general public. These organizations, which focus on research on social problems, have gained political and financial support. The development, operation, and activities of these organizations are discussed. (JN)

[Analysis of behavior related to use of the Internet, mobile telephones, compulsive shopping and gambling among university students].

PubMed

Ruiz-Olivares, Rosario; Lucena, Valentina; Pino, M José; Herruzo, Javier

2010-01-01

The aim of this study is to obtain knowledge about habits related to addictive behaviour (pathological gambling, Internet, compulsive shopping, use of mobile telephones, etc.) that may be displayed by young students at the University of Cordoba (Spain), and to relate this behaviour with variables such as age, sex, course year, macro-field of study (arts/sciences) and the consumption of substances such as alcohol, tobacco, cannabis and cocaine. Using an ex-post facto single-group design (Montero & Leon, 2007), we applied a questionnaire especially designed to gather socio-demographic information on substance use and behavioural patterns related to "non-substance" addictions, which included the Shopping Addiction Test, Echeburua's Internet Addiction Test (2003) and Fernandez-Montalvo and Echeburua's Short Pathological Gambling Questionnaire (1997). A total of 1,011 students participated in the study (42.7% males and 57.3% females), with an age range of 18 to 29. Significant differences were found between mean score on the questionnaires and variables such as age, sex, field of studies and course year. It would seem that being female is a protective factor for Internet and gambling addiction, being a sciences student is a risk factor for gambling addiction, and being older and being an arts student are risk factors for shopping addiction. In conclusion, it can be stated that the students surveyed showed moderate incidence of behaviours such as Internet browsing, gambling, shopping and mobile phone use, whilst a very small group are close to having an addiction problem with such behaviours.

An Integrated Constraint Programming Approach to Scheduling Sports Leagues with Divisional and Round-robin Tournaments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carlsson, Mats; Johansson, Mikael; Larson, Jeffrey

Previous approaches for scheduling a league with round-robin and divisional tournaments involved decomposing the problem into easier subproblems. This approach, used to schedule the top Swedish handball league Elitserien, reduces the problem complexity but can result in suboptimal schedules. This paper presents an integrated constraint programming model that allows to perform the scheduling in a single step. Particular attention is given to identifying implied and symmetry-breaking constraints that reduce the computational complexity significantly. The experimental evaluation of the integrated approach takes considerably less computational effort than the previous approach.

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

NASA Technical Reports Server (NTRS)

Eun, Yeonju; Jeon, Daekeun; Lee, Hanbong; Jung, Yoon C.; Zhu, Zhifan; Jeong, Myeongsook; Kim, Hyounkong; Oh, Eunmi; Hong, Sungkwon

2017-01-01

This study aims to develop a controllers decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

NASA Technical Reports Server (NTRS)

Eun, Yeonju; Jeon, Daekeun; Lee, Hanbong; Jung, Yoon Chul; Zhu, Zhifan; Jeong, Myeong-Sook; Kim, Hyoun Kyoung; Oh, Eunmi; Hong, Sungkwon

2017-01-01

This study aims to develop a controllers' decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

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.

Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.

PubMed

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.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kawamoto, M.M.; Kelly, J.E.

In response to a confidential employee request, an investigation was begun into possible hazardous working conditions at the quick basic oxygen process (Q-BOP) shop at USS/USX Gary Works (SIC-3312), Gary, Indiana. The company was an integrated steel manufacturer where three major steel making processes were performed. Air contaminants, noise, heat stress, and ergonomic problems had been reported. Exposures to metals and sulfur-dioxide (7446095) were monitored. Confidential interviews were conducted with workers. The authors conclude that Q-BOP shop workers were potentially exposed to airborne irritants, noise, heat, and ergonomic risk factors. The authors recommend that measures be taken to reduce exposures,more » and to improve the health and safety of the workers.« less

Full load shop testing of 18,000-hp gas turbine driven centrifugal compressor for offshore platform service: Evaluation of rotor dynamics performance

NASA Technical Reports Server (NTRS)

Kirk, R. G.; Simpson, M.

1985-01-01

The results for in-plant full load testing of a 13.4 MW (18000 HP) gas turbine driven centrifugal compressor are presented and compared to analytical predictions of compressor rotor stability. Unique problems from both oil seals and labyrinth gas seals were encountered during the testing. The successful resolution of these problems are summarized.

Offspring Generation Method for interactive Genetic Algorithm considering Multimodal Preference

NASA Astrophysics Data System (ADS)

Ito, Fuyuko; Hiroyasu, Tomoyuki; Miki, Mitsunori; Yokouchi, Hisatake

In interactive genetic algorithms (iGAs), computer simulations prepare design candidates that are then evaluated by the user. Therefore, iGA can predict a user's preferences. Conventional iGA problems involve a search for a single optimum solution, and iGA were developed to find this single optimum. On the other hand, our target problems have several peaks in a function and there are small differences among these peaks. For such problems, it is better to show all the peaks to the user. Product recommendation in shopping sites on the web is one example of such problems. Several types of preference trend should be prepared for users in shopping sites. Exploitation and exploration are important mechanisms in GA search. To perform effective exploitation, the offspring generation method (crossover) is very important. Here, we introduced a new offspring generation method for iGA in multimodal problems. In the proposed method, individuals are clustered into subgroups and offspring are generated in each group. The proposed method was applied to an experimental iGA system to examine its effectiveness. In the experimental iGA system, users can decide on preferable t-shirts to buy. The results of the subjective experiment confirmed that the proposed method enables offspring generation with consideration of multimodal preferences, and the proposed mechanism was also shown not to adversely affect the performance of preference prediction.

Scheduling revisited workstations in integrated-circuit fabrication

NASA Technical Reports Server (NTRS)

Kline, Paul J.

1992-01-01

The cost of building new semiconductor wafer fabrication factories has grown rapidly, and a state-of-the-art fab may cost 250 million dollars or more. Obtaining an acceptable return on this investment requires high productivity from the fabrication facilities. This paper describes the Photo Dispatcher system which was developed to make machine-loading recommendations on a set of key fab machines. Dispatching policies that generally perform well in job shops (e.g., Shortest Remaining Processing Time) perform poorly for workstations such as photolithography which are visited several times by the same lot of silicon wafers. The Photo Dispatcher evaluates the history of workloads throughout the fab and identifies bottleneck areas. The scheduler then assigns priorities to lots depending on where they are headed after photolithography. These priorities are designed to avoid starving bottleneck workstations and to give preference to lots that are headed to areas where they can be processed with minimal waiting. Other factors considered by the scheduler to establish priorities are the nearness of a lot to the end of its process flow and the time that the lot has already been waiting in queue. Simulations that model the equipment and products in one of Texas Instrument's wafer fabs show the Photo Dispatcher can produce a 10 percent improvement in the time required to fabricate integrated circuits.

Craftsmen in the Wood Model Shop at the Lewis Flight Propulsion Laboratory

NASA Image and Video Library

1953-01-21

Craftsmen work in the wood model shop at the National Advisory Committee for Aeronautics (NACA) Lewis Flight Propulsion Laboratory. The Fabrication Division created almost all of the equipment and models used at the laboratory. The Fabrication Shop building contained a number of specialized shops in the 1940s and 1950s. These included a Machine Shop, Sheet Metal Shop, Wood Model and Pattern Shop, Instrument Shop, Thermocouple Shop, Heat Treating Shop, Metallurgical Laboratory, and Fabrication Office. The Wood Model and Pattern Shop created everything from control panels and cabinets to aircraft models molds for sheet metal work.

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 to other problem domains, and plans for the future evolution of the system.

Non-Evolutionary Algorithms for Scheduling Dependent Tasks in Distributed Heterogeneous Computing Environments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wayne F. Boyer; Gurdeep S. Hura

2005-09-01

The Problem of obtaining an optimal matching and scheduling of interdependent tasks in distributed heterogeneous computing (DHC) environments is well known to be an NP-hard problem. In a DHC system, task execution time is dependent on the machine to which it is assigned and task precedence constraints are represented by a directed acyclic graph. Recent research in evolutionary techniques has shown that genetic algorithms usually obtain more efficient schedules that other known algorithms. We propose a non-evolutionary random scheduling (RS) algorithm for efficient matching and scheduling of inter-dependent tasks in a DHC system. RS is a succession of randomized taskmore » orderings and a heuristic mapping from task order to schedule. Randomized task ordering is effectively a topological sort where the outcome may be any possible task order for which the task precedent constraints are maintained. A detailed comparison to existing evolutionary techniques (GA and PSGA) shows the proposed algorithm is less complex than evolutionary techniques, computes schedules in less time, requires less memory and fewer tuning parameters. Simulation results show that the average schedules produced by RS are approximately as efficient as PSGA schedules for all cases studied and clearly more efficient than PSGA for certain cases. The standard formulation for the scheduling problem addressed in this paper is Rm|prec|Cmax.,« less

16. Interior, Machine Shop, Roundhouse Machine Shop Extension, Southern Pacific ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

16. Interior, Machine Shop, Roundhouse Machine Shop Extension, Southern Pacific Railroad Carlin Shops, view to south (90mm lens). Note the large segmental-arched doorway to move locomotives in and out of Machine Shop. - Southern Pacific Railroad, Carlin Shops, Roundhouse Machine Shop Extension, Foot of Sixth Street, Carlin, Elko County, NV

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).

Constraint-based scheduling

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.

Constraint-based scheduling

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.

Constraint-based scheduling

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.

Blood Glucose Levels and Problem Behavior

ERIC Educational Resources Information Center

Valdovinos, Maria G.; Weyand, David

2006-01-01

The relationship between varying blood glucose levels and problem behavior during daily scheduled activities was examined. The effects that varying blood glucose levels had on problem behavior during daily scheduled activities were examined. Prior research has shown that differing blood glucose levels can affect behavior and mood. Results of this…

Teaming. The Key to World Class Manufacturing.

ERIC Educational Resources Information Center

Wright, John R.

1999-01-01

Lean manufacturing, a streamlined system of flow and job shop techniques, relies on self-directed work teams. Technology educators can prepare students for work in this environment by using problem-solving teams in the classroom to work on design briefs and other group projects. (SK)

Agoraphobia.

ERIC Educational Resources Information Center

Brehony, Kathleen A.

Agoraphobia is the most pervasive and serious phobic response seen by clinicians, accounting for approximately 50 to 60% of all phobic problems. The symptoms of agoraphobia, a condition in which an individual fears entering public areas, include fears of leaving home, fainting, entering open and closed spaces, shopping, entering social situations,…

Leveraging Multiactions to Improve Medical Personalized Ranking for Collaborative Filtering.

PubMed

Gao, Shan; Guo, Guibing; Li, Runzhi; Wang, Zongmin

2017-01-01

Nowadays, providing high-quality recommendation services to users is an essential component in web applications, including shopping, making friends, and healthcare. This can be regarded either as a problem of estimating users' preference by exploiting explicit feedbacks (numerical ratings), or as a problem of collaborative ranking with implicit feedback (e.g., purchases, views, and clicks). Previous works for solving this issue include pointwise regression methods and pairwise ranking methods. The emerging healthcare websites and online medical databases impose a new challenge for medical service recommendation. In this paper, we develop a model, MBPR (Medical Bayesian Personalized Ranking over multiple users' actions), based on the simple observation that users tend to assign higher ranks to some kind of healthcare services that are meanwhile preferred in users' other actions. Experimental results on the real-world datasets demonstrate that MBPR achieves more accurate recommendations than several state-of-the-art methods and shows its generality and scalability via experiments on the datasets from one mobile shopping app.

Leveraging Multiactions to Improve Medical Personalized Ranking for Collaborative Filtering

PubMed Central

2017-01-01

Nowadays, providing high-quality recommendation services to users is an essential component in web applications, including shopping, making friends, and healthcare. This can be regarded either as a problem of estimating users' preference by exploiting explicit feedbacks (numerical ratings), or as a problem of collaborative ranking with implicit feedback (e.g., purchases, views, and clicks). Previous works for solving this issue include pointwise regression methods and pairwise ranking methods. The emerging healthcare websites and online medical databases impose a new challenge for medical service recommendation. In this paper, we develop a model, MBPR (Medical Bayesian Personalized Ranking over multiple users' actions), based on the simple observation that users tend to assign higher ranks to some kind of healthcare services that are meanwhile preferred in users' other actions. Experimental results on the real-world datasets demonstrate that MBPR achieves more accurate recommendations than several state-of-the-art methods and shows its generality and scalability via experiments on the datasets from one mobile shopping app. PMID:29118963

Type C investigation of electrical fabrication projects in ICF Kaiser shops

DOE Office of Scientific and Technical Information (OSTI.GOV)

Huckfeldt, R.A.

1995-06-01

A Type C Investigation Board was convened to investigate an electrical miswiring problem found during the operation of the electrical distribution trailer for the TWRS Rotary Mode Core Sampling Truck {number_sign}2. The trailer was designed by WHC and fabricated ICF KH on site for use in the Characterization Program. This problem resulted in a serious safety hazard since the support truck frame/chassis became electrically energized. This final report provides results of the ``Type C Investigation, Electrical Fabrication Projects in ICF KH Shops, June, 1995.`` It contains the investigation scope, executive summary, relevant facts, analysis, conclusions and corrective actions. DOE Ordermore » 5484.1, ``Environmental Protection, Safety and Health Protection Information Reporting Requirements,`` was followed in preparation of this report. Because the incident was electrical in nature and involved both Westinghouse Hanford Company and ICF Kaiser Hanford organizations, the board included members from both contractors and members with considerable electrical expertise.« less

The Cost of a Healthier Diet for Young Children with Type 1 Diabetes Mellitus

PubMed Central

Patton, Susana R.; Goggin, Kathy; Clements, Mark A.

2015-01-01

Objective The study used a market-basket approach to examine the availability and cost of a standard food shopping list (R-TFP) versus a healthier food shopping list (H-TFP) in the grocery stores used by a sample of 23 families of young children with type 1 diabetes mellitus (T1DM). Methods Frequency counts were used to measure availability. The average cost of the R-TFP and the H-TFP was compared using a paired t-test. Results Small or independent markets had the highest percent of missing foods (14%), followed by chain supermarkets (3%), and big box stores (2%). There was a significant difference in the average cost for the R-TFP versus the H-TFP ($324.71 and $380.07, respectively p<0.001). Conclusions and Implications Families may encounter problems finding healthier foods and/or incur greater costs for healthier foods. Nutrition education programs for T1DM need to teach problem solving to help families overcome these barriers. PMID:26164132

14. Interior, Machine Shop, Roundhouse Machine Shop Extension, Southern Pacific ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

14. Interior, Machine Shop, Roundhouse Machine Shop Extension, Southern Pacific Railroad Carlin Shops, view to north (90mm lens). - Southern Pacific Railroad, Carlin Shops, Roundhouse Machine Shop Extension, Foot of Sixth Street, Carlin, Elko County, NV

12. Interior, Blacksmith Shop, Roundhouse Machine Shop Extension, Southern Pacific ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

12. Interior, Blacksmith Shop, Roundhouse Machine Shop Extension, Southern Pacific Railroad Carlin Shops, view to northwest (90mm lens). - Southern Pacific Railroad, Carlin Shops, Roundhouse Machine Shop Extension, Foot of Sixth Street, Carlin, Elko County, NV

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.

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.

Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling

NASA Astrophysics Data System (ADS)

Mardiana Panggabean, Ellis; Mawengkang, Herman; Azis, Zainal; Filia Sari, Rina

2018-01-01

The paper develops a model for the optimal management of logistic delivery of a given commodity. The company has different type of vehicles with different capacity to deliver the commodity for customers. The problem is then called Periodic Heterogeneous Vehicle Routing Problem (PHVRP). The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the sum of the costs of all routes over the planning horizon. We propose a combined approach of heuristic algorithm and exact method to solve the problem.

Strategic Gang Scheduling for Railroad Maintenance

DOT National Transportation Integrated Search

2012-08-14

We address the railway track maintenance scheduling problem. The problem stems from the : significant percentage of the annual budget invested by the railway industry for maintaining its railway : tracks. The process requires consideration of human r...

Estimates of the absolute error and a scheme for an approximate solution to scheduling problems

NASA Astrophysics Data System (ADS)

Lazarev, A. A.

2009-02-01

An approach is proposed for estimating absolute errors and finding approximate solutions to classical NP-hard scheduling problems of minimizing the maximum lateness for one or many machines and makespan is minimized. The concept of a metric (distance) between instances of the problem is introduced. The idea behind the approach is, given the problem instance, to construct another instance for which an optimal or approximate solution can be found at the minimum distance from the initial instance in the metric introduced. Instead of solving the original problem (instance), a set of approximating polynomially/pseudopolynomially solvable problems (instances) are considered, an instance at the minimum distance from the given one is chosen, and the resulting schedule is then applied to the original instance.

Fabrication Division Staff in the Machine Shop

NASA Image and Video Library

1946-07-21

Machine Shop technicians in the Technical Service Building at the National Advisory Committee for Aeronautics (NACA) Lewis Flight Propulsion Laboratory. The 260-person Fabrication Division, led by Dan White and John Dalgleish, created almost all of the equipment and models used at the laboratory. The Technical Services Building, referred to as the Fab Shop, contained a number of specialized shops in the 1940s and 1950s. These included a Machine Shop, Sheet Metal Shop, Wood and Pattern Shop, Instrument Shop, Thermocouple Shop, Heat Treating Shop, Metallurgical Laboratory, and Fabrication Office. The Machine Shop fabricated specialized research equipment not commercially available. During World War II these technicians produced high-speed cameras for combustion research, impellers and other supercharger components, and key equipment for the lab’s first supersonic wind tunnel. The Wood and Pattern Shop created everything from control panels and cabinets to aircraft model molds for sheet metal work. The Sheet Metal Shop had the ability to work with 0.01 to 4-inch thick steel plates. The Instrument Shop specialized in miniature parts and instrumentation, while the Thermocouple Shop standardized the installation of pitot tubes and thermocouples.

Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

NASA Technical Reports Server (NTRS)

Drummond, Mark; Fox, Mark; Tate, Austin; Zweben, Monte

1992-01-01

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques.

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.

Uncertainty management by relaxation of conflicting constraints in production process scheduling

NASA Technical Reports Server (NTRS)

Dorn, Juergen; Slany, Wolfgang; Stary, Christian

1992-01-01

Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.

Simulated annealing with probabilistic analysis for solving traveling salesman problems

NASA Astrophysics Data System (ADS)

Hong, Pei-Yee; Lim, Yai-Fung; Ramli, Razamin; Khalid, Ruzelan

2013-09-01

Simulated Annealing (SA) is a widely used meta-heuristic that was inspired from the annealing process of recrystallization of metals. Therefore, the efficiency of SA is highly affected by the annealing schedule. As a result, in this paper, we presented an empirical work to provide a comparable annealing schedule to solve symmetric traveling salesman problems (TSP). Randomized complete block design is also used in this study. The results show that different parameters do affect the efficiency of SA and thus, we propose the best found annealing schedule based on the Post Hoc test. SA was tested on seven selected benchmarked problems of symmetric TSP with the proposed annealing schedule. The performance of SA was evaluated empirically alongside with benchmark solutions and simple analysis to validate the quality of solutions. Computational results show that the proposed annealing schedule provides a good quality of solution.

Guidance and Control Software,

DTIC Science & Technology

1980-05-01

commitments of function, cost, and schedule . The phrase "software engineering" was intended to contrast with the phrase "computer science" the latter aims...the software problems of cost, delivery schedule , and quality were gradually being recognized at the highest management levels. Thus, in a project... schedule dates. Although the analysis of software problems indicated that the entire software development process (figure 1) needed new methods, only

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.

A Novel Strategy Using Factor Graphs and the Sum-Product Algorithm for Satellite Broadcast Scheduling Problems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh

This paper presents a low complexity algorithmic framework for finding a broadcasting schedule in a low-altitude satellite system, i. e., the satellite broadcast scheduling (SBS) problem, based on the recent modeling and computational methodology of factor graphs. Inspired by the huge success of the low density parity check (LDPC) codes in the field of error control coding, in this paper, we transform the SBS problem into an LDPC-like problem through a factor graph instead of using the conventional neural network approaches to solve the SBS problem. Based on a factor graph framework, the soft-information, describing the probability that each satellite will broadcast information to a terminal at a specific time slot, is exchanged among the local processing in the proposed framework via the sum-product algorithm to iteratively optimize the satellite broadcasting schedule. Numerical results show that the proposed approach not only can obtain optimal solution but also enjoys the low complexity suitable for integral-circuit implementation.

One-Stop Shop

ERIC Educational Resources Information Center

Protheroe, Nancy

2010-01-01

Full-service community schools do more than educate; they partner with the community to provide the supports and services that students and families need through one comprehensive, coordinated effort. By offering services on-site, full-service schools can help eliminate some barriers that families face such as problems with transportation, lack of…

Financial Education Can Change Behavior.

ERIC Educational Resources Information Center

Varcoe, Karen P.; Wright, Joan

1991-01-01

Interviews with 190 participants in Money Sense--a financial management education program based on the "master volunteer" approach--showed that the program taught them food shopping and money management skills and helped save money on food costs. Most experienced fewer financial problems and perceived their financial status as improved.…

Exploratory and problem-solving consumer behavior across the life span.

PubMed

Lesser, J A; Kunkel, S R

1991-09-01

Different cognitive functioning, social, and personality changes appear to occur systematically during the adult life span. This article synthesizes research on life span changes in order to develop age-specific models of shopping behavior. The models are tested within a naturalistic field study of shoppers.

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.

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.

Acceptability of Financial Incentives for Health Behaviours: A Discrete Choice Experiment.

PubMed

Giles, Emma L; Becker, Frauke; Ternent, Laura; Sniehotta, Falko F; McColl, Elaine; Adams, Jean

2016-01-01

Healthy behaviours are important determinants of health and disease, but many people find it difficult to perform these behaviours. Systematic reviews support the use of personal financial incentives to encourage healthy behaviours. There is concern that financial incentives may be unacceptable to the public, those delivering services and policymakers, but this has been poorly studied. Without widespread acceptability, financial incentives are unlikely to be widely implemented. We sought to answer two questions: what are the relative preferences of UK adults for attributes of financial incentives for healthy behaviours? Do preferences vary according to the respondents' socio-demographic characteristics? We conducted an online discrete choice experiment. Participants were adult members of a market research panel living in the UK selected using quota sampling. Preferences were examined for financial incentives for: smoking cessation, regular physical activity, attendance for vaccination, and attendance for screening. Attributes of interest (and their levels) were: type of incentive (none, cash, shopping vouchers or lottery tickets); value of incentive (a continuous variable); schedule of incentive (same value each week, or value increases as behaviour change is sustained); other information provided (none, written information, face-to-face discussion, or both); and recipients (all eligible individuals, people living in low-income households, or pregnant women). Cash or shopping voucher incentives were preferred as much as, or more than, no incentive in all cases. Lower value incentives and those offered to all eligible individuals were preferred. Preferences for additional information provided alongside incentives varied between behaviours. Younger participants and men were more likely to prefer incentives. There were no clear differences in preference according to educational attainment. Cash or shopping voucher-type financial incentives for healthy behaviours are not necessarily less acceptable than no incentives to UK adults.

Structural investigation of websites of selected educational hospitals of Shiraz University of Medical Sciences from Patient Relationship Management (PRM) perspective

PubMed Central

Bakhshi, Mahdieh; Monem, Hossein; Barati, Omid; Sharifian, Roxana; Nematollahi, Mohtaram

2017-01-01

Background Hospital websites are considered as an appropriate system for exchanging information and establishing communication between patients, hospitals, and medical staff. Website character, website contact interactivity, shopping convenience, as well as care and service are the factors that the present study investigated as far as the patient relationship management is concerned. Methods This descriptive-analytical study was conducted on 206 patients visiting Shahid Faghihi and Ali Asghar Hospitals in Shiraz, which were capable of offering electronic services. The data collection tool was a researcher-made questionnaire based on the Mekkamol model and other similar studies, as well as investigations into the websites of the world’s top hospitals. The questionnaire’s validity was approved by a committee of experts and its reliability was approved based on a 54-patient sample with a Cronbach’s alpha of 0.94. The data were analyzed using the Structural Equation Modeling (SEM) with partial least squares (PLS) approach and by utilizing SPSS and Smart-PLS V2 software programs. Results The results showed that there are significant relationships between “website character” and “website contact interactivity” (p=0.00), between “shopping convenience” and “website contact interactivity” (p=0.00), and between “website contact interactivity” and “care and service” (p=0.00). Conclusion Website design with such characteristics as website simplicity, shopping convenience, authenticity of information, and provision of such services as admission, scheduling appointments, and electronic payment of bills will result in interaction and communication between patients and hospital websites. This will, for its turn, pave the way for attracting more patients. PMID:28894536

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.

[Aedes aegypti larval infestation index and identification of awareness, attitudes and practices related to Dengue in tire shops in Atlántico, Colombia].

PubMed

Maestre-Serrano, Ronald; Pacheco-Lugo, Lisandro; Salcedo-Mendoza, Soraya

2015-10-01

Objective To identify the awareness, attitudes and practices related to dengue in owners and workers of tire ships, as well as the levels of mosquito infestation in tire shops in Atlántico department - Colombia. Methods We conducted a descriptive study. The variables were described as percentages and measures of central tendency and dispersion. Index of larval infestation and containers were calculated in each of the municipalities studied. We visited and inspected 111 tire shops. 26.1 % (29/111) of these were found positive for Ae. aegypti larvae. The municipalities of Piojó, Santo Tomás, Santa Lucia, Sabanagrande and Luruaco were characterized by a higher larval infestation index. Results Regarding dengue, 90.9 % of respondents considered it a problem for them and their families. 94.6 % know that is transmitted by mosquitoes. 91.1 % know the vector larvae under the name "sarapico", 3.6 % as "gusarapo". 98.2 % felt that there is a relationship between the larva and Ae. aegypti mosquito. 100 % of participantes recognized tires to be a breeding for mosquitoes. 85.7% believed fever to be the most common symptom. 83 % reported accessing the health post to cure the disease. 90.8 % throw out unusable tires as if they were garbage. Conclusion In the population studied, there is good awareness of dengue and its vector. Nevertheless, there are problems related to attitudes and prevention practices.

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.

AUTOMOTIVE REPAIR SHOP, INTERIOR VIEW TO SOUTHEAST, DOORWAYS TO SHOP ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

AUTOMOTIVE REPAIR SHOP, INTERIOR VIEW TO SOUTHEAST, DOORWAYS TO SHOP OFFICE AND SOUTH WING. - Cedar City Automotive Repair Shop, Automotive Repair Shop, 820 North Main Street, Cedar City, Iron County, UT

Toward interactive scheduling systems for managing medical resources.

PubMed

Oddi, A; Cesta, A

2000-10-01

Managers of medico-hospital facilities are facing two general problems when allocating resources to activities: (1) to find an agreement between several and contrasting requirements; (2) to manage dynamic and uncertain situations when constraints suddenly change over time due to medical needs. This paper describes the results of a research aimed at applying constraint-based scheduling techniques to the management of medical resources. A mixed-initiative problem solving approach is adopted in which a user and a decision support system interact to incrementally achieve a satisfactory solution to the problem. A running prototype is described called Interactive Scheduler which offers a set of functionalities for a mixed-initiative interaction to cope with the medical resource management. Interactive Scheduler is endowed with a representation schema used for describing the medical environment, a set of algorithms that address the specific problems of the domain, and an innovative interaction module that offers functionalities for the dialogue between the support system and its user. A particular contribution of this work is the explicit representation of constraint violations, and the definition of scheduling algorithms that aim at minimizing the amount of constraint violations in a solution.

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

PubMed

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path

PubMed Central

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective. PMID:27490901

Eyes wide shopped: shopping situations trigger arousal in impulsive buyers.

PubMed

Serfas, Benjamin G; Büttner, Oliver B; Florack, Arnd

2014-01-01

The present study proposes arousal as an important mechanism driving buying impulsiveness. We examined the effect of buying impulsiveness on arousal in non-shopping and shopping contexts. In an eye-tracking experiment, we measured pupil dilation while participants viewed and rated pictures of shopping scenes and non-shopping scenes. The results demonstrated that buying impulsiveness is closely associated with arousal as response to viewing pictures of shopping scenes. This pertained for hedonic shopping situations as well as for utilitarian shopping situations. Importantly, the effect did not emerge for non-shopping scenes. Furthermore, we demonstrated that arousal of impulsive buyers is independent from cognitive evaluation of scenes in the pictures.

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

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-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

AUTOMOTIVE REPAIR SHOP, INTERIOR VIEW TO SOUTHEAST, DOORWAYS TO SHOP ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

AUTOMOTIVE REPAIR SHOP, INTERIOR VIEW TO SOUTHEAST, DOORWAYS TO SHOP OFFICE AND SOUTH WING, WITH SCALE. - Cedar City Automotive Repair Shop, Automotive Repair Shop, 820 North Main Street, Cedar City, Iron County, UT

How does use of a prescription monitoring program change medical practice?

PubMed

Green, Traci C; Mann, Marita R; Bowman, Sarah E; Zaller, Nickolas; Soto, Xaviel; Gadea, John; Cordy, Catherine; Kelly, Patrick; Friedmann, Peter D

2012-10-01

  The objectives of this study were to test for differences in prescription monitoring program (PMP) use between two states, Connecticut (CT) and Rhode Island (RI), with a different PMP accessibility; to explore use of PMP reports in clinical practice; and to examine associations between PMP use and clinician's responses to suspected diversion or "doctor shopping" (i.e., multiple prescriptions from multiple providers).   From March to August 2011, anonymous surveys were emailed to providers licensed to prescribe Schedule II medications in CT (N = 16,924) and RI (N = 5,567).   PMP use, use of patient reports in clinical practice, responses to suspected doctor shopping, or diversion.   Responses from 1,385 prescribers were received: 998 in CT and 375 in RI. PMP use was greater in CT, where an electronic PMP is available (43.9% vs 16.3%, χ(2)  = 85.2, P < 0.0001). PMP patient reports were used to screen for drug abuse (36.2% CT vs 10.0% RI, χ(2)  = 60.9, P < 0.0001) and detect doctor shopping (43.9% CT vs 18.5% RI, χ(2)  = 68.3, P < 0.0001). Adjusting for potential confounders, responses by PMP users to suspicious medication use behavior were more likely to entail clinical response (i.e., refer to another provider odds ratio, OR, 1.75 [95% confidence interval, CI, 1.10, 2.80]; screen for drug abuse OR 1.93 [1.39, 2.68]; revisit pain/treatment agreement OR 1.97 [1.45, 2.67]; conduct urine screen OR 1.82 [1.29, 2.57]; refer to substance abuse treatment OR 1.30 [0.96, 1.75]) rather than legal intervention (OR 0.45 [0.21, 0.94]) or inaction (OR 0.09 [0.01, 0.70]).   Prescribers' use of an electronic PMP may influence medical practice, especially opioid abuse detection, and is associated with clinical responses to suspected doctor shopping or diversion. Wiley Periodicals, Inc.

Flight control electronics reliability/maintenance study

NASA Technical Reports Server (NTRS)

Dade, W. W.; Edwards, R. H.; Katt, G. T.; Mcclellan, K. L.; Shomber, H. A.

1977-01-01

Collection and analysis of data are reported that concern the reliability and maintenance experience of flight control system electronics currently in use on passenger carrying jet aircraft. Two airlines B-747 airplane fleets were analyzed to assess the component reliability, system functional reliability, and achieved availability of the CAT II configuration flight control system. Also assessed were the costs generated by this system in the categories of spare equipment, schedule irregularity, and line and shop maintenance. The results indicate that although there is a marked difference in the geographic location and route pattern between the airlines studied, there is a close similarity in the reliability and the maintenance costs associated with the flight control electronics.

Modeling pedestrian shopping behavior using principles of bounded rationality: model comparison and validation

NASA Astrophysics Data System (ADS)

Zhu, Wei; Timmermans, Harry

2011-06-01

Models of geographical choice behavior have been dominantly based on rational choice models, which assume that decision makers are utility-maximizers. Rational choice models may be less appropriate as behavioral models when modeling decisions in complex environments in which decision makers may simplify the decision problem using heuristics. Pedestrian behavior in shopping streets is an example. We therefore propose a modeling framework for pedestrian shopping behavior incorporating principles of bounded rationality. We extend three classical heuristic rules (conjunctive, disjunctive and lexicographic rule) by introducing threshold heterogeneity. The proposed models are implemented using data on pedestrian behavior in Wang Fujing Street, the city center of Beijing, China. The models are estimated and compared with multinomial logit models and mixed logit models. Results show that the heuristic models are the best for all the decisions that are modeled. Validation tests are carried out through multi-agent simulation by comparing simulated spatio-temporal agent behavior with the observed pedestrian behavior. The predictions of heuristic models are slightly better than those of the multinomial logit models.

Effects of mobility and location on food access.

PubMed

Coveney, John; O'Dwyer, Lisel A

2009-03-01

Access to healthy food has become an important area of investigation for researchers interested in health disparities and inequalities. The debate about the existence and characteristics of 'food deserts' has increased the interest in food availability and equity in health research. This debate is crucial to an understanding of the factors leading to food security. Research reported here used in-depth interviews with respondents without private transport living within and outside food deserts in Adelaide, South Australia. The respondents came from a variety of households, including single and double parent families, and people living alone. The research found that living in a food desert did not, by itself, impose food access difficulties. Far more important was the access to independent transport to shops. A number of features were identified in this research including reliance on supermarkets, difficulties with public transport, and the provision of government schemes and systems that for some made food shopping much easier. The research suggests that food access problems in Adelaide are not so much the product of geographic distance between home and shop, as the social or welfare networks that allow people to access private transport.

Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem

PubMed Central

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

2. VIEW SOUTHWESTNORTH ELEVATION OF BOILER SHOP SECTION OF THE ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

2. VIEW SOUTHWEST-NORTH ELEVATION OF BOILER SHOP SECTION OF THE BETHLEHEM STEEL COMPANY SHIPYARD BLACKSMITH SHOP/BOILER SHOP. - Bethlehem Steel Company Shipyard, Blacksmith Shop-Boiler Shop, 1201-1321 Hudson Street, Hoboken, Hudson County, NJ

6. VIEW WESTINTERIOR OF BOILER SHOP SECTION OF THE BETHLEHEM ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

6. VIEW WEST-INTERIOR OF BOILER SHOP SECTION OF THE BETHLEHEM STEEL COMPANY SHIPYARD BLACKSMITH SHOP/BOILER SHOP. - Bethlehem Steel Company Shipyard, Blacksmith Shop-Boiler Shop, 1201-1321 Hudson Street, Hoboken, Hudson County, NJ

7. VIEW EASTINTERIOR OF BOILER SHOP SECTION OF THE BETHLEHEM ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

7. VIEW EAST-INTERIOR OF BOILER SHOP SECTION OF THE BETHLEHEM STEEL COMPANY SHIPYARD BLACKSMITH SHOP/BOILER SHOP. - Bethlehem Steel Company Shipyard, Blacksmith Shop-Boiler Shop, 1201-1321 Hudson Street, Hoboken, Hudson County, NJ

8. VIEW EASTINTERIOR OF BLACKSMITH SHOP SECTION OF THE BETHLEM ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

8. VIEW EAST-INTERIOR OF BLACKSMITH SHOP SECTION OF THE BETHLEM STEEL COMPANY SHIPYARD BLACKSMITH SHOP/BOILER SHOP. - Bethlehem Steel Company Shipyard, Blacksmith Shop-Boiler Shop, 1201-1321 Hudson Street, Hoboken, Hudson County, NJ

9. VIEW WESTINTERIOR OF BLACKSMITH SHOP SECTION OF THE BETHLEHEM ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

9. VIEW WEST-INTERIOR OF BLACKSMITH SHOP SECTION OF THE BETHLEHEM STEEL COMPANY SHIPYARD BLACKSMITH SHOP/BOILER SHOP. - Bethlehem Steel Company Shipyard, Blacksmith Shop-Boiler Shop, 1201-1321 Hudson Street, Hoboken, Hudson County, NJ

3. VIEW SOUTHNORTH ELEVATION OF BLACKSMITH SHOP SECTION OF THE ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

3. VIEW SOUTH-NORTH ELEVATION OF BLACKSMITH SHOP SECTION OF THE BETHLEHEM STEEL COMPANY SHIPYARD BLACKSMITH SHOP/BOILER SHOP. - Bethlehem Steel Company Shipyard, Blacksmith Shop-Boiler Shop, 1201-1321 Hudson Street, Hoboken, Hudson County, NJ

A Genetic Algorithm Tool (splicer) for Complex Scheduling Problems and the Space Station Freedom Resupply Problem

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.

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.

Vehicle and driver scheduling for public transit.

DOT National Transportation Integrated Search

2009-08-01

The problem of driver scheduling involves the construction of a legal set of shifts, including allowance : of overtime, which cover the blocks in a particular vehicle schedule. A shift is the work scheduled to be performed by : a driver in one day, w...

An Efficient Downlink Scheduling Strategy Using Normal Graphs for Multiuser MIMO Wireless Systems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh; Wu, Cheng-Hsuan; Lee, Yao-Nan; Wen, Chao-Kai

Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-input multiple-output scheduling problem into an LDPC-like problem using the normal graph. Based on the normal graph framework, soft information, which indicates the probability that each user will be scheduled to transmit packets at the access point through a specified angle-frequency sub-channel, is exchanged among the local processors to iteratively optimize the multiuser transmission schedule. Computer simulations show that the proposed algorithm can efficiently schedule simultaneous multiuser transmission which then increases the overall channel utilization and reduces the average packet delay.

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.

13. Interior detail, Blacksmith Shop, showing a portion of the ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

13. Interior detail, Blacksmith Shop, showing a portion of the original overhead belt drive system that powered machine tools in the adjacent Machine Shop, Roundhouse Machine Shop Extension, Southern Pacific Railroad Carlin Shops, view to west, 135mm lens. - Southern Pacific Railroad, Carlin Shops, Roundhouse Machine Shop Extension, Foot of Sixth Street, Carlin, Elko County, NV

5. VIEW EASTOPENING IN WEST ELEVATION OF BLACKSMITH SHOP SECTION ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

5. VIEW EAST-OPENING IN WEST ELEVATION OF BLACKSMITH SHOP SECTION OF THE BETHLEHEM STEEL COMPANY SHIPYARD BLACKSMITH SHOP/BOILER SHOP. - Bethlehem Steel Company Shipyard, Blacksmith Shop-Boiler Shop, 1201-1321 Hudson Street, Hoboken, Hudson County, NJ

Neighbor to Neighbor: An English as a Second Language Curriculum for Volunteers.

ERIC Educational Resources Information Center

Bailey, Elizabeth M.; Schaffer, Deborah L.

This curriculum is divided into eight modules: personal identification (name, native country, family, address, and telephone number); time and calendar (time, daily routine, days, and months); weather and seasons; shopping (money and price of clothes); location and direction; health (body parts, problems, and emergencies); housing…

Software Reviews: Programs Worth a Second Look.

ERIC Educational Resources Information Center

Classroom Computer Learning, 1989

1989-01-01

Reviews three computer software programs: (1) "The Children's Writing and Publishing Center"--writing and creative arts, grades 2-8, Apple II; (2) "Slide Shop"--graphics and desktop presentations, grades 4-12, Apple II and IBM; and (3) "Solve It"--problem solving and language arts, grades 4-12, Apple II. (MVL)

An Ontology for Learning Services on the Shop Floor

ERIC Educational Resources Information Center

Ullrich, Carsten

2016-01-01

An ontology expresses a common understanding of a domain that serves as a basis of communication between people or systems, and enables knowledge sharing, reuse of domain knowledge, reasoning and thus problem solving. In Technology-Enhanced Learning, especially in Intelligent Tutoring Systems and Adaptive Learning Environments, ontologies serve as…

Retail Flower Shop Operation and Management. A Student Handbook.

ERIC Educational Resources Information Center

Stinson, Richard F.; And Others

Field tested by teachers from the northeastern states who participated in a landscape horticulture teacher's institute July 5-22, 1966, this student reference is one of a series of instructional aids developed by the Pennsylvania State University Department of Agricultural Education. The content includes problem areas of: (1) Exploring…

An Approach to Teaching the Retail Advertising Course.

ERIC Educational Resources Information Center

Bowers, Thomas A.

One approach to teaching a college-level retail advertising course emphasizes the use of newspapers and shopping guides. The course objectives are (1) to acquaint students with practices and problems of retailing, with particular emphasis on promotion and advertising; (2) to acquaint them with ways local advertising media meet promotional and…

Eyes Wide Shopped: Shopping Situations Trigger Arousal in Impulsive Buyers

PubMed Central

Serfas, Benjamin G.; Büttner, Oliver B.; Florack, Arnd

2014-01-01

The present study proposes arousal as an important mechanism driving buying impulsiveness. We examined the effect of buying impulsiveness on arousal in non-shopping and shopping contexts. In an eye-tracking experiment, we measured pupil dilation while participants viewed and rated pictures of shopping scenes and non-shopping scenes. The results demonstrated that buying impulsiveness is closely associated with arousal as response to viewing pictures of shopping scenes. This pertained for hedonic shopping situations as well as for utilitarian shopping situations. Importantly, the effect did not emerge for non-shopping scenes. Furthermore, we demonstrated that arousal of impulsive buyers is independent from cognitive evaluation of scenes in the pictures. PMID:25489955

Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

NASA Astrophysics Data System (ADS)

Schumacher, André; Haanpää, Harri

We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximation algorithm by applying linear programming approximation techniques. Our algorithm is an application of the Garg-Könemann (GK) scheme that requires solving an instance of the minimum weight dominating set (MWDS) problem as a subroutine. Our two main contributions are a distributed implementation of the GK scheme for the sleep-scheduling problem and a novel asynchronous distributed algorithm for approximating MWDS based on a primal-dual analysis of Chvátal's set-cover algorithm. We evaluate our algorithm with ns2 simulations.

RIGGERS LOFT/PAINT SHOP/SHEET METAL SHOP, VIEW TO SOUTHEAST. THE PAINT ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

RIGGERS LOFT/PAINT SHOP/SHEET METAL SHOP, VIEW TO SOUTHEAST. THE PAINT SHOP WAS LOCATED IN THE CLOSEST CORNER OF THE BUILDING. THE SHEET METAL SHOP WAS LOCATED IN THE CORNER OF THE BUILDING ON THE RIGHT. THE RIGGERS LOFT WAS LOCATED IN THE PORTION OF THE BUILDING OUT OF VIEW TO THE LEFT - Rosie the Riveter National Historical Park, Riggers Loft/Paint Shop/Sheet Metal Shop, 1322 Canal Boulevard, Richmond, Contra Costa County, CA

Impeller Creation at the Fabrication Shop

NASA Image and Video Library

1950-10-21

A mechanic and apprentice work on a wooden impeller in the Fabrication Shop at the NACA Lewis Flight Propulsion Laboratory. The 260-person Fabrication Division created almost all of the equipment and models used at the laboratory. The Technical Services Building, referred to as the “Fab Shop”, contained a number of specialized shops in the 1940s and 1950s. These included a Machine Shop, Sheet Metal Shop, Wood and Pattern Shop, Instrument Shop, Thermocouple Shop, Heat Treating Shop, Metallurgical Laboratory, and Fabrication Office. The Machine Shop fabricated research equipment not commercially available. During World War II these technicians produced high-speed cameras for combustion research, impellers and other supercharger components, and key equipment for the lab’s first supersonic wind tunnel. The Wood and Pattern Shop created everything from control panels and cabinets to aircraft model molds for sheet metal work. The Sheet Metal Shop had the ability to work with 0.01 to 4-inches thick steel plates. The Instrument Shop specialized in miniature parts and instrumentation, while the Thermocouple Shop standardized the installation of pitot tubes and thermocouples. The Metallurgical Laboratory contained a control lab for the Heat Treating Shop and a service lab for the NACA Lewis research divisions. The Heat Treating Shop heated metal parts to optimize their physical properties and contained a Precision Castings Foundry to manufacture equipment made of heat resisting alloys.

Psychometric Properties of the Disability Assessment Schedule (DAS) for Behavior Problems: An Independent Investigation

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…

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

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.

1. GENERAL PERSPECTIVE VIEW FACING WEST SHOWING ERECTING SHOP ON ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. GENERAL PERSPECTIVE VIEW FACING WEST SHOWING ERECTING SHOP ON RIGHT, FOLLOWED BY THE MACHINE SHOP NO. 1, STOREHOUSE, AND MACHINE SHOP NO. 2 - Juniata Shops, Erecting Shop, East of Fourth Avenue at Third Street, Altoona, Blair County, PA

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.

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 for energy and reliability management on multiprocessor real-time systems

NASA Astrophysics Data System (ADS)

Qi, Xuan

Scheduling algorithms for multiprocessor real-time systems have been studied for years with many well-recognized algorithms proposed. However, it is still an evolving research area and many problems remain open due to their intrinsic complexities. With the emergence of multicore processors, it is necessary to re-investigate the scheduling problems and design/develop efficient algorithms for better system utilization, low scheduling overhead, high energy efficiency, and better system reliability. Focusing cluster schedulings with optimal global schedulers, we study the utilization bound and scheduling overhead for a class of cluster-optimal schedulers. Then, taking energy/power consumption into consideration, we developed energy-efficient scheduling algorithms for real-time systems, especially for the proliferating embedded systems with limited energy budget. As the commonly deployed energy-saving technique (e.g. dynamic voltage frequency scaling (DVFS)) will significantly affect system reliability, we study schedulers that have intelligent mechanisms to recuperate system reliability to satisfy the quality assurance requirements. Extensive simulation is conducted to evaluate the performance of the proposed algorithms on reduction of scheduling overhead, energy saving, and reliability improvement. The simulation results show that the proposed reliability-aware power management schemes could preserve the system reliability while still achieving substantial energy saving.

18. Interior detail, drill press and grinder, Machine Shop, Roundhouse ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

18. Interior detail, drill press and grinder, Machine Shop, Roundhouse Machine Shop Extension, Southern Pacific Railroad Carlin Shops, view to east (135mm lens). - Southern Pacific Railroad, Carlin Shops, Roundhouse Machine Shop Extension, Foot of Sixth Street, Carlin, Elko County, NV

19. Interior detail, grinder and drill press, Machine Shop, Roundhouse ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

19. Interior detail, grinder and drill press, Machine Shop, Roundhouse Machine Shop Extension, Southern Pacific Railroad Carlin Shops, view to south (135mm lens). - Southern Pacific Railroad, Carlin Shops, Roundhouse Machine Shop Extension, Foot of Sixth Street, Carlin, Elko County, NV

Dataflow Design Tool: User's Manual

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1996-01-01

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gali, Emmanuel; Eidenbenz, Stephan; Mniszewski, Sue

The United States' Department of Homeland Security aims to model, simulate, and analyze critical infrastructure and their interdependencies across multiple sectors such as electric power, telecommunications, water distribution, transportation, etc. We introduce ActivitySim, an activity simulator for a population of millions of individual agents each characterized by a set of demographic attributes that is based on US census data. ActivitySim generates daily schedules for each agent that consists of a sequence of activities, such as sleeping, shopping, working etc., each being scheduled at a geographic location, such as businesses or private residences that is appropriate for the activity type andmore » for the personal situation of the agent. ActivitySim has been developed as part of a larger effort to understand the interdependencies among national infrastructure networks and their demand profiles that emerge from the different activities of individuals in baseline scenarios as well as emergency scenarios, such as hurricane evacuations. We present the scalable software engineering principles underlying ActivitySim, the socia-technical modeling paradigms that drive the activity generation, and proof-of-principle results for a scenario in the Twin Cities, MN area of 2.6 M agents.« less

Heat Treat Shop in the Technical Services Building

NASA Image and Video Library

1948-01-21

A technician prepares a metal component for a high-temperature bake in the Heat Treatment Shop at the National Advisory Committee for Aeronautics (NACA) Lewis Flight Propulsion Laboratory. Fabrication Division under Dan White and John Dalgleish created almost all of the equipment and models used at the laboratory. The Technical Services Building, referred to as the Fab Shop, contained a number of specialized shops in the 1940s and 1950s. These included a Machine Shop, Sheet Metal Shop, Wood and Pattern Shop, Instrument Shop, Thermocouple Shop, Heat Treating Shop, Metallurgical Laboratory, and Fabrication Office. The Metallurgical Laboratory contained a control lab for the Heat Treating Shop and a service lab for the NACA Lewis research divisions. This metallurgical group performed tensile and impact tests on metals to determine their suitability for specific research or equipment. The Heat Treating Shop heated metal parts to optimize their physical properties and contained a Precision Castings Foundry to manufacture equipment made of heat resisting alloys.

Solving cyclical nurse scheduling problem using preemptive goal programming

NASA Astrophysics Data System (ADS)

Sundari, V. E.; Mardiyati, S.

2017-07-01

Nurse scheduling system in a hospital is being modeled as a preemptive goal programming problem that is solved by using LINGO software with the objective function to minimize deviation variable at each goal. The scheduling is done cyclically, so every nurse is treated fairly since they have the same work shift portion with the other nurses. By paying attention to the hospital's rules regarding nursing work shift cyclically, it can be obtained that numbers of nurse needed in every ward are 18 nurses and the numbers of scheduling periods are 18 periods where every period consists of 21 days.

29 CFR 779.320 - Partial list of establishments whose sales or service may be recognized as retail.

Code of Federal Regulations, 2014 CFR

2014-07-01

.... Antique shops. Auto courts. Automobile dealers' establishments. Automobile laundries. Automobile repair shops. Barber shops. Beauty shops. Bicycle shops. Billiard parlors. Book stores. Bowling alleys. Butcher shops. Cafeterias. Cemeteries. China, glassware stores. Cigar stores. Clothing stores. Coal yards...

29 CFR 779.320 - Partial list of establishments whose sales or service may be recognized as retail.

Code of Federal Regulations, 2011 CFR

2011-07-01

.... Antique shops. Auto courts. Automobile dealers' establishments. Automobile laundries. Automobile repair shops. Barber shops. Beauty shops. Bicycle shops. Billiard parlors. Book stores. Bowling alleys. Butcher shops. Cafeterias. Cemeteries. China, glassware stores. Cigar stores. Clothing stores. Coal yards...

29 CFR 779.320 - Partial list of establishments whose sales or service may be recognized as retail.

Code of Federal Regulations, 2013 CFR

2013-07-01

.... Antique shops. Auto courts. Automobile dealers' establishments. Automobile laundries. Automobile repair shops. Barber shops. Beauty shops. Bicycle shops. Billiard parlors. Book stores. Bowling alleys. Butcher shops. Cafeterias. Cemeteries. China, glassware stores. Cigar stores. Clothing stores. Coal yards...

29 CFR 779.320 - Partial list of establishments whose sales or service may be recognized as retail.

Code of Federal Regulations, 2012 CFR

2012-07-01

.... Antique shops. Auto courts. Automobile dealers' establishments. Automobile laundries. Automobile repair shops. Barber shops. Beauty shops. Bicycle shops. Billiard parlors. Book stores. Bowling alleys. Butcher shops. Cafeterias. Cemeteries. China, glassware stores. Cigar stores. Clothing stores. Coal yards...

29 CFR 779.320 - Partial list of establishments whose sales or service may be recognized as retail.

Code of Federal Regulations, 2010 CFR

2010-07-01

.... Antique shops. Auto courts. Automobile dealers' establishments. Automobile laundries. Automobile repair shops. Barber shops. Beauty shops. Bicycle shops. Billiard parlors. Book stores. Bowling alleys. Butcher shops. Cafeterias. Cemeteries. China, glassware stores. Cigar stores. Clothing stores. Coal yards...

Block Scheduling in High Schools.

ERIC Educational Resources Information Center

Irmsher, Karen

1996-01-01

Block Scheduling has been considered a cure for a lengthy list of educational problems. This report reviews the literature on block schedules and describes some Oregon high schools that have integrated block scheduling. Major disadvantages included resistance to change and requirements that teachers change their teaching strategies. There is…

Factors influencing food preparation behaviours: findings from focus groups with Mexican-American mothers in southern California.

PubMed

Smith, Teresa M; Dunton, Genevieve F; Pinard, Courtney A; Yaroch, Amy L

2016-04-01

The purpose of the present study was to explore food preparation behaviours, attitudes, meal planning and shopping among Mexican-American mothers. Data were collected through four focus groups with mothers of Mexican origin/ancestry who considered themselves to be the primary food preparer. Topics included food preparation behaviours and influencers (culture, family, attitudes, barriers, meal planning and shopping). Data were analysed using a qualitative grounded theory approach. All focus groups were audio recorded, transcribed verbatim and coded for themes. Data were collected in southern California, USA in 2013. Of the sample of twenty-one Mexican-American mothers, thirteen were born outside the USA and the mean household size was five members. Participants reported that food was often prepared using traditional staples and food preparation behaviours were learned from maternal family members. Participants also suggested that health was influenced by foods eaten and how they were prepared. Salient factors influencing food preparation behaviours included culture and tradition, maternal family members' food preparation behaviours, food preparation self-efficacy and attitudes towards healthy eating. Time and busy schedules were cited as barriers. Future interventions should consider utilizing family-based approaches and teaching culturally relevant food preparation skills, especially to youth, while reinforcing more healthful dietary practices.

Deadlock-free genetic scheduling algorithm for automated manufacturing systems based on deadlock control policy.

PubMed

Xing, KeYi; Han, LiBin; Zhou, MengChu; Wang, Feng

2012-06-01

Deadlock-free control and scheduling are vital for optimizing the performance of automated manufacturing systems (AMSs) with shared resources and route flexibility. Based on the Petri net models of AMSs, this paper embeds the optimal deadlock avoidance policy into the genetic algorithm and develops a novel deadlock-free genetic scheduling algorithm for AMSs. A possible solution of the scheduling problem is coded as a chromosome representation that is a permutation with repetition of parts. By using the one-step look-ahead method in the optimal deadlock control policy, the feasibility of a chromosome is checked, and infeasible chromosomes are amended into feasible ones, which can be easily decoded into a feasible deadlock-free schedule. The chromosome representation and polynomial complexity of checking and amending procedures together support the cooperative aspect of genetic search for scheduling problems strongly.

Education and Social Equity: With a Special Focus on Scheduled Castes and Scheduled Tribes in Elementary Education. CREATE Pathways to Access. Research Monograph No. 19

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…

Cost-efficient scheduling of FAST observations

NASA Astrophysics Data System (ADS)

Luo, Qi; Zhao, Laiping; Yu, Ce; Xiao, Jian; Sun, Jizhou; Zhu, Ming; Zhong, Yi

2018-03-01

A cost-efficient schedule for the Five-hundred-meter Aperture Spherical radio Telescope (FAST) requires to maximize the number of observable proposals and the overall scientific priority, and minimize the overall slew-cost generated by telescope shifting, while taking into account the constraints including the astronomical objects visibility, user-defined observable times, avoiding Radio Frequency Interference (RFI). In this contribution, first we solve the problem of maximizing the number of observable proposals and scientific priority by modeling it as a Minimum Cost Maximum Flow (MCMF) problem. The optimal schedule can be found by any MCMF solution algorithm. Then, for minimizing the slew-cost of the generated schedule, we devise a maximally-matchable edges detection-based method to reduce the problem size, and propose a backtracking algorithm to find the perfect matching with minimum slew-cost. Experiments on a real dataset from NASA/IPAC Extragalactic Database (NED) show that, the proposed scheduler can increase the usage of available times with high scientific priority and reduce the slew-cost significantly in a very short time.

Using the principles of circadian physiology enhances shift schedule design

DOE Office of Scientific and Technical Information (OSTI.GOV)

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 andmore » 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.« less

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.

EUROPA2: Plan Database Services for Planning and Scheduling Applications

NASA Technical Reports Server (NTRS)

Bedrax-Weiss, Tania; Frank, Jeremy; Jonsson, Ari; McGann, Conor

2004-01-01

NASA missions require solving a wide variety of planning and scheduling problems with temporal constraints; simple resources such as robotic arms, communications antennae and cameras; complex replenishable resources such as memory, power and fuel; and complex constraints on geometry, heat and lighting angles. Planners and schedulers that solve these problems are used in ground tools as well as onboard systems. The diversity of planning problems and applications of planners and schedulers precludes a one-size fits all solution. However, many of the underlying technologies are common across planning domains and applications. We describe CAPR, a formalism for planning that is general enough to cover a wide variety of planning and scheduling domains of interest to NASA. We then describe EUROPA(sub 2), a software framework implementing CAPR. EUROPA(sub 2) provides efficient, customizable Plan Database Services that enable the integration of CAPR into a wide variety of applications. We describe the design of EUROPA(sub 2) from the perspective of both modeling, customization and application integration to different classes of NASA missions.

Employee and customer handling of nicotine-containing e-liquids in vape shops.

PubMed

Garcia, Robert; Allem, Jon Patrick; Baezconde-Garbanati, Lourdes; Unger, Jennifer Beth; Sussman, Steve

2016-01-01

Vape shops sell electronic cigarettes and related products such as e-liquids, which may contain nicotine. Direct contact with nicotine can lead to adverse health effects, and few regulations exist on how nicotine is handled in vape shops. This study examined how customers and employees come into contact with, and handle, nicotine-containing e-liquids in vape shops with the goal of informing potential future regulation of nicotine handling in vape shops. Data were collected from 77 vape shops in the Los Angeles basin. Characteristics of the shops were documented by employee interviews and in store observations. Data collection was focused on shops located in areas with high concentrations of communities of interest; 20 shops from African-American communities, 17 from Hispanic communities, 18 from Korean communities, and 22 from non-Hispanic White communities. Half of the vape shops allowed customers to sample e-liquids with nicotine. Most of the shops (83%) provided self-service sampling stations for customers. A majority of shop employees (72%) reported that spills of e-liquids containing nicotine had occurred in the past. While 64% of the shops provided safety equipment, only 34% provided equipment for proper nicotine handling. Furthermore, 62% of shop employees reported handling nicotine without gloves or other safety equipment. Regulation on the handling of nicotine by customers and vape shop employees is important to prevent unsafe practices and subsequent injury. The frequent occurrence of spills and limited availability of safety equipment in vape shops highlights the need for the creation and enforcement of regulations to protect employees and customers. Appropriate safety training and equipment should be provided to employees to prevent accidental exposure to nicotine. Information on ways to safely handle nicotine should be communicated to vape shop employees and customers.

Employee and customer handling of nicotine-containing e-liquids in vape shops

PubMed Central

Garcia, Robert; Allem, Jon Patrick; Baezconde-Garbanati, Lourdes; Unger, Jennifer Beth; Sussman, Steve

2017-01-01

INTRODUCTION Vape shops sell electronic cigarettes and related products such as e-liquids, which may contain nicotine. Direct contact with nicotine can lead to adverse health effects, and few regulations exist on how nicotine is handled in vape shops. This study examined how customers and employees come into contact with, and handle, nicotine-containing e-liquids in vape shops with the goal of informing potential future regulation of nicotine handling in vape shops. METHODS Data were collected from 77 vape shops in the Los Angeles basin. Characteristics of the shops were documented by employee interviews and in store observations. Data collection was focused on shops located in areas with high concentrations of communities of interest; 20 shops from African-American communities, 17 from Hispanic communities, 18 from Korean communities, and 22 from non-Hispanic White communities. RESULTS Half of the vape shops allowed customers to sample e-liquids with nicotine. Most of the shops (83%) provided self-service sampling stations for customers. A majority of shop employees (72%) reported that spills of e-liquids containing nicotine had occurred in the past. While 64% of the shops provided safety equipment, only 34% provided equipment for proper nicotine handling. Furthermore, 62% of shop employees reported handling nicotine without gloves or other safety equipment. CONCLUSIONS Regulation on the handling of nicotine by customers and vape shop employees is important to prevent unsafe practices and subsequent injury. The frequent occurrence of spills and limited availability of safety equipment in vape shops highlights the need for the creation and enforcement of regulations to protect employees and customers. Appropriate safety training and equipment should be provided to employees to prevent accidental exposure to nicotine. Information on ways to safely handle nicotine should be communicated to vape shop employees and customers. PMID:28660255

Hypertext-based design of a user interface for scheduling

NASA Technical Reports Server (NTRS)

Woerner, Irene W.; Biefeld, Eric

1993-01-01

Operations Mission Planner (OMP) is an ongoing research project at JPL that utilizes AI techniques to create an intelligent, automated planning and scheduling system. The information space reflects the complexity and diversity of tasks necessary in most real-world scheduling problems. Thus the problem of the user interface is to present as much information as possible at a given moment and allow the user to quickly navigate through the various types of displays. This paper describes a design which applies the hypertext model to solve these user interface problems. The general paradigm is to provide maps and search queries to allow the user to quickly find an interesting conflict or problem, and then allow the user to navigate through the displays in a hypertext fashion.

Scheduling the resident 80-hour work week: an operations research algorithm.

PubMed

Day, T Eugene; Napoli, Joseph T; Kuo, Paul C

2006-01-01

The resident 80-hour work week requires that programs now schedule duty hours. Typically, scheduling is performed in an empirical "trial-and-error" fashion. However, this is a classic "scheduling" problem from the field of operations research (OR). It is similar to scheduling issues that airlines must face with pilots and planes routing through various airports at various times. The authors hypothesized that an OR approach using iterative computer algorithms could provide a rational scheduling solution. Institution-specific constraints of the residency problem were formulated. A total of 56 residents are rotating through 4 hospitals. Additional constraints were dictated by the Residency Review Committee (RRC) rules or the specific surgical service. For example, at Hospital 1, during the weekday hours between 6 am and 6 pm, there will be a PGY4 or PGY5 and a PGY2 or PGY3 on-duty to cover Service "A." A series of equations and logic statements was generated to satisfy all constraints and requirements. These were restated in the Optimization Programming Language used by the ILOG software suite for solving mixed integer programming problems. An integer programming solution was generated to this resource-constrained assignment problem. A total of 30,900 variables and 12,443 constraints were required. A total of man-hours of programming were used; computer run-time was 25.9 hours. A weekly schedule was generated for each resident that satisfied the RRC regulations while fulfilling all stated surgical service requirements. Each required between 64 and 80 weekly resident duty hours. The authors conclude that OR is a viable approach to schedule resident work hours. This technique is sufficiently robust to accommodate changes in resident numbers, service requirements, and service and hospital rotations.

ERECTING/MACHINE SHOP, CRANE ACCESS GANGWAY BETWEEN ERECTING (L) AND MACHINE ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

ERECTING/MACHINE SHOP, CRANE ACCESS GANGWAY BETWEEN ERECTING (L) AND MACHINE (R) SHOPS, LOOKING NORTH. - Southern Pacific, Sacramento Shops, Erecting Shop, 111 I Street, Sacramento, Sacramento County, CA

45 CFR 155.705 - Functions of a SHOP.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 45 Public Welfare 1 2014-10-01 2014-10-01 false Functions of a SHOP. 155.705 Section 155.705... Functions: Small Business Health Options Program (SHOP) § 155.705 Functions of a SHOP. (a) Exchange functions that apply to SHOP. The SHOP must carry out all the required functions of an Exchange described in...

45 CFR 155.720 - Enrollment of employees into QHPs under SHOP.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 45 Public Welfare 1 2014-10-01 2014-10-01 false Enrollment of employees into QHPs under SHOP. 155... ACT Exchange Functions: Small Business Health Options Program (SHOP) § 155.720 Enrollment of employees into QHPs under SHOP. (a) General requirements. The SHOP must process the SHOP single employee...

Integrated production and distribution scheduling problems related to fixed delivery departure dates and weights of late orders.

PubMed

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.

Scheduling Non-Preemptible Jobs to Minimize Peak Demand

DOE PAGES

Yaw, Sean; Mumey, Brendan

2017-10-28

Our paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We then focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the peak demand minimization problem, and has been previously shown tomore » be NP-hard. These results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show that these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.« less

Integrated Production and Distribution Scheduling Problems Related to Fixed Delivery Departure Dates and Weights of Late Orders

PubMed Central

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

Scheduling Non-Preemptible Jobs to Minimize Peak Demand

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yaw, Sean; Mumey, Brendan

Our paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We then focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the peak demand minimization problem, and has been previously shown tomore » be NP-hard. These results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show that these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.« less

A generalized network flow model for the multi-mode resource-constrained project scheduling problem with discounted cash flows

NASA Astrophysics Data System (ADS)

Chen, Miawjane; Yan, Shangyao; Wang, Sin-Siang; Liu, Chiu-Lan

2015-02-01

An effective project schedule is essential for enterprises to increase their efficiency of project execution, to maximize profit, and to minimize wastage of resources. Heuristic algorithms have been developed to efficiently solve the complicated multi-mode resource-constrained project scheduling problem with discounted cash flows (MRCPSPDCF) that characterize real problems. However, the solutions obtained in past studies have been approximate and are difficult to evaluate in terms of optimality. In this study, a generalized network flow model, embedded in a time-precedence network, is proposed to formulate the MRCPSPDCF with the payment at activity completion times. Mathematically, the model is formulated as an integer network flow problem with side constraints, which can be efficiently solved for optimality, using existing mathematical programming software. To evaluate the model performance, numerical tests are performed. The test results indicate that the model could be a useful planning tool for project scheduling in the real world.

MACHINE SHOP, WEST BAY, DETAIL OF COLUMN, BEAM, CRANE RAIL, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

MACHINE SHOP, WEST BAY, DETAIL OF COLUMN, BEAM, CRANE RAIL, AND TRUSS CONNECTION TO ERECTING SHOP, LOOKING NORTHWEST. - Southern Pacific, Sacramento Shops, Erecting Shop, 111 I Street, Sacramento, Sacramento County, CA

PRACTICAL: Planning and Resource Allocation in C2-Domains With Time Critical Algorithms (PRACTICAL: Planning en Allocatie in C2-Domeinen Met Tijdkritische Algoritmen)

DTIC Science & Technology

1993-02-01

the (re)planning framework, incorporating the demonstrators CALIGULA and ALLOCATOR for resource allocation and scheduling respectively. In the Command...demonstrator CALIGULA for the problem of allocating frequencies to a radio link network. The problems in the domain of scheduling are dealt with. which has...demonstrating the (re)planning framework, incorporating the demonstrators CALIGULA and ALLOCATOR for resource allocation and scheduling respectively

Intercell scheduling: A negotiation approach using multi-agent coalitions

NASA Astrophysics Data System (ADS)

Tian, Yunna; Li, Dongni; Zheng, Dan; Jia, Yunde

2016-10-01

Intercell scheduling problems arise as a result of intercell transfers in cellular manufacturing systems. Flexible intercell routes are considered in this article, and a coalition-based scheduling (CBS) approach using distributed multi-agent negotiation is developed. Taking advantage of the extended vision of the coalition agents, the global optimization is improved and the communication cost is reduced. The objective of the addressed problem is to minimize mean tardiness. Computational results show that, compared with the widely used combinatorial rules, CBS provides better performance not only in minimizing the objective, i.e. mean tardiness, but also in minimizing auxiliary measures such as maximum completion time, mean flow time and the ratio of tardy parts. Moreover, CBS is better than the existing intercell scheduling approach for the same problem with respect to the solution quality and computational costs.

Applied Mathematics, Tenth Grade. A Resource Manual.

ERIC Educational Resources Information Center

Baltimore County Public Schools, Towson, MD.

This resource manual is designed for use with tenth grade boys whose main interest lies in the shop and industrial arts areas. The course emphasizes mathematical problems inherent in various trades and industries. The primary objective is to motivate the student to apply, improve, and increase his computational skills. The manual is divided into…

Computer Labs Report to the Holodeck

ERIC Educational Resources Information Center

Raths, David

2011-01-01

In many ways, specialized computer labs are the black holes of IT organizations. Budgets, equipment, employees--even space itself--are sucked in. Given a choice, many IT shops would engage warp drive and escape their gravitational pull forever. While Captain Kirk might have looked to Scotty for a fix to the problem, colleges and universities are…

Global Trends in Workplace Learning

ERIC Educational Resources Information Center

Lee, Lung-Sheng; Lai, Chun-Chin

2012-01-01

The paradigm of human resource development has shifted to workplace learning and performance. Workplace can be an organization, an office, a kitchen, a shop, a farm, a website, even a home. Workplace learning is a dynamic process to solve workplace problems through learning. An identification of global trends of workplace learning can help us to…

A Term Project in Visual Basic: The Downhill Snowboard Shop

ERIC Educational Resources Information Center

Simkin, Mark G.

2007-01-01

Most commercial programming applications are considerably more complex than the end-of-chapter exercises found in programming textbooks. This case addresses this problem by requiring the students in entry-level Visual Basic programming classes to create an application that helps users order ski equipment from a retailer. For convenience, the forms…

West elevation of Machine Shop (Bldg. 163) north bay. Boiler ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

West elevation of Machine Shop (Bldg. 163) north bay. Boiler Shop (Bldg. 152) is at left - Atchison, Topeka, Santa Fe Railroad, Albuquerque Shops, Machine Shop, 908 Second Street, Southwest, Albuquerque, Bernalillo County, NM

The Cost of a Healthier Diet for Young Children With Type 1 Diabetes Mellitus.

PubMed

Patton, Susana R; Goggin, Kathy; Clements, Mark A

2015-01-01

This study used a market-basket approach to examine the availability and cost of a standard food shopping list (R-TFP) vs a healthier food shopping list (H-TFP) in the grocery stores used by a sample of 23 families of young children with type 1 diabetes mellitus (T1DM). The researchers used frequency counts to measure availability. The average cost of the R-TFP and H-TFP was compared using paired t test. Small or independent markets had the highest percentage of missing foods (14%), followed by chain supermarkets (3%) and big box stores (2%). There was a significant difference in average cost for the R-TFP vs the H-TFP ($324.71 and $380.07, respectively; P < .001). Families may encounter problems finding healthier foods and/or incur greater costs for healthier foods. Nutrition education programs for T1DM need to teach problem solving to help families overcome these barriers. Copyright © 2015 Society for Nutrition Education and Behavior. Published by Elsevier Inc. All rights reserved.

A Gender Identification System for Customers in a Shop Using Infrared Area Scanners

NASA Astrophysics Data System (ADS)

Tajima, Takuya; Kimura, Haruhiko; Abe, Takehiko; Abe, Koji; Nakamoto, Yoshinori

Information about customers in shops plays an important role in marketing analysis. Currently, in convenience stores and supermarkets, the identification of customer's gender is examined by clerks. On the other hand, gender identification systems using camera images are investigated. However, these systems have a problem of invading human privacies in identifying attributes of customers. The proposed system identifies gender by using infrared area scanners and Bayesian network. In the proposed system, since infrared area scanners do not take customers' images directly, invasion of privacies are not occurred. The proposed method uses three parameters of height, walking speed and pace for humans. In general, it is shown that these parameters have factors of sexual distinction in humans, and Bayesian network is designed with these three parameters. The proposed method resolves the existent problems of restricting the locations where the systems are set and invading human privacies. Experimental results using data obtained from 450 people show that the identification rate for the proposed method was 91.3% on the average of both of male and female identifications.

20. MACHINE SHOP, LOOKING SOUTH. SHOP IS EQUIPPED WITH A ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

20. MACHINE SHOP, LOOKING SOUTH. SHOP IS EQUIPPED WITH A 25-TON SHAW CRANE TO HANDLE PARTS FROM RAIL CARS INTO THE SHOP. MACHINE SHOP HANDLES ALL NECESSARY REPAIR WORK ON THE DOCK MACHINERY. - Pennsylvania Railway Ore Dock, Lake Erie at Whiskey Island, approximately 1.5 miles west of Public Square, Cleveland, Cuyahoga County, OH

Prevalence and determinants of pharmacy shopping behaviour.

PubMed

Buurma, H; Bouvy, M L; De Smet, P A G M; Floor-Schreudering, A; Leufkens, H G M; Egberts, A C G

2008-02-01

Discontinuity of care bears the risk of medication errors and poor clinical outcomes. Little is known about the continuity of care related to pharmacies. Therefore, we studied the prevalence and determinants of pharmacy shopping behaviour in the Netherlands. Beneficiaries from a Dutch pharmacy claims database who had visited two or more pharmacies in 2001 were indicated as 'shoppers' (n = 45 805). A random sample was taken from all the other beneficiaries who had received at least one prescription: 'non-shoppers' (n = 45 805). Shoppers were classified as light (all patients who visited more than one pharmacy at least once in 2001, except for patients defined as heavy or moderate shoppers), moderate (visited 3 or 4 pharmacies and had proportion of prescriptions elsewhere >10% and number of prescriptions elsewhere >10) or heavy (visited 5 or more pharmacies and had proportion of prescriptions elsewhere >10% and number of prescriptions elsewhere >10). Determinants of shopping behaviour were investigated as well as the association between any dispensing of Anatomical Therapeutic Chemical (ATC) classes of drugs and this behaviour. 10.8% beneficiaries were identified as shoppers: 98.8%'light shoppers', 1.0%'moderate shoppers' and 0.2%'heavy shoppers'. Female gender [odds ratio (OR)(adj) 1.2; 95% confidence interval (CI) 1.1-1.2], younger age (OR(adj) 1.7; 95%CI 1.7-1.8), the use of > or =3 drugs (OR(adj) 2.9; 95%CI 2.8-3.0) and visiting different kind of prescribers (OR(adj) 2.4; 95%CI 2.4-2.5) were associated with shopping behaviour. Shoppers more frequently received at least one prescription for systemic anti-infectives (51.7% vs. 30.8%; OR 2.4; 95%Cl 2.3-2.5) and for nervous system drugs (46.2% vs. 29.3%; OR 2.1; 95%Cl 2.0-2.1). Pharmacy shopping behaviour is limited in the Netherlands. However, it may put the patient at risk for unintentional problems, such as drug-drug interactions with anti-infectives. A small proportion of patients exhibit possibly intentional shopping behaviour with psychotropic drugs.

5. Northwest elevation, Roundhouse Machine Shop Extension, Southern Pacific Railroad ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

5. Northwest elevation, Roundhouse Machine Shop Extension, Southern Pacific Railroad Carlin Shops, view to southeast (90mm lens). - Southern Pacific Railroad, Carlin Shops, Roundhouse Machine Shop Extension, Foot of Sixth Street, Carlin, Elko County, NV

4. Southwest end, Roundhouse Machine Shop Extension, Southern Pacific Railroad ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

4. Southwest end, Roundhouse Machine Shop Extension, Southern Pacific Railroad Carlin Shops, view to northeast (135mm lens). - Southern Pacific Railroad, Carlin Shops, Roundhouse Machine Shop Extension, Foot of Sixth Street, Carlin, Elko County, NV

Looking northeast from roof of Machine Shop (Bldg. 163) at ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

Looking northeast from roof of Machine Shop (Bldg. 163) at transfer table pit and Boiler Shop (Bldg. 152) - Atchison, Topeka, Santa Fe Railroad, Albuquerque Shops, Machine Shop, 908 Second Street, Southwest, Albuquerque, Bernalillo County, NM

21. VIEW OF AXLE AND WHEEL ASSEMBLY STORAGE AREA, adjacent ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

21. VIEW OF AXLE AND WHEEL ASSEMBLY STORAGE AREA, adjacent to Erecting Shop and Machine Shop. - Juniata Shops, Erecting Shop & Machine Shop, East of Fourth Avenue, between Fourth & Fifth Streets, Altoona, Blair County, PA

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.

Multi-Objective Approach for Energy-Aware Workflow Scheduling in Cloud Computing Environments

PubMed Central

Kadima, Hubert; Granado, Bertrand

2013-01-01

We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service) requirements. Traditional research in workflow scheduling mainly focuses on the optimization constrained by time or cost without paying attention to energy consumption. The main contribution of this study is to propose a new approach for multi-objective workflow scheduling in clouds, and present the hybrid PSO algorithm to optimize the scheduling performance. Our method is based on the Dynamic Voltage and Frequency Scaling (DVFS) technique to minimize energy consumption. This technique allows processors to operate in different voltage supply levels by sacrificing clock frequencies. This multiple voltage involves a compromise between the quality of schedules and energy. Simulation results on synthetic and real-world scientific applications highlight the robust performance of the proposed approach. PMID:24319361

Multi-objective approach for energy-aware workflow scheduling in cloud computing environments.

PubMed

Yassa, Sonia; Chelouah, Rachid; Kadima, Hubert; Granado, Bertrand

2013-01-01

We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service) requirements. Traditional research in workflow scheduling mainly focuses on the optimization constrained by time or cost without paying attention to energy consumption. The main contribution of this study is to propose a new approach for multi-objective workflow scheduling in clouds, and present the hybrid PSO algorithm to optimize the scheduling performance. Our method is based on the Dynamic Voltage and Frequency Scaling (DVFS) technique to minimize energy consumption. This technique allows processors to operate in different voltage supply levels by sacrificing clock frequencies. This multiple voltage involves a compromise between the quality of schedules and energy. Simulation results on synthetic and real-world scientific applications highlight the robust performance of the proposed approach.

Scheduling IT Staff at a Bank: A Mathematical Programming Approach

PubMed Central

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