WorldWideScience

Sample records for related scheduling problems

  1. A RELATIONAL DATABASE APPROACH TO THE JOB SHOP SCHEDULING PROBLEM

    Directory of Open Access Journals (Sweden)

    P. Lindeque

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: This paper will attempt to illuminate the advantages of an approach to the job shop scheduling problem using priority based search algorithms and database technology. It will use as basis a system developed for and implemented at a large manufacturing plant. The paper will also attempt to make some predictions as to future developments in these techniques and look at the possibility of including new technologies such as expert systems.

    AFRIKAANSE OPSOMMING: Die voordele en toepaslikheid van prioriteits-gebaseerde soek-algoritmes en databasisstelsels op die taakwerkswinkelprobleem sal in hierdie artikel uitgelig word. 'n Stelsel wat by 'n groot vervaardigingsonderneming geimplementeer is, sal as uitgangspunt gebruik word. Toekomstige ontwikkelings in bogenoemde tegnieke en die moontlike insluiting van ekspertstelsels sal ook ondersoek word.

  2. Exact methods for time constrained routing and related scheduling problems

    DEFF Research Database (Denmark)

    Kohl, Niklas

    1995-01-01

    of customers. In the VRPTW customers must be serviced within a given time period - a so called time window. The objective can be to minimize operating costs (e.g. distance travelled), fixed costs (e.g. the number of vehicles needed) or a combination of these component costs. During the last decade optimization......This dissertation presents a number of optimization methods for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP), where a fleet of vehicles based at a central depot must service a set...... of J?rnsten, Madsen and S?rensen (1986), which has been tested computationally by Halse (1992). Both methods decompose the problem into a series of time and capacity constrained shotest path problems. This yields a tight lower bound on the optimal objective, and the dual gap can often be closed...

  3. The triangle scheduling problem

    NARCIS (Netherlands)

    Dürr, Christoph; Hanzálek, Zdeněk; Konrad, Christian; Seddik, Yasmina; Sitters, R.A.; Vásquez, Óscar C.; Woeginger, Gerhard

    2017-01-01

    This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the Greedy algorithm solves the problem to

  4. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    couple of decades. To deliver competitive service and price, transportation today needs to be cost effective. A company requiring for things to be shipped will aim at having the freight shipped as cheaply as possible while often satisfying certain time constraints. For the transportation company......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... set cost making the cost of the individual vehicle routes inter-dependant. Depending on the problem type, the size of the problems and time available for solving, different solution methods can be applicable. In this thesis both heuristic methods and several exact methods are investigated depending...

  5. The Vessel Schedule Recovery Problem

    DEFF Research Database (Denmark)

    Brouer, Berit Dangaard; Plum, Christian Edinger Munk; Vaaben, Bo

    Maritime transportation is the backbone of world trade and is accountable for around 3% of the worlds CO2 emissions. We present the Vessel Schedule Recovery Problem (VSRP) to evaluate a given disruption scenario and to select a recovery action balancing the trade off between increased bunker cons...... consumption and the impact on the remaining network and the customer service level. The model is applied to 4 real cases from Maersk Line. Solutions are comparable or superior to those chosen by operations managers. Cost savings of up to 58% may be achieved.......Maritime transportation is the backbone of world trade and is accountable for around 3% of the worlds CO2 emissions. We present the Vessel Schedule Recovery Problem (VSRP) to evaluate a given disruption scenario and to select a recovery action balancing the trade off between increased bunker...

  6. Some extensions of the discrete lotsizing and scheduling problem

    NARCIS (Netherlands)

    M. Salomon (Marc); L.G. Kroon (Leo); R. Kuik (Roelof); L.N. van Wassenhove (Luk)

    1991-01-01

    textabstractIn this paper the Discrete Lotsizing and Scheduling Problem (DLSP) is considered. DLSP relates to capacitated lotsizing as well as to job scheduling problems and is concerned with determining a feasible production schedule with minimal total costs in a single-stage manufacturing process.

  7. Constraint-based scheduling applying constraint programming to scheduling problems

    CERN Document Server

    Baptiste, Philippe; Nuijten, Wim

    2001-01-01

    Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...

  8. Integrated network design and scheduling problems :

    Energy Technology Data Exchange (ETDEWEB)

    Nurre, Sarah G.; Carlson, Jeffrey J.

    2014-01-01

    We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

  9. Algorithms for classical and modern scheduling problems

    OpenAIRE

    Ott, Sebastian

    2016-01-01

    Subject of this thesis is the design and the analysis of algorithms for scheduling problems. In the first part, we focus on energy-efficient scheduling, where one seeks to minimize the energy needed for processing certain jobs via dynamic adjustments of the processing speed (speed scaling). We consider variations and extensions of the standard model introduced by Yao, Demers, and Shenker in 1995 [79], including the addition of a sleep state, the avoidance of preemption, and variable speed lim...

  10. Problem specific heuristics for group scheduling problems in cellular manufacturing

    OpenAIRE

    Neufeld, Janis Sebastian

    2016-01-01

    The group scheduling problem commonly arises in cellular manufacturing systems, where parts are grouped into part families. It is characterized by a sequencing task on two levels: on the one hand, a sequence of jobs within each part family has to be identified while, on the other hand, a family sequence has to be determined. In order to solve this NP-hard problem usually heuristic solution approaches are used. In this thesis different aspects of group scheduling are discussed and problem spec...

  11. Algorithms for Scheduling and Network Problems

    Science.gov (United States)

    1991-09-01

    time. We already know, by Lemma 2.2.1, that WOPT = O(log( mpU )), so if we could solve this integer program optimally we would be done. However, the...Folydirat, 15:177-191, 1982. [6] I.S. Belov and Ya. N. Stolin. An algorithm in a single path operations scheduling problem. In Mathematical Economics and

  12. Approximating multi-objective scheduling problems

    NARCIS (Netherlands)

    Dabia, S.; Talbi, El-Ghazali; Woensel, van T.; Kok, de A.G.

    2013-01-01

    In many practical situations, decisions are multi-objective by nature. In this paper, we propose a generic approach to deal with multi-objective scheduling problems (MOSPs). The aim is to determine the set of Pareto solutions that represent the interactions between the different objectives. Due to

  13. Flexible job shop scheduling problem in manufacturing

    OpenAIRE

    Curralo, Ana; Pereira, Ana I.; Barbosa, José; Leitão, Paulo

    2013-01-01

    This paper addresses a real assembly cell: the AIP-PRIMECA cell at the Université de Valenciennes et du Hainaut-Cambrésis, in France. This system can be viewed as a Flexible Job Shop, leading to the formulation of a Flexible Job Shop Scheduling Problem (FJSSP).

  14. The Home Care Crew Scheduling Problem:

    DEFF Research Database (Denmark)

    Rasmussen, Matias Sevel; Justesen, Tor; Dohn, Anders

    In the Home Care Crew Scheduling Problem a staff of caretakers has to be assigned a number of visits to patients' homes, such that the overall service level is maximised. The problem is a generalisation of the vehicle routing problem with time windows. Required travel time between visits and time...... preference constraints. The algorithm is tested both on real-life problem instances and on generated test instances inspired by realistic settings. The use of the specialised branching scheme on real-life problems is novel. The visit clustering decreases run times significantly, and only gives a loss...... windows of the visits must be respected. The challenge when assigning visits to caretakers lies in the existence of soft preference constraints and in temporal dependencies between the start times of visits. We model the problem as a set partitioning problem with side constraints and develop an exact...

  15. Optimization of the solution of the problem of scheduling theory ...

    African Journals Online (AJOL)

    This article describes the genetic algorithm used to solve the problem related to the scheduling theory. A large number of different methods is described in the scientific literature. The main issue that faced the problem in question is that it is necessary to search the optimal solution in a large search space for the set of ...

  16. The Home Care Crew Scheduling Problem

    DEFF Research Database (Denmark)

    Rasmussen, Matias Sevel; Justesen, Tor

    In the Home Care Crew Scheduling Problem (HCCSP) a staff of caretakers has to be assigned a number of visits, such that the total number of assigned visits is maximised. The visits have different locations and positions in time, and travelling time and time windows must be respected. The challenge...... when assigning visits to caretakers lies in the existence of soft constraints and indeed also in temporal dependencies between the starting times of visits. Most former approaches to solving the HCCSP involve the use of heuristic methods. Here we develop an exact branch-and-price algorithm that uses...... clustering of the visits based on the problem structure. The algorithm is tested on real-life problem instances and we obtain solutions that are better than current practice in all cases....

  17. Cooperated Bayesian algorithm for distributed scheduling problem

    Institute of Scientific and Technical Information of China (English)

    QIANG Lei; XIAO Tian-yuan

    2006-01-01

    This paper presents a new distributed Bayesian optimization algorithm (BOA) to overcome the efficiency problem when solving NP scheduling problems.The proposed approach integrates BOA into the co-evolutionary schema,which builds up a concurrent computing environment.A new search strategy is also introduced for local optimization process.It integrates the reinforcement learning(RL) mechanism into the BOA search processes,and then uses the mixed probability information from BOA (post-probability) and RL (pre-probability) to enhance the cooperation between different local controllers,which improves the optimization ability of the algorithm.The experiment shows that the new algorithm does better in both optimization (2.2%) and convergence (11.7%),compared with classic BOA.

  18. Distributing Flexibility to Enhance Robustness in Task Scheduling Problems

    NARCIS (Netherlands)

    Wilmer, D.; Klos, T.B.; Wilson, M.

    2013-01-01

    Temporal scheduling problems occur naturally in many diverse application domains such as manufacturing, transportation, health and education. A scheduling problem arises if we have a set of temporal events (or variables) and some constraints on those events, and we have to find a schedule, which is

  19. Unit-time scheduling problems with time dependent resources

    NARCIS (Netherlands)

    Tautenhahn, T.; Woeginger, G.

    1997-01-01

    We investigate the computational complexity of scheduling problems, where the operations consume certain amounts of renewable resources which are available in time-dependent quantities. In particular, we consider unit-time open shop problems and unit-time scheduling problems with identical parallel

  20. Solving a chemical batch scheduling problem by local search

    NARCIS (Netherlands)

    Brucker, P.; Hurink, Johann L.

    1999-01-01

    A chemical batch scheduling problem is modelled in two different ways as a discrete optimization problem. Both models are used to solve the batch scheduling problem in a two-phase tabu search procedure. The method is tested on real-world data.

  1. Solving project scheduling problems by minimum cut computations

    NARCIS (Netherlands)

    Möhring, R.H.; Schulz, A.S.; Stork, F.; Uetz, Marc Jochen

    In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in

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

    Science.gov (United States)

    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.

  3. The Liner Shipping Routing and Scheduling Problem Under Environmental Considerations

    DEFF Research Database (Denmark)

    Dithmer, Philip; Reinhardt, Line Blander; Kontovas, Christos

    2017-01-01

    This paper deals with the Liner Shipping Routing and Scheduling Problem (LSRSP), which consists of designing the time schedule for a vessel to visit a fixed set of ports while minimizing costs. We extend the classical problem to include the external cost of ship air emissions and we present some...

  4. Job shop scheduling problem with late work criterion

    Science.gov (United States)

    Piroozfard, Hamed; Wong, Kuan Yew

    2015-05-01

    Scheduling is considered as a key task in many industries, such as project based scheduling, crew scheduling, flight scheduling, machine scheduling, etc. In the machine scheduling area, the job shop scheduling problems are considered to be important and highly complex, in which they are characterized as NP-hard. The job shop scheduling problems with late work criterion and non-preemptive jobs are addressed in this paper. Late work criterion is a fairly new objective function. It is a qualitative measure and concerns with late parts of the jobs, unlike classical objective functions that are quantitative measures. In this work, simulated annealing was presented to solve the scheduling problem. In addition, operation based representation was used to encode the solution, and a neighbourhood search structure was employed to search for the new solutions. The case studies are Lawrence instances that were taken from the Operations Research Library. Computational results of this probabilistic meta-heuristic algorithm were compared with a conventional genetic algorithm, and a conclusion was made based on the algorithm and problem.

  5. Flow-shop scheduling problem under uncertainties: Review and trends

    OpenAIRE

    Eliana María González-Neira; Jairo R. Montoya-Torres; David Barrera

    2017-01-01

    Among the different tasks in production logistics, job scheduling is one of the most important at the operational decision-making level to enable organizations to achieve competiveness. Scheduling consists in the allocation of limited resources to activities over time in order to achieve one or more optimization objectives. Flow-shop (FS) scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow. This type of co...

  6. Dynamic Scheduling for Cloud Reliability using Transportation Problem

    OpenAIRE

    P. Balasubramanie; S. K. Senthil Kumar

    2012-01-01

    Problem statement: Cloud is purely a dynamic environment and the existing task scheduling algorithms are mostly static and considered various parameters like time, cost, make span, speed, scalability, throughput, resource utilization, scheduling success rate and so on. Available scheduling algorithms are mostly heuristic in nature and more complex, time consuming and does not consider reliability and availability of the cloud computing environment. Therefore there is a need to implement a sch...

  7. Heuristic Method for Decision-Making in Common Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Edyta Kucharska

    2017-10-01

    Full Text Available The aim of the paper is to present a heuristic method for decision-making regarding an NP-hard scheduling problem with limitations related to tasks and the resources dependent on the current state of the process. The presented approach is based on the algebraic-logical meta-model (ALMM, which enables making collective decisions in successive process stages, not separately for individual objects or executors. Moreover, taking into account the limitations of the problem, it involves constructing only an acceptable solution and significantly reduces the amount of calculations. A general algorithm based on the presented method is composed of the following elements: preliminary analysis of the problem, techniques for the choice of decision at a given state, the pruning non-perspective trajectory, selection technique of the initial state for the trajectory final part, and the trajectory generation parameters modification. The paper includes applications of the presented approach to scheduling problems on unrelated parallel machines with a deadline and machine setup time dependent on the process state, where the relationship between tasks is defined by the graph. The article also presents the results of computational experiments.

  8. A DIFFERENTIAL EVOLUTION ALGORITHM DEVELOPED FOR A NURSE SCHEDULING PROBLEM

    Directory of Open Access Journals (Sweden)

    Shahnazari-Shahrezaei, P.

    2012-11-01

    Full Text Available Nurse scheduling is a type of manpower allocation problem that tries to satisfy hospital managers objectives and nurses preferences as much as possible by generating fair shift schedules. This paper presents a nurse scheduling problem based on a real case study, and proposes two meta-heuristics a differential evolution algorithm (DE and a greedy randomised adaptive search procedure (GRASP to solve it. To investigate the efficiency of the proposed algorithms, two problems are solved. Furthermore, some comparison metrics are applied to examine the reliability of the proposed algorithms. The computational results in this paper show that the proposed DE outperforms the GRASP.

  9. A review of scheduling problem and resolution methods in flexible flow shop

    Directory of Open Access Journals (Sweden)

    Tian-Soon Lee

    2019-01-01

    Full Text Available The Flexible flow shop (FFS is defined as a multi-stage flow shops with multiple parallel machines. FFS scheduling problem is a complex combinatorial problem which has been intensively studied in many real world industries. This review paper gives a comprehensive exploration review on the FFS scheduling problem and guides the reader by considering and understanding different environmental assumptions, system constraints and objective functions for future research works. The published papers are classified into two categories. First is the FFS system characteristics and constraints including the problem differences and limitation defined by different studies. Second, the scheduling performances evaluation are elaborated and categorized into time, job and multi related objectives. In addition, the resolution approaches that have been used to solve FFS scheduling problems are discussed. This paper gives a comprehensive guide for the reader with respect to future research work on the FFS scheduling problem.

  10. An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems

    Directory of Open Access Journals (Sweden)

    Chandramouli Anandaraman

    2011-10-01

    Full Text Available Job Shop Scheduling Problem (JSSP and Flow Shop Scheduling Problem (FSSP are strong NP-complete combinatorial optimization problems among class of typical production scheduling problems. An improved Sheep Flock Heredity Algorithm (ISFHA is proposed in this paper to find a schedule of operations that can minimize makespan. In ISFHA, the pairwise mutation operation is replaced by a single point mutation process with a probabilistic property which guarantees the feasibility of the solutions in the local search domain. A Robust-Replace (R-R heuristic is introduced in place of chromosomal crossover to enhance the global search and to improve the convergence. The R-R heuristic is found to enhance the exploring potential of the algorithm and enrich the diversity of neighborhoods. Experimental results reveal the effectiveness of the proposed algorithm, whose optimization performance is markedly superior to that of genetic algorithms and is comparable to the best results reported in the literature.

  11. Solving University Scheduling Problem Using Hybrid Approach

    Directory of Open Access Journals (Sweden)

    Aftab Ahmed Shaikh

    2011-10-01

    Full Text Available In universities scheduling curriculum activity is an essential job. Primarily, scheduling is a distribution of limited resources under interrelated constraints. The set of hard constraints demand the highest priority and should not to be violated at any cost, while the maximum soft constraints satisfaction mounts the quality scale of solution. In this research paper, a novel bisected approach is introduced that is comprisesd of GA (Genetic Algorithm as well as Backtracking Recursive Search. The employed technique deals with both hard and soft constraints successively. The first phase decisively is focused over elimination of all the hard constraints bounded violations and eventually produces partial solution for subsequent step. The second phase is supposed to draw the best possible solution on the search space. Promising results are obtained by implementation on the real dataset. The key points of the research approach are to get assurance of hard constraints removal from the dataset and minimizing computational time for GA by initializing pre-processed set of chromosomes.

  12. Hybrid IP/CP Methods for Solving Sports Scheduling Problems

    DEFF Research Database (Denmark)

    Rasmussen, Rasmus Vinther

    2006-01-01

    The field of sports scheduling comprises a challenging research areawith a great variety of hard combinatorial optimization problems andchallenging practical applications. This dissertation gives acomprehensive survey of the area and a number of new contributionsare presented. First a general sol...

  13. The application of artificial intelligence to astronomical scheduling problems

    Science.gov (United States)

    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

  14. Flow-shop scheduling problem under uncertainties: Review and trends

    Directory of Open Access Journals (Sweden)

    Eliana María González-Neira

    2017-03-01

    Full Text Available Among the different tasks in production logistics, job scheduling is one of the most important at the operational decision-making level to enable organizations to achieve competiveness. Scheduling consists in the allocation of limited resources to activities over time in order to achieve one or more optimization objectives. Flow-shop (FS scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow. This type of configuration includes assembly lines and the chemical, electronic, food, and metallurgical industries, among others. Scheduling has been mostly investigated for the deterministic cases, in which all parameters are known in advance and do not vary over time. Nevertheless, in real-world situations, events are frequently subject to uncertainties that can affect the decision-making process. Thus, it is important to study scheduling and sequencing activities under uncertainties since they can cause infeasibilities and disturbances. The purpose of this paper is to provide a general overview of the FS scheduling problem under uncertainties and its role in production logistics and to draw up opportunities for further research. To this end, 100 papers about FS and flexible flow-shop scheduling problems published from 2001 to October 2016 were analyzed and classified. Trends in the reviewed literature are presented and finally some research opportunities in the field are proposed.

  15. Reachability problems in scheduling and planning

    NARCIS (Netherlands)

    Eggermont, C.E.J.

    2012-01-01

    Reachability problems are fundamental in the context of many mathematical models and abstractions which describe various computational processes. Intuitively, when many objects move within a shared environment, objects may have to wait for others before moving and so slow down, or objects may even

  16. The Application of Artificial Intelligence to Astronomical Scheduling Problems

    Science.gov (United States)

    Johnston, Mark D.

    1993-01-01

    As artificial intelligence (AI) technology has moved from the research laboratory into more and more widespread use, one of the leading applications in astronomy has been to high-profile observation scheduling. The Spike scheduling system was developed by the Space Telescope Science Institute (STScI) for the purpose of long-range scheduling of Hubble Space Telescope (HST). Spike has been in daily operational use at STScI since well before HST launch in April 1990. The system has also been adapted to schedule other missions: one of these missions (EUVE) is currently operational, while another (ASTRO-D) will be launched in February 1993. Some other future space astronomy missions (XTE, SWAS, and AXAF) are making tentative plans to use Spike. Spike has proven to be a powerful and flexible scheduling framework with applicability to a wide variety of problems.

  17. Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling

    Science.gov (United States)

    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.

  18. Solving cyclical nurse scheduling problem using preemptive goal programming

    Science.gov (United States)

    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.

  19. The Simultaneous Vehicle Scheduling and Passenger Service Problem

    DEFF Research Database (Denmark)

    Petersen, Hanne Løhmann; Larsen, Allan; Madsen, Oli B.G.

    modifications of the timetable during the vehicle scheduling phase. This planning approach is referred to as the Simultaneous Vehicle Scheduling and Passenger Service Problem (SVSPSP). The SVSPSP is solved using a large neighbourhood search metaheuristic. The proposed framework is tested on data inspired......Passengers using public transport systems often experience waiting times when transferring between two scheduled services. We propose a planning approach which seeks to obtain a favorable trade-off between the conflicting objectives passenger service and operating cost, by allowing some moderate...

  20. Solving a manpower scheduling problem for airline catering using metaheuristics

    DEFF Research Database (Denmark)

    Ho, Sin C.; Leung, Janny M. Y.

    2010-01-01

    We study a manpower scheduling problem with job time-windows and job-skills compatibility constraints. This problem is motivated by airline catering operations, whereby airline meals and other supplies are delivered to aircrafts on the tarmac just before the flights take-off.  Jobs (flights) must...

  1. Flexible ship loading problem with transfer vehicle assignment and scheduling

    DEFF Research Database (Denmark)

    Iris, Çağatay; Christensen, Jonas; Pacino, Dario

    2018-01-01

    This paper presents the flexible containership loading problem for seaport container terminals. The integrated management of loading operations, planning of the transport vehicles to use and their scheduling is what we define as the Flexible Ship Loading Problem (FSLP). The flexibility comes from...

  2. The Simultaneous Vehicle Scheduling and Passenger Service Problem

    DEFF Research Database (Denmark)

    Petersen, Hanne Løhmann; Larsen, Allan; Madsen, Oli B.G.

    2013-01-01

    , by modifying the timetable. The planning approach is referred to as the simultaneous vehicle scheduling and passenger service problem (SVSPSP). The SVSPSP is modelled as an integer programming problem and solved using a large neighborhood search metaheuristic. The proposed framework is tested on data inspired......Passengers using public transport systems often experience waiting times when transferring between two scheduled services. In this paper we propose a planning approach that seeks to obtain a favourable trade-off between the two contrasting objectives, passenger service and operating cost...

  3. Solving Large Scale Crew Scheduling Problems in Practice

    NARCIS (Netherlands)

    E.J.W. Abbink (Erwin); L. Albino; T.A.B. Dollevoet (Twan); D. Huisman (Dennis); J. Roussado; R.L. Saldanha

    2010-01-01

    textabstractThis paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). NS operates about 30,000 trains a week. All these trains need a driver and a certain number of guards. Some labor rules restrict the duties of a certain crew base

  4. On the Integrated Job Scheduling and Constrained Network Routing Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    This paper examines the NP-hard problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job demands a number of resources, which must be sent to the executing machine via constrained paths. Furthermore, two resource demand...

  5. Classification of Ship Routing and Scheduling Problems in Liner Shipping

    DEFF Research Database (Denmark)

    Kjeldsen, Karina Hjortshøj

    2011-01-01

    This article provides a classification scheme for ship routing and scheduling problems in liner shipping in line with the current and future operational conditions of the liner shipping industry. Based on the classification, the literature is divided into groups whose main characteristics...

  6. Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Tao Ren

    2012-01-01

    Full Text Available This paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For Fm|rj|Cmax, we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For Fm‖ΣCj2, improvement strategy with local search is presented to promote the performance of the classical SPT heuristic. At the end of the paper, simulations show the effectiveness of the improvement strategy.

  7. Extended precedence preservative crossover for job shop scheduling problems

    Science.gov (United States)

    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.

  8. Global Optimization of Nonlinear Blend-Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Pedro A. Castillo Castillo

    2017-04-01

    Full Text Available The scheduling of gasoline-blending operations is an important problem in the oil refining industry. This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems, but also non-convex nonlinear behavior, due to the blending of various materials with different quality properties. In this work, a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending. The model includes blend recipe optimization, the distribution problem, and several important operational features and constraints. The algorithm employs piecewise McCormick relaxation (PMCR and normalized multiparametric disaggregation technique (NMDT to compute estimates of the global optimum. These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition. By increasing the number of partitions and reducing the domain of the variables, the algorithm is able to refine the estimates of the global solution. The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature. Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.

  9. The operational flight and multi-crew scheduling problem

    Directory of Open Access Journals (Sweden)

    Stojković Mirela

    2005-01-01

    Full Text Available This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties for the set of crew members, while respecting predefined aircraft itineraries. The splitting of a planned crew is allowed during a day of operations, where it is more important to cover a flight than to keep planned crew members together. The objective is to cover a maximum number of flights from a day of operations while minimizing changes in both the flight schedule and the next-day planned duties for the considered crew members. A new type of the same flight departure time constraints is introduced. They ensure that a flight which belongs to several personalized duties, where the number of duties is equal to the number of crew members assigned to the flight, will have the same departure time in each of these duties. Two variants of the problem are considered. The first variant allows covering of flights by less than the planned number of crew members, while the second one requires covering of flights by a complete crew. The problem is mathematically formulated as an integer nonlinear multi-commodity network flow model with time windows and supplementary constraints. The optimal solution approach is based on Dantzig-Wolfe decomposition/column generation embedded into a branch-and-bound scheme. The resulting computational times on commercial-size problems are very good. Our new simultaneous approach produces solutions whose quality is far better than that of the traditional sequential approach where the flight schedule has been changed first and then input as a fixed data to the crew scheduling problem.

  10. A canned food scheduling problem with batch due date

    Science.gov (United States)

    Chung, Tsui-Ping; Liao, Ching-Jong; Smith, Milton

    2014-09-01

    This article considers a canned food scheduling problem where jobs are grouped into several batches. Jobs can be sent to the next operation only when all the jobs in the same batch have finished their processing, i.e. jobs in a batch, have a common due date. This batch due date problem is quite common in canned food factories, but there is no efficient heuristic to solve the problem. The problem can be formulated as an identical parallel machine problem with batch due date to minimize the total tardiness. Since the problem is NP hard, two heuristics are proposed to find the near-optimal solution. Computational results comparing the effectiveness and efficiency of the two proposed heuristics with an existing heuristic are reported and discussed.

  11. A review on application of neural networks and fuzzy logic to solve hydrothermal scheduling problem

    International Nuclear Information System (INIS)

    Haroon, S.; Malik, T.N.; Zafar, S.

    2014-01-01

    Electrical power system is highly complicated having hydro and thermal mix with large number of machines. To reduce power production cost, hydro and thermal resources are mixed. Hydrothermal scheduling is the optimal coordination of hydro and thermal plants to meet the system load demand at minimum possible operational cost while satisfying the system constraints. Hydrothermal scheduling is dynamic, large scale, non-linear and non-convex optimization problem. The classical techniques have failed in solving such problem. Artificial Intelligence Tools based techniques are used now a day to solve this complex optimization problem because of their no requirements on the nature of the problem. The aim of this research paper is to provide a comprehensive survey of literature related to both Artificial Neural Network (ANN) and Fuzzy Logic (FL) as effective optimization algorithms for the hydrothermal scheduling problem. The outcomes along with the merits and demerits of individual techniques are also discussed. (author)

  12. Optimizing the Steel Plate Storage Yard Crane Scheduling Problem Using a Two Stage Planning/Scheduling Approach

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Clausen, Jens

    This paper presents the Steel Plate Storage Yard Crane Scheduling Problem. The task is to generate a schedule for two gantry cranes sharing tracks. The schedule must comply with a number of constraints and at the same time be cost efficient. We propose some ideas for a two stage planning...

  13. Artificial immune algorithm for multi-depot vehicle scheduling problems

    Science.gov (United States)

    Wu, Zhongyi; Wang, Donggen; Xia, Linyuan; Chen, Xiaoling

    2008-10-01

    In the fast-developing logistics and supply chain management fields, one of the key problems in the decision support system is that how to arrange, for a lot of customers and suppliers, the supplier-to-customer assignment and produce a detailed supply schedule under a set of constraints. Solutions to the multi-depot vehicle scheduling problems (MDVRP) help in solving this problem in case of transportation applications. The objective of the MDVSP is to minimize the total distance covered by all vehicles, which can be considered as delivery costs or time consumption. The MDVSP is one of nondeterministic polynomial-time hard (NP-hard) problem which cannot be solved to optimality within polynomial bounded computational time. Many different approaches have been developed to tackle MDVSP, such as exact algorithm (EA), one-stage approach (OSA), two-phase heuristic method (TPHM), tabu search algorithm (TSA), genetic algorithm (GA) and hierarchical multiplex structure (HIMS). Most of the methods mentioned above are time consuming and have high risk to result in local optimum. In this paper, a new search algorithm is proposed to solve MDVSP based on Artificial Immune Systems (AIS), which are inspirited by vertebrate immune systems. The proposed AIS algorithm is tested with 30 customers and 6 vehicles located in 3 depots. Experimental results show that the artificial immune system algorithm is an effective and efficient method for solving MDVSP problems.

  14. Integrated Production-Distribution Scheduling Problem with Multiple Independent Manufacturers

    Directory of Open Access Journals (Sweden)

    Jianhong Hao

    2015-01-01

    Full Text Available We consider the nonstandard parts supply chain with a public service platform for machinery integration in China. The platform assigns orders placed by a machinery enterprise to multiple independent manufacturers who produce nonstandard parts and makes production schedule and batch delivery schedule for each manufacturer in a coordinate manner. Each manufacturer has only one plant with parallel machines and is located at a location far away from other manufacturers. Orders are first processed at the plants and then directly shipped from the plants to the enterprise in order to be finished before a given deadline. We study the above integrated production-distribution scheduling problem with multiple manufacturers to maximize a weight sum of the profit of each manufacturer under the constraints that all orders are finished before the deadline and the profit of each manufacturer is not negative. According to the optimal condition analysis, we formulate the problem as a mixed integer programming model and use CPLEX to solve it.

  15. Diversity Controlling Genetic Algorithm for Order Acceptance and Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Cheng Chen

    2014-01-01

    Full Text Available Selection and scheduling are an important topic in production systems. To tackle the order acceptance and scheduling problem on a single machine with release dates, tardiness penalty, and sequence-dependent setup times, in this paper a diversity controlling genetic algorithm (DCGA is proposed, in which a diversified population is maintained during the whole search process through survival selection considering both the fitness and the diversity of individuals. To measure the similarity between individuals, a modified Hamming distance without considering the unaccepted orders in the chromosome is adopted. The proposed DCGA was validated on 1500 benchmark instances with up to 100 orders. Compared with the state-of-the-art algorithms, the experimental results show that DCGA improves the solution quality obtained significantly, in terms of the deviation from upper bound.

  16. Heuristics for no-wait flow shop scheduling problem

    Directory of Open Access Journals (Sweden)

    Kewal Krishan Nailwal

    2016-09-01

    Full Text Available No-wait flow shop scheduling refers to continuous flow of jobs through different machines. The job once started should have the continuous processing through the machines without wait. This situation occurs when there is a lack of an intermediate storage between the processing of jobs on two consecutive machines. The problem of no-wait with the objective of minimizing makespan in flow shop scheduling is NP-hard; therefore the heuristic algorithms are the key to solve the problem with optimal solution or to approach nearer to optimal solution in simple manner. The paper describes two heuristics, one constructive and an improvement heuristic algorithm obtained by modifying the constructive one for sequencing n-jobs through m-machines in a flow shop under no-wait constraint with the objective of minimizing makespan. The efficiency of the proposed heuristic algorithms is tested on 120 Taillard’s benchmark problems found in the literature against the NEH under no-wait and the MNEH heuristic for no-wait flow shop problem. The improvement heuristic outperforms all heuristics on the Taillard’s instances by improving the results of NEH by 27.85%, MNEH by 22.56% and that of the proposed constructive heuristic algorithm by 24.68%. To explain the computational process of the proposed algorithm, numerical illustrations are also given in the paper. Statistical tests of significance are done in order to draw the conclusions.

  17. Gaussian variable neighborhood search for the file transfer scheduling problem

    Directory of Open Access Journals (Sweden)

    Dražić Zorica

    2016-01-01

    Full Text Available This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search procedures. As Gaussian Variable Neighborhood Search showed promising results when solving continuous optimization problems, its implementation in solving the discrete file transfer scheduling problem is also presented. In order to apply this continuous optimization method to solve the discrete problem, mapping of uncountable set of feasible solutions into a finite set is performed. Both local search modifications gave better results for the large size instances, as well as better average performance for medium and large size instances. One local search modification achieved significant acceleration of the algorithm. The numerical experiments showed that the results obtained by Gaussian modifications are comparable with the results obtained by standard VNS based algorithms, developed for combinatorial optimization. In some cases Gaussian modifications gave even better results. [Projekat Ministarstava nauke Republike Srbije, br. 174010

  18. Resource-constrained project scheduling problem: review of past and recent developments

    Directory of Open Access Journals (Sweden)

    Farhad Habibi

    2018-01-01

    Full Text Available The project scheduling problem is both practically and theoretically of paramount importance. From the practical perspective, improvement of project scheduling as a critical part of project management process can lead to successful project completion and significantly decrease of the relevant costs. From the theoretical perspective, project scheduling is regarded as one of the in-teresting optimization issues, which has attracted the attention of many researchers in the area of operations research. Therefore, the project scheduling issue has been significantly evaluated over time and has been developed from various aspects. In this research, the topics related to Re-source-Constrained Project Scheduling Problem (RCPSP are reviewed, recent developments in this field are evaluated, and the results are presented for future studies. In this regard, first, the standard problem of RCPSP is expressed and related developments are presented from four as-pects of resources, characteristics of activities, type of objective functions, and availability level of information. Following that, details about 216 articles conducted on RCPSP during 1980-2017 are expressed. At the end, in line with the statistics obtained from the evaluation of previ-ous articles, suggestions are made for the future studies in order to help the development of new issues in this area.

  19. JIT single machine scheduling problem with periodic preventive maintenance

    Science.gov (United States)

    Shahriari, Mohammadreza; Shoja, Naghi; Zade, Amir Ebrahimi; Barak, Sasan; Sharifi, Mani

    2016-09-01

    This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.

  20. A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Rui Zhang

    2011-01-01

    Full Text Available The job shop scheduling problem (JSSP is a notoriously difficult problem in combinatorial optimization. In terms of the objective function, most existing research has been focused on the makespan criterion. However, in contemporary manufacturing systems, due-date-related performances are more important because they are essential for maintaining a high service reputation. Therefore, in this study we aim at minimizing the total weighted tardiness in JSSP. Considering the high complexity, a hybrid differential evolution (DE algorithm is proposed for the problem. To enhance the overall search efficiency, a neighborhood property of the problem is discovered, and then a tree search procedure is designed and embedded into the DE framework. According to the extensive computational experiments, the proposed approach is efficient in solving the job shop scheduling problem with total weighted tardiness objective.

  1. Nuclear Power Plant Preventive Maintenance Scheduling Problem with Fuzziness

    International Nuclear Information System (INIS)

    Abass, S.A.; Abdallah, A.S.

    2013-01-01

    Maintenance activity is regarded as the most important key factor for the safety, reliability and economy of a nuclear power plant. Preventive maintenance refers to set of planned activities which include nondestructive testing and periodic inspection as well as maintenance. In this paper, we address the problem of nuclear power plant preventive maintenance scheduling with uncertainty. The uncertainty will be represented by fuzzy parameters. The problem is how to determine the period for which generating units of an electric system should be taken off line for planned preventive maintenance over specific time horizon. Preventive maintenance activity of a nuclear power plant is an important issue as it designed to extend the plant life . It is more required to review the maintenance not only from the view point of safety and reliability but also economy. Preventive maintenance program exists to ensure that nuclear safety significant equipment will function when it is supposed to. Also this problem is extremely important because a failure in a power plant may cause a general breakdown in an electric network. In this paper a mixed integer programming model is used to express this problem. In proposed model power demand is taken as fuzzy parameters. A case study is provided to demonstrate the efficiency of the proposed model.

  2. Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem

    Directory of Open Access Journals (Sweden)

    S Sarathambekai

    2017-03-01

    Full Text Available Discrete particle swarm optimization is one of the most recently developed population-based meta-heuristic optimization algorithm in swarm intelligence that can be used in any discrete optimization problems. This article presents a discrete particle swarm optimization algorithm to efficiently schedule the tasks in the heterogeneous multiprocessor systems. All the optimization algorithms share a common algorithmic step, namely population initialization. It plays a significant role because it can affect the convergence speed and also the quality of the final solution. The random initialization is the most commonly used method in majority of the evolutionary algorithms to generate solutions in the initial population. The initial good quality solutions can facilitate the algorithm to locate the optimal solution or else it may prevent the algorithm from finding the optimal solution. Intelligence should be incorporated to generate the initial population in order to avoid the premature convergence. This article presents a discrete particle swarm optimization algorithm, which incorporates opposition-based technique to generate initial population and greedy algorithm to balance the load of the processors. Make span, flow time, and reliability cost are three different measures used to evaluate the efficiency of the proposed discrete particle swarm optimization algorithm for scheduling independent tasks in distributed systems. Computational simulations are done based on a set of benchmark instances to assess the performance of the proposed algorithm.

  3. An Algorithm for the Weighted Earliness-Tardiness Unconstrained Project Scheduling Problem

    Science.gov (United States)

    Afshar Nadjafi, Behrouz; Shadrokh, Shahram

    This research considers a project scheduling problem with the object of minimizing weighted earliness-tardiness penalty costs, taking into account a deadline for the project and precedence relations among the activities. An exact recursive method has been proposed for solving the basic form of this problem. We present a new depth-first branch and bound algorithm for extended form of the problem, which time value of money is taken into account by discounting the cash flows. The algorithm is extended with two bounding rules in order to reduce the size of the branch and bound tree. Finally, some test problems are solved and computational results are reported.

  4. Genetic algorithm to solve the problems of lectures and practicums scheduling

    Science.gov (United States)

    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.

  5. MULTICRITERIA HYBRID FLOW SHOP SCHEDULING PROBLEM: LITERATURE REVIEW, ANALYSIS, AND FUTURE RESEARCH

    Directory of Open Access Journals (Sweden)

    Marcia de Fatima Morais

    2014-12-01

    Full Text Available This research focuses on the Hybrid Flow Shop production scheduling problem, which is one of the most difficult problems to solve. The literature points to several studies that focus the Hybrid Flow Shop scheduling problem with monocriteria functions. Despite of the fact that, many real world problems involve several objective functions, they can often compete and conflict, leading researchers to concentrate direct their efforts on the development of methods that take consider this variant into consideration. The goal of the study is to review and analyze the methods in order to solve the Hybrid Flow Shop production scheduling problem with multicriteria functions in the literature. The analyses were performed using several papers that have been published over the years, also the parallel machines types, the approach used to develop solution methods, the type of method develop, the objective function, the performance criterion adopted, and the additional constraints considered. The results of the reviewing and analysis of 46 papers showed opportunities for future research on this topic, including the following: (i use uniform and dedicated parallel machines, (ii use exact and metaheuristics approaches, (iv develop lower and uppers bounds, relations of dominance and different search strategies to improve the computational time of the exact methods,  (v develop  other types of metaheuristic, (vi work with anticipatory setups, and (vii add constraints faced by the production systems itself.

  6. A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem

    Directory of Open Access Journals (Sweden)

    Jian Gao

    2011-08-01

    Full Text Available Distributed Permutation Flowshop Scheduling Problem (DPFSP is a newly proposed scheduling problem, which is a generalization of classical permutation flow shop scheduling problem. The DPFSP is NP-hard in general. It is in the early stages of studies on algorithms for solving this problem. In this paper, we propose a GA-based algorithm, denoted by GA_LS, for solving this problem with objective to minimize the maximum completion time. In the proposed GA_LS, crossover and mutation operators are designed to make it suitable for the representation of DPFSP solutions, where the set of partial job sequences is employed. Furthermore, GA_LS utilizes an efficient local search method to explore neighboring solutions. The local search method uses three proposed rules that move jobs within a factory or between two factories. Intensive experiments on the benchmark instances, extended from Taillard instances, are carried out. The results indicate that the proposed hybrid genetic algorithm can obtain better solutions than all the existing algorithms for the DPFSP, since it obtains better relative percentage deviation and differences of the results are also statistically significant. It is also seen that best-known solutions for most instances are updated by our algorithm. Moreover, we also show the efficiency of the GA_LS by comparing with similar genetic algorithms with the existing local search methods.

  7. A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints.

    Science.gov (United States)

    Xiang, Wei; Yin, Jiao; Lim, Gino

    2015-02-01

    Operating room (OR) surgery scheduling determines the individual surgery's operation start time and assigns the required resources to each surgery over a schedule period, considering several constraints related to a complete surgery flow and the multiple resources involved. This task plays a decisive role in providing timely treatments for the patients while balancing hospital resource utilization. The originality of the present study is to integrate the surgery scheduling problem with real-life nurse roster constraints such as their role, specialty, qualification and availability. This article proposes a mathematical model and an ant colony optimization (ACO) approach to efficiently solve such surgery scheduling problems. A modified ACO algorithm with a two-level ant graph model is developed to solve such combinatorial optimization problems because of its computational complexity. The outer ant graph represents surgeries, while the inner graph is a dynamic resource graph. Three types of pheromones, i.e. sequence-related, surgery-related, and resource-related pheromone, fitting for a two-level model are defined. The iteration-best and feasible update strategy and local pheromone update rules are adopted to emphasize the information related to the good solution in makespan, and the balanced utilization of resources as well. The performance of the proposed ACO algorithm is then evaluated using the test cases from (1) the published literature data with complete nurse roster constraints, and 2) the real data collected from a hospital in China. The scheduling results using the proposed ACO approach are compared with the test case from both the literature and the real life hospital scheduling. Comparison results with the literature shows that the proposed ACO approach has (1) an 1.5-h reduction in end time; (2) a reduction in variation of resources' working time, i.e. 25% for ORs, 50% for nurses in shift 1 and 86% for nurses in shift 2; (3) an 0.25h reduction in

  8. Performance comparison of some evolutionary algorithms on job shop scheduling problems

    Science.gov (United States)

    Mishra, S. K.; Rao, C. S. P.

    2016-09-01

    Job Shop Scheduling as a state space search problem belonging to NP-hard category due to its complexity and combinational explosion of states. Several naturally inspire evolutionary methods have been developed to solve Job Shop Scheduling Problems. In this paper the evolutionary methods namely Particles Swarm Optimization, Artificial Intelligence, Invasive Weed Optimization, Bacterial Foraging Optimization, Music Based Harmony Search Algorithms are applied and find tuned to model and solve Job Shop Scheduling Problems. To compare about 250 Bench Mark instances have been used to evaluate the performance of these algorithms. The capabilities of each these algorithms in solving Job Shop Scheduling Problems are outlined.

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

    Science.gov (United States)

    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.

  10. Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

    Directory of Open Access Journals (Sweden)

    Stanimirović Ivan

    2009-01-01

    Full Text Available We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm, as well as with Microsoft Project.

  11. Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

    Science.gov (United States)

    Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

    2014-01-01

    A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

  12. Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

    Science.gov (United States)

    Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

    2014-01-01

    A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220

  13. SOLVING FLOWSHOP SCHEDULING PROBLEMS USING A DISCRETE AFRICAN WILD DOG ALGORITHM

    Directory of Open Access Journals (Sweden)

    M. K. Marichelvam

    2013-04-01

    Full Text Available The problem of m-machine permutation flowshop scheduling is considered in this paper. The objective is to minimize the makespan. The flowshop scheduling problem is a typical combinatorial optimization problem and has been proved to be strongly NP-hard. Hence, several heuristics and meta-heuristics were addressed by the researchers. In this paper, a discrete African wild dog algorithm is applied for solving the flowshop scheduling problems. Computational results using benchmark problems show that the proposed algorithm outperforms many other algorithms addressed in the literature.

  14. Resource-constrained project scheduling: computing lower bounds by solving minimum cut problems

    NARCIS (Netherlands)

    Möhring, R.H.; Nesetril, J.; Schulz, A.S.; Stork, F.; Uetz, Marc Jochen

    1999-01-01

    We present a novel approach to compute Lagrangian lower bounds on the objective function value of a wide class of resource-constrained project scheduling problems. The basis is a polynomial-time algorithm to solve the following scheduling problem: Given a set of activities with start-time dependent

  15. Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems

    OpenAIRE

    Amjad, Muhammad Kamal; Butt, Shahid Ikramullah; Kousar, Rubeena; Ahmad, Riaz; Agha, Mujtaba Hassan; Faping, Zhang; Anjum, Naveed; Asgher, Umer

    2018-01-01

    Flexible Job Shop Scheduling Problem (FJSSP) is an extension of the classical Job Shop Scheduling Problem (JSSP). The FJSSP is known to be NP-hard problem with regard to optimization and it is very difficult to find reasonably accurate solutions of the problem instances in a rational time. Extensive research has been carried out in this area especially over the span of the last 20 years in which the hybrid approaches involving Genetic Algorithm (GA) have gained the most popularity. Keeping in...

  16. A tabu-search heuristic for solving the multi-depot vehicle scheduling problem

    Directory of Open Access Journals (Sweden)

    Gilmar D'Agostini Oliveira Casalinho

    2014-08-01

    Full Text Available Currently the logistical problems are relying quite significantly on Operational Research in order to achieve greater efficiency in their operations. Among the problems related to the vehicles scheduling in a logistics system, the Multiple Depot Vehicle Scheduling Problem (MDVSP has been addressed in several studies. The MDVSP presupposes the existence of depots that affect the planning of sequences to which travel must be performed. Often, exact methods cannot solve large instances encountered in practice and in order to take them into account, several heuristic approaches are being developed. The aim of this study was thus to solve the MDVSP using a meta-heuristic based on tabu-search method. The main motivation for this work came from the indication that only recently the use of meta-heuristics is being applied to MDVSP context (Pepin et al. 2008 and, also, the limitations listed by Rohde (2008 in his study, which used the branch-and-bound in one of the steps of the heuristic presented to solve the problem, which has increased the time resolution. The research method for solving this problem was based on adaptations of traditional techniques of Operational Research, and provided resolutions presenting very competitive results for the MDVSP such as the cost of the objective function, number of vehicles used and computational time.

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

    Science.gov (United States)

    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.

  18. Multi-objective Mobile Robot Scheduling Problem with Dynamic Time Windows

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa; Steger-Jensen, Kenn

    2012-01-01

    This paper deals with the problem of scheduling feeding tasks of a single mobile robot which has capability of supplying parts to feeders on pro-duction lines. The performance criterion is to minimize the total traveling time of the robot and the total tardiness of the feeding tasks being scheduled...

  19. On non-permutation solutions to some two machine flow shop scheduling problems

    NARCIS (Netherlands)

    V. Strusevich (Vitaly); P.J. Zwaneveld (Peter)

    1994-01-01

    textabstractIn this paper, we study two versions of the two machine flow shop scheduling problem, where schedule length is to be minimized. First, we consider the two machine flow shop with setup, processing, and removal times separated. It is shown that an optimal solution need not be a permutation

  20. Shift work-related health problems in

    Directory of Open Access Journals (Sweden)

    S. Khavaji

    2010-04-01

    Full Text Available Background and aimsShift work is a major feature of working life that affects diverse aspects of human life. The main purposes of this study were to investigate shift work-related health problems and their risk factors among workers of "12-hour shift" schedule.MethodsThis cross-sectional study was carried out at 8 petrochemical industries in Asalooyeh area. Study population consisted of 1203 workers including 549 shift worker (46% and 654 day worker (54%. Data on personal details, shift schedule and adverse effects of shift work werecollected by anonymous questionnaire. Statistical analyses were performed using SPSS, version 11.5. The level of significance was set at 5%.ResultsAlthough, the results showed that health problems among shift workers was more prevalent than day workers, but the differences were just significant in gastrointestinal and musculoskeletal disorders (p<0.05. Multiple linear regressions indicated that in addition to shift working, other variants such as long work hours, type of employment, second job, number of children and job title were associated with health problems.ConclusionPrevalence rates of gastrointestinal and musculoskeletal problems among shift workers were significantly higher than that of day workers. Although, working in shift system was the main significant factor associated with the reported problems, but other demographic andwork variables were also found to have association.

  1. Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set

    Directory of Open Access Journals (Sweden)

    Yi Han

    2013-01-01

    Full Text Available This paper presents a shuffled frog leaping algorithm (SFLA for the single-mode resource-constrained project scheduling problem where activities can be divided into equant units and interrupted during processing. Each activity consumes 0–3 types of resources which are renewable and temporarily not available due to resource vacations in each period. The presence of scarce resources and precedence relations between activities makes project scheduling a difficult and important task in project management. A recent popular metaheuristic shuffled frog leaping algorithm, which is enlightened by the predatory habit of frog group in a small pond, is adopted to investigate the project makespan improvement on Patterson benchmark sets which is composed of different small and medium size projects. Computational results demonstrate the effectiveness and efficiency of SFLA in reducing project makespan and minimizing activity splitting number within an average CPU runtime, 0.521 second. This paper exposes all the scheduling sequences for each project and shows that of the 23 best known solutions have been improved.

  2. Hybrid Genetic Algorithm with Multiparents Crossover for Job Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Noor Hasnah Moin

    2015-01-01

    Full Text Available The job shop scheduling problem (JSSP is one of the well-known hard combinatorial scheduling problems. This paper proposes a hybrid genetic algorithm with multiparents crossover for JSSP. The multiparents crossover operator known as extended precedence preservative crossover (EPPX is able to recombine more than two parents to generate a single new offspring distinguished from common crossover operators that recombine only two parents. This algorithm also embeds a schedule generation procedure to generate full-active schedule that satisfies precedence constraints in order to reduce the search space. Once a schedule is obtained, a neighborhood search is applied to exploit the search space for better solutions and to enhance the GA. This hybrid genetic algorithm is simulated on a set of benchmarks from the literatures and the results are compared with other approaches to ensure the sustainability of this algorithm in solving JSSP. The results suggest that the implementation of multiparents crossover produces competitive results.

  3. A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan

    Science.gov (United States)

    Rameshkumar, K.; Rajendran, C.

    2018-02-01

    In this work, a discrete version of PSO algorithm is proposed to minimize the makespan of a job-shop. A novel schedule builder has been utilized to generate active schedules. The discrete PSO is tested using well known benchmark problems available in the literature. The solution produced by the proposed algorithms is compared with best known solution published in the literature and also compared with hybrid particle swarm algorithm and variable neighborhood search PSO algorithm. The solution construction methodology adopted in this study is found to be effective in producing good quality solutions for the various benchmark job-shop scheduling problems.

  4. Constraint optimization model of a scheduling problem for a robotic arm in automatic systems

    DEFF Research Database (Denmark)

    Kristiansen, Ewa; Smith, Stephen F.; Kristiansen, Morten

    2014-01-01

    are characteristics of the painting process application itself. Unlike spot-welding, painting tasks require movement of the entire robot arm. In addition to minimizing intertask duration, the scheduler must strive to maximize painting quality and the problem is formulated as a multi-objective optimization problem....... The scheduling model is implemented as a stand-alone module using constraint programming, and integrated with a larger automatic system. The results of a number of simulation experiments with simple parts are reported, both to characterize the functionality of the scheduler and to illustrate the operation...... of the entire software system for automatic generation of robot programs for painting....

  5. Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net

    Directory of Open Access Journals (Sweden)

    Behnam Barzegar

    2012-01-01

    Full Text Available Scheduled production system leads to avoiding stock accumulations, losses reduction, decreasing or even eliminating idol machines, and effort to better benefitting from machines for on time responding customer orders and supplying requested materials in suitable time. In flexible job-shop scheduling production systems, we could reduce time and costs by transferring and delivering operations on existing machines, that is, among NP-hard problems. The scheduling objective minimizes the maximal completion time of all the operations, which is denoted by Makespan. Different methods and algorithms have been presented for solving this problem. Having a reasonable scheduled production system has significant influence on improving effectiveness and attaining to organization goals. In this paper, new algorithm were proposed for flexible job-shop scheduling problem systems (FJSSP-GSPN that is based on gravitational search algorithm (GSA. In the proposed method, the flexible job-shop scheduling problem systems was modeled by color Petri net and CPN tool and then a scheduled job was programmed by GSA algorithm. The experimental results showed that the proposed method has reasonable performance in comparison with other algorithms.

  6. Optimising the Slab Yard Planning and Crane Scheduling Problem using a two-stage heuristic

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Clausen, Jens

    2010-01-01

    In this paper, we present the Slab Yard Planning and Crane Scheduling Problem. The problem has its origin in steel production facilities with a large throughput. A slab yard is used as a buffer for slabs that are needed in the upcoming production. Slabs are transported by cranes and the problem...

  7. A Column Generation Approach for Solving the Patient Admission Scheduling Problem

    DEFF Research Database (Denmark)

    Range, Troels Martin; Lusby, Richard Martin; Larsen, Jesper

    This paper addresses the Patient Admission Scheduling (PAS) problem. The PAS problem deals with assigning elective patients to beds, satisfying a number of soft and hard constraints. The problem can be seen as part of the functions of hospital management at an operational level. There exists a sm...... to produce new best solutions for ve out of six instances from a publicly available repository....

  8. Relative performance of priority rules for hybrid flow shop scheduling with setup times

    Directory of Open Access Journals (Sweden)

    Helio Yochihiro Fuchigami

    2015-12-01

    Full Text Available This paper focuses the hybrid flow shop scheduling problem with explicit and sequence-independent setup times. This production environment is a multistage system with unidirectional flow of jobs, wherein each stage may contain multiple machines available for processing. The optimized measure was the total time to complete the schedule (makespan. The aim was to propose new priority rules to support the schedule and to evaluate their relative performance at the production system considered by the percentage of success, relative deviation, standard deviation of relative deviation, and average CPU time. Computational experiments have indicated that the rules using ascending order of the sum of processing and setup times of the first stage (SPT1 and SPT1_ERD performed better, reaching together more than 56% of success.

  9. Optimal infrastructure maintenance scheduling problem under budget uncertainty.

    Science.gov (United States)

    2010-05-01

    This research addresses a general class of infrastructure asset management problems. Infrastructure : agencies usually face budget uncertainties that will eventually lead to suboptimal planning if : maintenance decisions are made without taking the u...

  10. A Multiagent Evolutionary Algorithm for the Resource-Constrained Project Portfolio Selection and Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Yongyi Shou

    2014-01-01

    Full Text Available A multiagent evolutionary algorithm is proposed to solve the resource-constrained project portfolio selection and scheduling problem. The proposed algorithm has a dual level structure. In the upper level a set of agents make decisions to select appropriate project portfolios. Each agent selects its project portfolio independently. The neighborhood competition operator and self-learning operator are designed to improve the agent’s energy, that is, the portfolio profit. In the lower level the selected projects are scheduled simultaneously and completion times are computed to estimate the expected portfolio profit. A priority rule-based heuristic is used by each agent to solve the multiproject scheduling problem. A set of instances were generated systematically from the widely used Patterson set. Computational experiments confirmed that the proposed evolutionary algorithm is effective for the resource-constrained project portfolio selection and scheduling problem.

  11. Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

    Directory of Open Access Journals (Sweden)

    Wenming Cheng

    2012-01-01

    Full Text Available In many real scheduling environments, a job processed later needs longer time than the same job when it starts earlier. This phenomenon is known as scheduling with deteriorating jobs to many industrial applications. In this paper, we study a scheduling problem of minimizing the total completion time on identical parallel machines where the processing time of a job is a step function of its starting time and a deteriorating date that is individual to all jobs. Firstly, a mixed integer programming model is presented for the problem. And then, a modified weight-combination search algorithm and a variable neighborhood search are employed to yield optimal or near-optimal schedule. To evaluate the performance of the proposed algorithms, computational experiments are performed on randomly generated test instances. Finally, computational results show that the proposed approaches obtain near-optimal solutions in a reasonable computational time even for large-sized problems.

  12. A branch-and-price algorithm for the long-term home care scheduling problem

    DEFF Research Database (Denmark)

    Gamst, Mette; Jensen, Thomas Sejr

    2012-01-01

    In several countries, home care is provided for certain citizens living at home. The long-term home care scheduling problem is to generate work plans such that a high quality of service is maintained, the work hours of the employees are respected, and the overall cost is kept as low as possible. We...... propose a branchand-price algorithm for the long-term home care scheduling problem. The pricing problem generates a one-day plan for an employee, and the master problem merges the plans with respect to regularity constraints. The method is capable of generating plans with up to 44 visits during one week....

  13. Optimal and online preemptive scheduling on uniformly related machines

    Czech Academy of Sciences Publication Activity Database

    Ebenlendr, Tomáš; Sgall, J.

    2009-01-01

    Roč. 12, č. 5 (2009), s. 517-527 ISSN 1094-6136 R&D Projects: GA MŠk(CZ) 1M0545; GA AV ČR IAA100190902; GA AV ČR IAA1019401 Institutional research plan: CEZ:AV0Z10190503 Keywords : online scheduling * preemption * uniformly related machines Subject RIV: IN - Informatics, Computer Science Impact factor: 1.265, year: 2009

  14. Ship Block Transportation Scheduling Problem Based on Greedy Algorithm

    Directory of Open Access Journals (Sweden)

    Chong Wang

    2016-05-01

    Full Text Available Ship block transportation problems are crucial issues to address in reducing the construction cost and improving the productivity of shipyards. Shipyards aim to maximize the workload balance of transporters with time constraint such that all blocks should be transported during the planning horizon. This process leads to three types of penalty time: empty transporter travel time, delay time, and tardy time. This study aims to minimize the sum of the penalty time. First, this study presents the problem of ship block transportation with the generalization of the block transportation restriction on the multi-type transporter. Second, the problem is transformed into the classical traveling salesman problem and assignment problem through a reasonable model simplification and by adding a virtual node to the proposed directed graph. Then, a heuristic algorithm based on greedy algorithm is proposed to assign blocks to available transporters and sequencing blocks for each transporter simultaneously. Finally, the numerical experiment method is used to validate the model, and its result shows that the proposed algorithm is effective in realizing the efficient use of the transporters in shipyards. Numerical simulation results demonstrate the promising application of the proposed method to efficiently improve the utilization of transporters and to reduce the cost of ship block logistics for shipyards.

  15. Genetic algorithm parameters tuning for resource-constrained project scheduling problem

    Science.gov (United States)

    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.

  16. Cyclic flow shop scheduling problem with two-machine cells

    Directory of Open Access Journals (Sweden)

    Bożejko Wojciech

    2017-06-01

    Full Text Available In the paper a variant of cyclic production with setups and two-machine cell is considered. One of the stages of the problem solving consists of assigning each operation to the machine on which it will be carried out. The total number of such assignments is exponential. We propose a polynomial time algorithm finding the optimal operations to machines assignment.

  17. Time and multiple objectives in scheduling and routing problems

    NARCIS (Netherlands)

    Dabia, S.

    2012-01-01

    Many optimization problems encountered in practice are multi-objective by nature, i.e., different objectives are conflicting and equally important. Many times, it is not desirable to drop some of them or to optimize them in a composite single objective or hierarchical manner. Furthermore, cost

  18. Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times

    Directory of Open Access Journals (Sweden)

    Mauricio Iwama Takano

    2019-01-01

    Full Text Available This paper addresses the minimization of makespan for the permutation flow shop scheduling problem with blocking and sequence and machine dependent setup times, a problem not yet studied in previous studies. The 14 best known heuristics for the permutation flow shop problem with blocking and no setup times are pre-sented and then adapted to the problem in two different ways; resulting in 28 different heuristics. The heuristics are then compared using the Taillard database. As there is no other work that addresses the problem with blocking and sequence and ma-chine dependent setup times, a database for the setup times was created. The setup time value was uniformly distributed between 1% and 10%, 50%, 100% and 125% of the processing time value. Computational tests are then presented for each of the 28 heuristics, comparing the mean relative deviation of the makespan, the computational time and the percentage of successes of each method. Results show that the heuristics were capable of providing interesting results.

  19. A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Sivashan Chetty

    2015-01-01

    Full Text Available The Just-In-Time (JIT scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve the JIT scheduling problem presented in this study, a new local search metaheuristic algorithm, namely, the enhanced Best Performance Algorithm (eBPA, is introduced. This is part of the initial study of the algorithm for scheduling problems. The current problem setting is the allocation of a large number of jobs required to be scheduled on multiple and identical machines which run in parallel. The due date of a job is characterized by a window frame of time, rather than a specific point in time. The performance of the eBPA is compared against Tabu Search (TS and Simulated Annealing (SA. SA and TS are well-known local search metaheuristic algorithms. The results show the potential of the eBPA as a metaheuristic algorithm.

  20. A branch and cut approach to the multiproduct pipeline scheduling problem

    Energy Technology Data Exchange (ETDEWEB)

    Souza Filho, Erito Marques de; Bahiense, Laura; Ferreira Filho, Virgilio Jose Martins [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil)

    2009-07-01

    Pipelines are known as the most reliable and economical mode of transportation for petroleum and its derivatives, especially when large amounts of products have to be pumped for large distances. We address the short-term schedule of a pipeline system comprising the distribution of several petroleum derivatives from a single oil refinery to several depots, connected to local consumer markets, through a single multi-product pipeline. The major difficulties faced in these operations are related to the satisfaction of product demands by the various consumer markets, and operational constraints such as the maximum sizes of contiguous pumping packs, and the immiscible products. Several researchers have developed models and techniques for this short-term pipeline scheduling problem. Two different methodologies have been proposed in the literature: heuristic search techniques and exact methods. In this paper, we use a branch-and cut algorithm, performed in Xpress-MP{sup T}M, and compare the solutions obtained with that ones obtained before using the Variable Neighborhood Search metaheuristic. The computational results showed a significant improvement of performance in relation to previous algorithm. (author)

  1. An Improved Genetic Algorithm for Single-Machine Inverse Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Jianhui Mou

    2014-01-01

    Full Text Available The goal of the scheduling is to arrange operations on suitable machines with optimal sequence for corresponding objectives. In order to meet market requirements, scheduling systems must own enough flexibility against uncertain events. These events can change production status or processing parameters, even causing the original schedule to no longer be optimal or even to be infeasible. Traditional scheduling strategies, however, cannot cope with these cases. Therefore, a new idea of scheduling called inverse scheduling has been proposed. In this paper, the inverse scheduling with weighted completion time (SMISP is considered in a single-machine shop environment. In this paper, an improved genetic algorithm (IGA with a local searching strategy is proposed. To improve the performance of IGA, efficient encoding scheme, fitness evaluation mechanism, feasible initialization methods, and a local search procedure have been employed in the paper. Because of the local improving method, the proposed IGA can balance its exploration ability and exploitation ability. We adopt 27 instances to verify the effectiveness of the proposed algorithm. The experimental results illustrated that the proposed algorithm can generate satisfactory solutions. This approach also has been applied to solve the scheduling problem in the real Chinese shipyard and can bring some benefits.

  2. Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

    Science.gov (United States)

    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.

  3. Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems

    Science.gov (United States)

    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.

  4. Solving a manpower scheduling problem for airline catering using tabu search

    DEFF Research Database (Denmark)

    Ho, Sin C.; Leung, Janny M. Y.

    We study a manpower scheduling problem with job time-windows and job-skills compatibility constraints. This problem is motivated by airline catering operations, whereby airline meals and other supplies are delivered to aircrafts on the tarmac just before the flights take off. Jobs (flights) must...

  5. A priority-based heuristic algorithm (PBHA for optimizing integrated process planning and scheduling problem

    Directory of Open Access Journals (Sweden)

    Muhammad Farhan Ausaf

    2015-12-01

    Full Text Available Process planning and scheduling are two important components of a manufacturing setup. It is important to integrate them to achieve better global optimality and improved system performance. To find optimal solutions for integrated process planning and scheduling (IPPS problem, numerous algorithm-based approaches exist. Most of these approaches try to use existing meta-heuristic algorithms for solving the IPPS problem. Although these approaches have been shown to be effective in optimizing the IPPS problem, there is still room for improvement in terms of quality of solution and algorithm efficiency, especially for more complicated problems. Dispatching rules have been successfully utilized for solving complicated scheduling problems, but haven’t been considered extensively for the IPPS problem. This approach incorporates dispatching rules with the concept of prioritizing jobs, in an algorithm called priority-based heuristic algorithm (PBHA. PBHA tries to establish job and machine priority for selecting operations. Priority assignment and a set of dispatching rules are simultaneously used to generate both the process plans and schedules for all jobs and machines. The algorithm was tested for a series of benchmark problems. The proposed algorithm was able to achieve superior results for most complex problems presented in recent literature while utilizing lesser computational resources.

  6. Decomposition principles applied to the dynamic production and work-force scheduling problem

    NARCIS (Netherlands)

    Aardal, K.I.; Ari, A.

    1987-01-01

    One of the most important problems in the production and inventory planning field, is the scheduling of production and work force in a dynamic environment. Although this problem can be formulated as a linear program, it is often quite difficult to solve directly, due to its large scale. Instead, it

  7. A duty-period-based formulation of the airline crew scheduling problem

    Energy Technology Data Exchange (ETDEWEB)

    Hoffman, K.

    1994-12-31

    We present a new formulation of the airline crew scheduling problem that explicitly considers the duty periods. We suggest an algorithm for solving the formulation by a column generation approach with branch-and-bound. Computational results are reported for a number of test problems.

  8. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time Windows and scheduled lines

    NARCIS (Netherlands)

    Ghilas, V.; Demir, E.; van Woensel, T.

    2016-01-01

    The Pickup and Delivery Problem with Time Windows and Scheduled Lines (PDPTW-SL) concerns scheduling a set of vehicles to serve freight requests such that a part of the journey can be carried out on a scheduled public transportation line. Due to the complexity of the problem, which is NP-hard, we

  9. Mathematical models for a batch scheduling problem to minimize earliness and tardiness

    Directory of Open Access Journals (Sweden)

    Basar Ogun

    2018-05-01

    Full Text Available Purpose: Today’s manufacturing facilities are challenged by highly customized products and just in time manufacturing and delivery of these products. In this study, a batch scheduling problem is addressed to provide on-time completion of customer orders in the environment of lean manufacturing. The problem is to optimize partitioning of product components into batches and scheduling of the resulting batches where each customer order is received as a set of products made of various components. Design/methodology/approach: Three different mathematical models for minimization of total earliness and tardiness of customer orders are developed to provide on-time completion of customer orders and also, to avoid from inventory of final products. The first model is a non-linear integer programming model while the second is a linearized version of the first. Finally, to solve larger sized instances of the problem, an alternative linear integer model is presented. Findings: Computational study using a suit set of test instances showed that the alternative linear integer model is able to solve all test instances in varying sizes within quite shorter computer times comparing to the other two models. It was also showed that the alternative model can solve moderate sized real-world problems. Originality/value: The problem under study differentiates from existing batch scheduling problems in the literature since it includes new circumstances which may arise in real-world applications. This research, also, contributes the literature of batch scheduling problem by presenting new optimization models.

  10. Permutation flow-shop scheduling problem to optimize a quadratic objective function

    Science.gov (United States)

    Ren, Tao; Zhao, Peng; Zhang, Da; Liu, Bingqian; Yuan, Huawei; Bai, Danyu

    2017-09-01

    A flow-shop scheduling model enables appropriate sequencing for each job and for processing on a set of machines in compliance with identical processing orders. The objective is to achieve a feasible schedule for optimizing a given criterion. Permutation is a special setting of the model in which the processing order of the jobs on the machines is identical for each subsequent step of processing. This article addresses the permutation flow-shop scheduling problem to minimize the criterion of total weighted quadratic completion time. With a probability hypothesis, the asymptotic optimality of the weighted shortest processing time schedule under a consistency condition (WSPT-CC) is proven for sufficiently large-scale problems. However, the worst case performance ratio of the WSPT-CC schedule is the square of the number of machines in certain situations. A discrete differential evolution algorithm, where a new crossover method with multiple-point insertion is used to improve the final outcome, is presented to obtain high-quality solutions for moderate-scale problems. A sequence-independent lower bound is designed for pruning in a branch-and-bound algorithm for small-scale problems. A set of random experiments demonstrates the performance of the lower bound and the effectiveness of the proposed algorithms.

  11. Comparative study of heuristics algorithms in solving flexible job shop scheduling problem with condition based maintenance

    Directory of Open Access Journals (Sweden)

    Yahong Zheng

    2014-05-01

    Full Text Available Purpose: This paper focuses on a classic optimization problem in operations research, the flexible job shop scheduling problem (FJSP, to discuss the method to deal with uncertainty in a manufacturing system.Design/methodology/approach: In this paper, condition based maintenance (CBM, a kind of preventive maintenance, is suggested to reduce unavailability of machines. Different to the simultaneous scheduling algorithm (SSA used in the previous article (Neale & Cameron,1979, an inserting algorithm (IA is applied, in which firstly a pre-schedule is obtained through heuristic algorithm and then maintenance tasks are inserted into the pre-schedule scheme.Findings: It is encouraging that a new better solution for an instance in benchmark of FJSP is obtained in this research. Moreover, factually SSA used in literature for solving normal FJSPPM (FJSP with PM is not suitable for the dynamic FJSPPM. Through application in the benchmark of normal FJSPPM, it is found that although IA obtains inferior results compared to SSA used in literature, it performs much better in executing speed.Originality/value: Different to traditional scheduling of FJSP, uncertainty of machines is taken into account, which increases the complexity of the problem. An inserting algorithm (IA is proposed to solve the dynamic scheduling problem. It is stated that the quality of the final result depends much on the quality of the pre-schedule obtained during the procedure of solving a normal FJSP. In order to find the best solution of FJSP, a comparative study of three heuristics is carried out, the integrated GA, ACO and ABC. In the comparative study, we find that GA performs best in the three heuristic algorithms. Meanwhile, a new better solution for an instance in benchmark of FJSP is obtained in this research.

  12. Heuristics methods for the flow shop scheduling problem with separated setup times

    Directory of Open Access Journals (Sweden)

    Marcelo Seido Nagano

    2012-06-01

    Full Text Available This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature.

  13. Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect

    Directory of Open Access Journals (Sweden)

    Mingbao Cheng

    2013-01-01

    Full Text Available We consider a permutation flowshop scheduling problem with a position-dependent exponential learning effect. The objective is to minimize the performance criteria of makespan and the total flow time. For the two-machine flow shop scheduling case, we show that Johnson’s rule is not an optimal algorithm for minimizing the makespan given the exponential learning effect. Furthermore, by using the shortest total processing times first (STPT rule, we construct the worst-case performance ratios for both criteria. Finally, a polynomial-time algorithm is proposed for special cases of the studied problem.

  14. A new genetic algorithm for flexible job-shop scheduling problems

    International Nuclear Information System (INIS)

    Driss, Imen; Mouss, Kinza Nadia; Laggoun, Assia

    2015-01-01

    Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop scheduling problem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a new chromosome representation and adopts different strategies for crossover and mutation. The proposed algorithm is validated on a series of benchmark data sets and tested on data from a drug manufacturing company. Experimental results prove that the NGA is more efficient and competitive than some other existing algorithms.

  15. A new genetic algorithm for flexible job-shop scheduling problems

    Energy Technology Data Exchange (ETDEWEB)

    Driss, Imen; Mouss, Kinza Nadia; Laggoun, Assia [University of Batna, Batna (Algeria)

    2015-03-15

    Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop scheduling problem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a new chromosome representation and adopts different strategies for crossover and mutation. The proposed algorithm is validated on a series of benchmark data sets and tested on data from a drug manufacturing company. Experimental results prove that the NGA is more efficient and competitive than some other existing algorithms.

  16. Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem

    DEFF Research Database (Denmark)

    Gamst, M.

    2014-01-01

    problem. The methods are computationally evaluated on test instances arising from telecommunications with up to 500 jobs and 500 machines. Results show that solving the integrated job scheduling and constrained network routing problem to optimality is very difficult. The exact solution approach performs......This paper examines the problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job has a certain demand, which must be sent to the executing machine via constrained paths. A job cannot start before all its demands have...... arrived at the machine. Furthermore, two resource demand transmissions cannot use the same edge in the same time period. The problem has application in grid computing, where a number of geographically distributed machines work together for solving large problems. The machines are connected through...

  17. A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems

    Science.gov (United States)

    Thammano, Arit; Teekeng, Wannaporn

    2015-05-01

    The job-shop scheduling problem is one of the most difficult production planning problems. Since it is in the NP-hard class, a recent trend in solving the job-shop scheduling problem is shifting towards the use of heuristic and metaheuristic algorithms. This paper proposes a novel metaheuristic algorithm, which is a modification of the genetic algorithm. This proposed algorithm introduces two new concepts to the standard genetic algorithm: (1) fuzzy roulette wheel selection and (2) the mutation operation with tabu list. The proposed algorithm has been evaluated and compared with several state-of-the-art algorithms in the literature. The experimental results on 53 JSSPs show that the proposed algorithm is very effective in solving the combinatorial optimization problems. It outperforms all state-of-the-art algorithms on all benchmark problems in terms of the ability to achieve the optimal solution and the computational time.

  18. Two parameter-tuned metaheuristic algorithms for the multi-level lot sizing and scheduling problem

    Directory of Open Access Journals (Sweden)

    S.M.T. Fatemi Ghomi

    2012-10-01

    Full Text Available This paper addresses the problem of lot sizing and scheduling problem for n-products and m-machines in flow shop environment where setups among machines are sequence-dependent and can be carried over. Many products must be produced under capacity constraints and allowing backorders. Since lot sizing and scheduling problems are well-known strongly NP-hard, much attention has been given to heuristics and metaheuristics methods. This paper presents two metaheuristics algorithms namely, Genetic Algorithm (GA and Imperialist Competitive Algorithm (ICA. Moreover, Taguchi robust design methodology is employed to calibrate the parameters of the algorithms for different size problems. In addition, the parameter-tuned algorithms are compared against a presented lower bound on randomly generated problems. At the end, comprehensive numerical examples are presented to demonstrate the effectiveness of the proposed algorithms. The results showed that the performance of both GA and ICA are very promising and ICA outperforms GA statistically.

  19. Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Muhammad Kamal Amjad

    2018-01-01

    Full Text Available Flexible Job Shop Scheduling Problem (FJSSP is an extension of the classical Job Shop Scheduling Problem (JSSP. The FJSSP is known to be NP-hard problem with regard to optimization and it is very difficult to find reasonably accurate solutions of the problem instances in a rational time. Extensive research has been carried out in this area especially over the span of the last 20 years in which the hybrid approaches involving Genetic Algorithm (GA have gained the most popularity. Keeping in view this aspect, this article presents a comprehensive literature review of the FJSSPs solved using the GA. The survey is further extended by the inclusion of the hybrid GA (hGA techniques used in the solution of the problem. This review will give readers an insight into use of certain parameters in their future research along with future research directions.

  20. Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm

    Science.gov (United States)

    Piroozfard, Hamed; Wong, Kuan Yew

    2015-05-01

    The efforts of finding optimal schedules for the job shop scheduling problems are highly important for many real-world industrial applications. In this paper, a multi-objective based job shop scheduling problem by simultaneously minimizing makespan and tardiness is taken into account. The problem is considered to be more complex due to the multiple business criteria that must be satisfied. To solve the problem more efficiently and to obtain a set of non-dominated solutions, a meta-heuristic based non-dominated sorting genetic algorithm is presented. In addition, task based representation is used for solution encoding, and tournament selection that is based on rank and crowding distance is applied for offspring selection. Swapping and insertion mutations are employed to increase diversity of population and to perform intensive search. To evaluate the modified non-dominated sorting genetic algorithm, a set of modified benchmarking job shop problems obtained from the OR-Library is used, and the results are considered based on the number of non-dominated solutions and quality of schedules obtained by the algorithm.

  1. Comparison of heuristics for an economic lot scheduling problem with deliberated coproduction

    Directory of Open Access Journals (Sweden)

    Pilar I. Vidal-Carreras

    2009-12-01

    Full Text Available We built on the Economic Lot Scheduling Problem Scheduling (ELSP literature by making some modifications in order to introduce new constraints which had not been thoroughly studied with a view to simulating specific real situations. Specifically, our aim is to propose and simulate different scheduling policies for a new ELSP variant: Deliberated Coproduction. This problem comprises a product system in an ELSP environment in which we may choose if more than one product can be produced on the machine at a given time. We expressly consider the option of coproducing two products whose demand is not substitutable. In order to draw conclusions, a simulation model and its results were developed in the article by employing modified Bomberger data which include two items that could be produced simultaneously.

  2. Energy-Efficient Scheduling Problem Using an Effective Hybrid Multi-Objective Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Lvjiang Yin

    2016-12-01

    Full Text Available Nowadays, manufacturing enterprises face the challenge of just-in-time (JIT production and energy saving. Therefore, study of JIT production and energy consumption is necessary and important in manufacturing sectors. Moreover, energy saving can be attained by the operational method and turn off/on idle machine method, which also increases the complexity of problem solving. Thus, most researchers still focus on small scale problems with one objective: a single machine environment. However, the scheduling problem is a multi-objective optimization problem in real applications. In this paper, a single machine scheduling model with controllable processing and sequence dependence setup times is developed for minimizing the total earliness/tardiness (E/T, cost, and energy consumption simultaneously. An effective multi-objective evolutionary algorithm called local multi-objective evolutionary algorithm (LMOEA is presented to tackle this multi-objective scheduling problem. To accommodate the characteristic of the problem, a new solution representation is proposed, which can convert discrete combinational problems into continuous problems. Additionally, a multiple local search strategy with self-adaptive mechanism is introduced into the proposed algorithm to enhance the exploitation ability. The performance of the proposed algorithm is evaluated by instances with comparison to other multi-objective meta-heuristics such as Nondominated Sorting Genetic Algorithm II (NSGA-II, Strength Pareto Evolutionary Algorithm 2 (SPEA2, Multiobjective Particle Swarm Optimization (OMOPSO, and Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D. Experimental results demonstrate that the proposed LMOEA algorithm outperforms its counterparts for this kind of scheduling problems.

  3. Solving scheduling problems by untimed model checking. The clinical chemical analyser case study

    NARCIS (Netherlands)

    Margaria, T.; Wijs, Anton J.; Massink, M.; van de Pol, Jan Cornelis; Bortnik, Elena M.

    2009-01-01

    In this article, we show how scheduling problems can be modelled in untimed process algebra, by using special tick actions. A minimal-cost trace leading to a particular action, is one that minimises the number of tick steps. As a result, we can use any (timed or untimed) model checking tool to find

  4. A basic period approach to the economic lot scheduling problem with shelf life considerations

    NARCIS (Netherlands)

    Soman, C.A.; van Donk, D.P.; Gaalman, G.J.C.

    2004-01-01

    Almost all the research on the economic lot scheduling problem (ELSP) considering limited shelf life of products has assumed a common cycle approach and an unrealistic assumption of possibility of deliberately reducing the production rate. In many cases, like in food processing industry where

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

    Science.gov (United States)

    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.

  6. An Improved Multiobjective PSO for the Scheduling Problem of Panel Block Construction

    Directory of Open Access Journals (Sweden)

    Zhi Yang

    2016-01-01

    Full Text Available Uncertainty is common in ship construction. However, few studies have focused on scheduling problems under uncertainty in shipbuilding. This paper formulates the scheduling problem of panel block construction as a multiobjective fuzzy flow shop scheduling problem (FSSP with a fuzzy processing time, a fuzzy due date, and the just-in-time (JIT concept. An improved multiobjective particle swarm optimization called MOPSO-M is developed to solve the scheduling problem. MOPSO-M utilizes a ranked-order-value rule to convert the continuous position of particles into the discrete permutations of jobs, and an available mapping is employed to obtain the precedence-based permutation of the jobs. In addition, to improve the performance of MOPSO-M, archive maintenance is combined with global best position selection, and mutation and a velocity constriction mechanism are introduced into the algorithm. The feasibility and effectiveness of MOPSO-M are assessed in comparison with general MOPSO and nondominated sorting genetic algorithm-II (NSGA-II.

  7. A Distributed Particle Swarm Optimization Zlgorithmfor Flexible Job-hop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    LIU Sheng--hui

    2017-06-01

    Full Text Available According to the characteristics of the Flexible job shop scheduling problem the minimum makespan as measures we proposed a distributed particle swarm optimization algorithm aiming to solve flexible job shop scheduling problem. The algorithm adopts the method of distributed ideas to solve problems and we are established for two multi agent particle swarm optimization model in this algorithm it can solve the traditional particle swarm optimization algorithm when making decisions in real time according to the emergencies. Finally some benthmark problems were experimented and the results are compared with the traditional algorithm. Experimental results proved that the developed distributed PSO is enough effective and efficient to solve the FJSP and it also verified the reasonableness of the multi}gent particle swarm optimization model.

  8. Solving a More Flexible Home Health Care Scheduling and Routing Problem with Joint Patient and Nursing Staff Selection

    Directory of Open Access Journals (Sweden)

    Jamal Abdul Nasir

    2018-01-01

    Full Text Available Development of an efficient and effective home health care (HHC service system is a quite recent and challenging task for the HHC firms. This paper aims to develop an HHC service system in the perspective of long-term economic sustainability as well as operational efficiency. A more flexible mixed-integer linear programming (MILP model is formulated by incorporating the dynamic arrival and departure of patients along with the selection of new patients and nursing staff. An integrated model is proposed that jointly addresses: (i patient selection; (ii nurse hiring; (iii nurse to patient assignment; and (iv scheduling and routing decisions in a daily HHC planning problem. The proposed model extends the HHC problem from conventional scheduling and routing issues to demand and capacity management aspects. It enables an HHC firm to solve the daily scheduling and routing problem considering existing patients and nursing staff in combination with the simultaneous selection of new patients and nurses, and optimizing the existing routes by including new patients and nurses. The model considers planning issues related to compatibility, time restrictions, contract durations, idle time and workload balance. Two heuristic methods are proposed to solve the model by exploiting the variable neighborhood search (VNS approach. Results obtained from the heuristic methods are compared with a CPLEX based solution. Numerical experiments performed on different data sets, show the efficiency and effectiveness of the solution methods to handle the considered problem.

  9. Preemptive scheduling with rejection

    NARCIS (Netherlands)

    Hoogeveen, H.; Skutella, M.; Woeginger, Gerhard

    2003-01-01

    We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining

  10. Preemptive scheduling with rejection

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Skutella, M.; Woeginger, G.J.; Paterson, M.

    2000-01-01

    We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining

  11. The Simultaneous Vehicle Scheduling and Passenger Service Problem with Flexible Dwell Times

    DEFF Research Database (Denmark)

    Fonseca, Joao Filipe Paiva; Larsen, Allan; van der Hurk, Evelien

    In this talk, we deal with a generalization of the well-known Vehicle Scheduling Problem(VSP) that we call Simultaneous Vehicle Scheduling and Passenger Service Problem with Flexible Dwell Times (SVSPSP-FDT). The SVSPSP-FDT generalizes the VSP because the original timetables of the trips can...... be changed (i.e., shifted and stretched) in order to minimize a new objective function that aims at minimizing the operational costs plus the waiting times of the passengers at transfer points. Contrary to most generalizations of the VSP, the SVSPSP-FDT establishes the possibility of changing trips' dwell...... times at important transfer points based on expected passenger ows. We introduce a compact mixed integer linear formulation of the SVSPSP-FDT able to address small instances. We also present a meta-heuristic approach to solve medium/large instances of the problem. The e ectiveness of the proposed...

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

    Science.gov (United States)

    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.

  13. The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies

    DEFF Research Database (Denmark)

    Rasmussen, Matias Sevel; Justesen, Tor Fog; Dohn, Anders Høeg

    2012-01-01

    In the Home Care Crew Scheduling Problem a staff of home carers has to be assigned a number of visits to patients’ homes, such that the overall service level is maximised. The problem is a generalisation of the vehicle routing problem with time windows. Required travel time between visits and time...... preference constraints. The algorithm is tested both on real-life problem instances and on generated test instances inspired by realistic settings. The use of the specialised branching scheme on real-life problems is novel. The visit clustering decreases run times significantly, and only gives a loss...... windows of the visits must be respected. The challenge when assigning visits to home carers lies in the existence of soft preference constraints and in temporal dependencies between the start times of visits.We model the problem as a set partitioning problem with side constraints and develop an exact...

  14. A hybrid algorithm for flexible job-shop scheduling problem with setup times

    Directory of Open Access Journals (Sweden)

    Ameni Azzouz

    2017-01-01

    Full Text Available Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines. Each job consists of a specific set of operations, which have to be processed according to a given order. The Flexible Job Shop problem (FJSP is a generalization of the above-mentioned problem, where each operation can be processed by a set of resources and has a processing time depending on the resource used. The FJSP problems cover two difficulties, namely, machine assignment problem and operation sequencing problem. This paper addresses the flexible job-shop scheduling problem with sequence-dependent setup times to minimize two kinds of objectives function: makespan and bi-criteria objective function. For that, we propose a hybrid algorithm based on genetic algorithm (GA and variable neighbourhood search (VNS to solve this problem. To evaluate the performance of our algorithm, we compare our results with other methods existing in literature. All the results show the superiority of our algorithm against the available ones in terms of solution quality.

  15. Multi-objective problem of the modified distributed parallel machine and assembly scheduling problem (MDPMASP) with eligibility constraints

    Science.gov (United States)

    Amallynda, I.; Santosa, B.

    2017-11-01

    This paper proposes a new generalization of the distributed parallel machine and assembly scheduling problem (DPMASP) with eligibility constraints referred to as the modified distributed parallel machine and assembly scheduling problem (MDPMASP) with eligibility constraints. Within this generalization, we assume that there are a set non-identical factories or production lines, each one with a set unrelated parallel machine with different speeds in processing them disposed to a single assembly machine in series. A set of different products that are manufactured through an assembly program of a set of components (jobs) according to the requested demand. Each product requires several kinds of jobs with different sizes. Beside that we also consider to the multi-objective problem (MOP) of minimizing mean flow time and the number of tardy products simultaneously. This is known to be NP-Hard problem, is important to practice, as the former criterions to reflect the customer's demand and manufacturer's perspective. This is a realistic and complex problem with wide range of possible solutions, we propose four simple heuristics and two metaheuristics to solve it. Various parameters of the proposed metaheuristic algorithms are discussed and calibrated by means of Taguchi technique. All proposed algorithms are tested by Matlab software. Our computational experiments indicate that the proposed problem and fourth proposed algorithms are able to be implemented and can be used to solve moderately-sized instances, and giving efficient solutions, which are close to optimum in most cases.

  16. A Bee Colony Optimization Approach for Mixed Blocking Constraints Flow Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Mostafa Khorramizadeh

    2015-01-01

    Full Text Available The flow shop scheduling problems with mixed blocking constraints with minimization of makespan are investigated. The Taguchi orthogonal arrays and path relinking along with some efficient local search methods are used to develop a metaheuristic algorithm based on bee colony optimization. In order to compare the performance of the proposed algorithm, two well-known test problems are considered. Computational results show that the presented algorithm has comparative performance with well-known algorithms of the literature, especially for the large sized problems.

  17. A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates

    Directory of Open Access Journals (Sweden)

    Tao Ren

    2015-01-01

    Full Text Available This paper discusses the flow shop scheduling problem to minimize the makespan with release dates. By resequencing the jobs, a modified heuristic algorithm is obtained for handling large-sized problems. Moreover, based on some properties, a local search scheme is provided to improve the heuristic to gain high-quality solution for moderate-sized problems. A sequence-independent lower bound is presented to evaluate the performance of the algorithms. A series of simulation results demonstrate the effectiveness of the proposed algorithms.

  18. Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search

    DEFF Research Database (Denmark)

    Pedersen, C.R.; Rasmussen, R.V.; Andersen, Kim Allan

    2007-01-01

    exploitation of the elastic jobs and solve the problem using a tabu search procedure. Finding an initial feasible solution is in general -complete, but the tabu search procedure includes a specialized heuristic for solving this problem. The solution method has proven to be very efficient and leads......This paper presents a solution method for minimizing makespan of a practical large-scale scheduling problem with elastic jobs. The jobs are processed on three servers and restricted by precedence constraints, time windows and capacity limitations. We derive a new method for approximating the server...... to a significant decrease in makespan compared to the strategy currently implemented....

  19. Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search

    DEFF Research Database (Denmark)

    Pedersen, C.R.; Rasmussen, R.V.; Andersen, Kim Allan

    2007-01-01

    This paper presents a solution method for minimizing makespan of a practical large-scale scheduling problem with elastic jobs. The jobs are processed on three servers and restricted by precedence constraints, time windows and capacity limitations. We derive a new method for approximating the server...... exploitation of the elastic jobs and solve the problem using a tabu search procedure. Finding an initial feasible solution is in general -complete, but the tabu search procedure includes a specialized heuristic for solving this problem. The solution method has proven to be very efficient and leads...

  20. Improved teaching-learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

    Science.gov (United States)

    Buddala, Raviteja; Mahapatra, Siba Sankar

    2017-11-01

    Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having `g' operations is performed on `g' operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem becomes a flexible flow shop problem (FFSP). FFSP which contains all the complexities involved in a simple flow shop and parallel machine scheduling problems is a well-known NP-hard (Non-deterministic polynomial time) problem. Owing to high computational complexity involved in solving these problems, it is not always possible to obtain an optimal solution in a reasonable computation time. To obtain near-optimal solutions in a reasonable computation time, a large variety of meta-heuristics have been proposed in the past. However, tuning algorithm-specific parameters for solving FFSP is rather tricky and time consuming. To address this limitation, teaching-learning-based optimization (TLBO) and JAYA algorithm are chosen for the study because these are not only recent meta-heuristics but they do not require tuning of algorithm-specific parameters. Although these algorithms seem to be elegant, they lose solution diversity after few iterations and get trapped at the local optima. To alleviate such drawback, a new local search procedure is proposed in this paper to improve the solution quality. Further, mutation strategy (inspired from genetic algorithm) is incorporated in the basic algorithm to maintain solution diversity in the population. Computational experiments have been conducted on standard benchmark problems to calculate makespan and computational time. It is found that the rate of convergence of TLBO is superior to JAYA. From the results, it is found that TLBO and JAYA outperform many algorithms reported in the literature and can be treated as efficient methods for solving the FFSP.

  1. A Three-Stage Optimization Algorithm for the Stochastic Parallel Machine Scheduling Problem with Adjustable Production Rates

    Directory of Open Access Journals (Sweden)

    Rui Zhang

    2013-01-01

    Full Text Available We consider a parallel machine scheduling problem with random processing/setup times and adjustable production rates. The objective functions to be minimized consist of two parts; the first part is related with the due date performance (i.e., the tardiness of the jobs, while the second part is related with the setting of machine speeds. Therefore, the decision variables include both the production schedule (sequences of jobs and the production rate of each machine. The optimization process, however, is significantly complicated by the stochastic factors in the manufacturing system. To address the difficulty, a simulation-based three-stage optimization framework is presented in this paper for high-quality robust solutions to the integrated scheduling problem. The first stage (crude optimization is featured by the ordinal optimization theory, the second stage (finer optimization is implemented with a metaheuristic called differential evolution, and the third stage (fine-tuning is characterized by a perturbation-based local search. Finally, computational experiments are conducted to verify the effectiveness of the proposed approach. Sensitivity analysis and practical implications are also discussed.

  2. Simultaneous planning of the project scheduling and material procurement problem under the presence of multiple suppliers

    Science.gov (United States)

    Tabrizi, Babak H.; Ghaderi, Seyed Farid

    2016-09-01

    Simultaneous planning of project scheduling and material procurement can improve the project execution costs. Hence, the issue has been addressed here by a mixed-integer programming model. The proposed model facilitates the procurement decisions by accounting for a number of suppliers offering a distinctive discount formula from which to purchase the required materials. It is aimed at developing schedules with the best net present value regarding the obtained benefit and costs of the project execution. A genetic algorithm is applied to deal with the problem, in addition to a modified version equipped with a variable neighbourhood search. The underlying factors of the solution methods are calibrated by the Taguchi method to obtain robust solutions. The performance of the aforementioned methods is compared for different problem sizes, in which the utilized local search proved efficient. Finally, a sensitivity analysis is carried out to check the effect of inflation on the objective function value.

  3. An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times

    Directory of Open Access Journals (Sweden)

    Rui Zhang

    2011-09-01

    Full Text Available Due to the influence of unpredictable random events, the processing time of each operation should be treated as random variables if we aim at a robust production schedule. However, compared with the extensive research on the deterministic model, the stochastic job shop scheduling problem (SJSSP has not received sufficient attention. In this paper, we propose an artificial bee colony (ABC algorithm for SJSSP with the objective of minimizing the maximum lateness (which is an index of service quality. First, we propose a performance estimate for preliminary screening of the candidate solutions. Then, the K-armed bandit model is utilized for reducing the computational burden in the exact evaluation (through Monte Carlo simulation process. Finally, the computational results on different-scale test problems validate the effectiveness and efficiency of the proposed approach.

  4. The Green Ship Routing and Scheduling Problem (GSRSP): A conceptual approach

    DEFF Research Database (Denmark)

    Kontovas, Christos A.

    2014-01-01

    Recent reviews of the literature on ship routing and scheduling note the increased attention to environmental issues. This is an area of paramount importance for international shipping and will be even more so in the future. This short communication is motivated by the increasing attention......) based on existing formulations and highlights all the important parameters of the problem. (C) 2014 Elsevier Ltd. All rights reserved....

  5. Greedy and metaheuristics for the offline scheduling problem in grid computing

    DEFF Research Database (Denmark)

    Gamst, Mette

    In grid computing a number of geographically distributed resources connected through a wide area network, are utilized as one computations unit. The NP-hard offline scheduling problem in grid computing consists of assigning jobs to resources in advance. In this paper, five greedy heuristics and two....... All heuristics solve instances with up to 2000 jobs and 1000 resources, thus the results are useful both with respect to running times and to solution values....

  6. Solving and Interpreting Large-scale Harvest Scheduling Problems by Duality and Decomposition

    OpenAIRE

    Berck, Peter; Bible, Thomas

    1982-01-01

    This paper presents a solution to the forest planning problem that takes advantage of both the duality of linear programming formulations currently being used for harvest scheduling and the characteristics of decomposition inherent in the forest land class-relationship. The subproblems of decomposition, defined as the dual, can be solved in a simple, recursive fashion. In effect, such a technique reduces the computational burden in terms of time and computer storage as compared to the traditi...

  7. Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem

    Directory of Open Access Journals (Sweden)

    K. Belkadi

    2006-01-01

    Full Text Available This paper addresses scheduling problems in hybrid flow shop-like systems with a migration parallel genetic algorithm (PGA_MIG. This parallel genetic algorithm model allows genetic diversity by the application of selection and reproduction mechanisms nearer to nature. The space structure of the population is modified by dividing it into disjoined subpopulations. From time to time, individuals are exchanged between the different subpopulations (migration. Influence of parameters and dedicated strategies are studied. These parameters are the number of independent subpopulations, the interconnection topology between subpopulations, the choice/replacement strategy of the migrant individuals, and the migration frequency. A comparison between the sequential and parallel version of genetic algorithm (GA is provided. This comparison relates to the quality of the solution and the execution time of the two versions. The efficiency of the parallel model highly depends on the parameters and especially on the migration frequency. In the same way this parallel model gives a significant improvement of computational time if it is implemented on a parallel architecture which offers an acceptable number of processors (as many processors as subpopulations.

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

    Science.gov (United States)

    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.

  9. Technical Report: Optimizing the Slab Yard Planning and Crane Scheduling Problem using a Two-Stage Approach

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Clausen, Jens

    2008-01-01

    In this paper, we present The Slab Yard Planning and Crane Scheduling Problem. The problem has its origin in steel production facilities with a large throughput. A slab yard is used as a buffer for slabs that are needed in the upcoming production. Slabs are transported by cranes and the problem...... considered here, is concerned with the generation of schedules for these. The problem is decomposed and modeled in two parts, namely a planning problem and a scheduling problem. In the planning problem a set of crane operations is created to take the yard from its current state to a desired goal state...... schedule for the cranes is generated, where each operation is assigned to a crane and is given a specific time of initiation. For both models, a thorough description of the modeling details is given along with a specification of objective criteria. Variants of the models are presented as well. Preliminary...

  10. Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem

    Directory of Open Access Journals (Sweden)

    S. Molla-Alizadeh-Zavardehi

    2014-01-01

    Full Text Available This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA, variable neighborhood search (VNS, and simulated annealing (SA frameworks. Besides, we propose three fuzzy earliest due date heuristics to solve the given problem. Through computational experiments with several random test problems, a robust calibration is applied on the parameters. Finally, computational results on different-scale test problems are presented to compare the proposed algorithms.

  11. A Novel Joint Problem of Routing, Scheduling, and Variable-Width Channel Allocation in WMNs

    Directory of Open Access Journals (Sweden)

    Chun-Cheng Lin

    2014-01-01

    Full Text Available This paper investigates a novel joint problem of routing, scheduling, and channel allocation for single-radio multichannel wireless mesh networks in which multiple channel widths can be adjusted dynamically through a new software technology so that more concurrent transmissions and suppressed overlapping channel interference can be achieved. Although the previous works have studied this joint problem, their linear programming models for the problem were not incorporated with some delicate constraints. As a result, this paper first constructs a linear programming model with more practical concerns and then proposes a simulated annealing approach with a novel encoding mechanism, in which the configurations of multiple time slots are devised to characterize the dynamic transmission process. Experimental results show that our approach can find the same or similar solutions as the optimal solutions for smaller-scale problems and can efficiently find good-quality solutions for a variety of larger-scale problems.

  12. Literature Review on the Hybrid Flow Shop Scheduling Problem with Unrelated Parallel Machines

    Directory of Open Access Journals (Sweden)

    Eliana Marcela Peña Tibaduiza

    2017-01-01

    Full Text Available Context: The flow shop hybrid problem with unrelated parallel machines has been less studied in the academia compared to the flow shop hybrid with identical processors. For this reason, there are few reports about the kind of application of this problem in industries. Method: A literature review of the state of the art on flow-shop scheduling problem was conducted by collecting and analyzing academic papers on several scientific databases. For this aim, a search query was constructed using keywords defining the problem and checking the inclusion of unrelated parallel machines in such definition; as a result, 50 papers were finally selected for this study. Results: A classification of the problem according to the characteristics of the production system was performed, also solution methods, constraints and objective functions commonly used are presented. Conclusions: An increasing trend is observed in studies of flow shop with multiple stages, but few are based on industry case-studies.

  13. Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Mohammed Al-Salem

    2016-01-01

    Full Text Available The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD for a set of jobs when their weights equal 1 (unweighted problem. This objective became very significant after the introduction of the Just in Time manufacturing approach. A procedure to determine whether the CDD is restricted or unrestricted is developed and a semirestricted CDD is defined. Algorithms are introduced to find the optimal solution when the CDD is unrestricted and semirestricted. When the CDD is restricted, which is a much harder problem, a heuristic algorithm is proposed to find approximate solutions. Through computational experiments, the heuristic algorithms’ performance is evaluated with problems up to 500 jobs.

  14. Scheduling and control strategies for the departure problem in air traffic control

    Science.gov (United States)

    Bolender, Michael Alan

    Two problems relating to the departure problem in air traffic control automation are examined. The first problem that is addressed is the scheduling of aircraft for departure. The departure operations at a major US hub airport are analyzed, and a discrete event simulation of the departure operations is constructed. Specifically, the case where there is a single departure runway is considered. The runway is fed by two queues of aircraft. Each queue, in turn, is fed by a single taxiway. Two salient areas regarding scheduling are addressed. The first is the construction of optimal departure sequences for the aircraft that are queued. Several greedy search algorithms are designed to minimize the total time to depart a set of queued aircraft. Each algorithm has a different set of heuristic rules to resolve situations within the search space whenever two branches of the search tree with equal edge costs are encountered. These algorithms are then compared and contrasted with a genetic search algorithm in order to assess the performance of the heuristics. This is done in the context of a static departure problem where the length of the departure queue is fixed. A greedy algorithm which deepens the search whenever two branches of the search tree with non-unique costs are encountered is shown to outperform the other heuristic algorithms. This search strategy is then implemented in the discrete event simulation. A baseline performance level is established, and a sensitivity analysis is performed by implementing changes in traffic mix, routing, and miles-in-trail restrictions for comparison. It is concluded that to minimize the average time spent in the queue for different traffic conditions, a queue assignment algorithm is needed to maintain an even balance of aircraft in the queues. A necessary consideration is to base queue assignment upon traffic management restrictions such as miles-in-trail constraints. The second problem addresses the technical challenges associated

  15. Common Sleep, Psychiatric, and Somatic Problems According to Work Schedule: an Internet Survey in an Eastern European Country.

    Science.gov (United States)

    Voinescu, Bogdan I

    2018-03-19

    A wide range of health problems was investigated, aiming to identify the presence and severity of a set of self-reported and common sleep, psychiatric, and somatic health problems among working professionals in four different shift schedules (morning, evening, rotating, and day) in several cities in Romania. A heterogeneous sample of 488 workers of different professions completed online a battery of tests, namely the Basic Nordic Sleep Questionnaire, the Parasomnia Questionnaire, the Epworth Sleepiness Scale, and the Patient Health Questionnaire, designed to identity symptoms of insomnia, sleepiness, snoring, parasomnia, as well as of depression, anxiety, eating, somatoform, and alcohol use disorders, respectively. The timing and the duration of the sleep, along with the presence of high blood pressure and type 2 diabetes mellitus were also inquired. The prevalence of the different health problems in relation to the type of shift schedule was evaluated with the Pearson Chi-square test. ANOVA was used to calculate the significance of the difference between the means, while associations with different health problems were estimated by binary logistic regression. The most common mental health problems were depression (26%), insomnia (20%), alcohol misuse (18%), and anxiety (17%). No significant differences based on the type of shift in terms of health problems were found, except for high blood pressure and symptoms of panic disorder that were more frequently reported by the workers in early morning shifts. Together with the workers in rotating shifts, they also reported increased sleepiness, poorer sleep quality, and shorter sleep duration. In contrast, the workers in evening shifts reported less severe health problems and longer sleep duration. Working in early morning shifts was found to be associated with poorer health outcomes, while working in rotating and early morning shifts with more severe sleep-related problems.

  16. Multi-Objective Flexible Flow Shop Scheduling Problem Considering Variable Processing Time due to Renewable Energy

    Directory of Open Access Journals (Sweden)

    Xiuli Wu

    2018-03-01

    Full Text Available Renewable energy is an alternative to non-renewable energy to reduce the carbon footprint of manufacturing systems. Finding out how to make an alternative energy-efficient scheduling solution when renewable and non-renewable energy drives production is of great importance. In this paper, a multi-objective flexible flow shop scheduling problem that considers variable processing time due to renewable energy (MFFSP-VPTRE is studied. First, the optimization model of the MFFSP-VPTRE is formulated considering the periodicity of renewable energy and the limitations of energy storage capacity. Then, a hybrid non-dominated sorting genetic algorithm with variable local search (HNSGA-II is proposed to solve the MFFSP-VPTRE. An operation and machine-based encoding method is employed. A low-carbon scheduling algorithm is presented. Besides the crossover and mutation, a variable local search is used to improve the offspring’s Pareto set. The offspring and the parents are combined and those that dominate more are selected to continue evolving. Finally, two groups of experiments are carried out. The results show that the low-carbon scheduling algorithm can effectively reduce the carbon footprint under the premise of makespan optimization and the HNSGA-II outperforms the traditional NSGA-II and can solve the MFFSP-VPTRE effectively and efficiently.

  17. Study on multi-objective flexible job-shop scheduling problem considering energy consumption

    Directory of Open Access Journals (Sweden)

    Zengqiang Jiang

    2014-06-01

    Full Text Available Purpose: Build a multi-objective Flexible Job-shop Scheduling Problem(FJSP optimization model, in which the makespan, processing cost, energy consumption and cost-weighted processing quality are considered, then Design a Modified Non-dominated Sorting Genetic Algorithm (NSGA-II based on blood variation for above scheduling model.Design/methodology/approach: A multi-objective optimization theory based on Pareto optimal method is used in carrying out the optimization model. NSGA-II is used to solve the model.Findings: By analyzing the research status and insufficiency of multi-objective FJSP, Find that the difference in scheduling will also have an effect on energy consumption in machining process and environmental emissions. Therefore, job-shop scheduling requires not only guaranteeing the processing quality, time and cost, but also optimizing operation plan of machines and minimizing energy consumption.Originality/value: A multi-objective FJSP optimization model is put forward, in which the makespan, processing cost, energy consumption and cost-weighted processing quality are considered. According to above model, Blood-Variation-based NSGA-II (BVNSGA-II is designed. In which, the chromosome mutation rate is determined after calculating the blood relationship between two cross chromosomes, crossover and mutation strategy of NSGA-II is optimized and the prematurity of population is overcome. Finally, the performance of the proposed model and algorithm is evaluated through a case study, and the results proved the efficiency and feasibility of the proposed model and algorithm.

  18. Variable sleep schedules and outcomes in children with psychopathological problems: preliminary observations

    Directory of Open Access Journals (Sweden)

    Spruyt K

    2012-02-01

    Full Text Available Karen Spruyt1, Danielle L Raubuck2, Katie Grogan2, David Gozal1, Mark A Stein21Department of Pediatrics and Comer Children’s Hospital, Pritzker School of Medicine, University of Chicago, Chicago, IL; 2Institute for Juvenile Research, Hyperactivity and Learning Problems Clinic, University of Illinois at Chicago, Chicago, ILBackground: Night-to-night variability in sleep of children with attention deficit hyperactivity disorder (ADHD may be a mediator of behavioral phenotype. We examined the potential association between alertness, sleep, and eating behaviors in children with ADHD and comorbid problems.Methods: Sleep was monitored by actigraphy for 7 days. Questionnaires were used to assess sleep complaints, habits and food patterns by parental report, and sleep complaints and sleepiness by child report.Results: The group comprised 18 children, including 15 boys, aged 9.4 ± 1.7 years, 88.9% Caucasian, who took one or multiple medications. Children slept on average for 6 hours and 58 minutes with a variability of 1 hour 3 minutes relative to the mean, and their sleepiness scores were highly variable from day to day. Most children had a normal body mass index (BMI. Sleepiness and BMI were associated with sleep schedules and food patterns, such that they accounted for 76% of variance, predominantly by the association of BMI with mean wake after sleep onset and by bedtime sleepiness, with wake after sleep onset variability. Similarly, 97% of variance was shared with eating behaviors, such as desserts and snacks, and fast food meals were associated with morning sleepiness.Conclusion: Disrupted sleep and sleepiness appears to favor unhealthy food patterns and may place children with ADHD at increased risk for obesity.Keywords: sleep, child, attention deficit hyperactivity disorder, actigraphy

  19. A matheuristic approach for solving the Integrated Timetabling and Vehicle Scheduling Problem

    DEFF Research Database (Denmark)

    Fonseca, Joao Filipe Paiva; Larsen, Allan; van der Hurk, Evelien

    between different trips. We consider transfers between bus trips scheduled by the model, but also transfers to other fixed lines that intersect the lines considered in the IT-VSP. We present a MIP formulation of the IT-VSP able to solve small instances of the problem, and a matheuristic approach that uses...... the compact MIP to solve larger instances of the problem. The idea is to iteratively solve restricted versions of the MIP selecting at each step a subset of trips where modifications are allowed, while all other trips remain fixed. The performance of the proposed matheuristic is shown on a case study...

  20. A novel modeling approach for job shop scheduling problem under uncertainty

    Directory of Open Access Journals (Sweden)

    Behnam Beheshti Pur

    2013-11-01

    Full Text Available When aiming on improving efficiency and reducing cost in manufacturing environments, production scheduling can play an important role. Although a common workshop is full of uncertainties, when using mathematical programs researchers have mainly focused on deterministic problems. After briefly reviewing and discussing popular modeling approaches in the field of stochastic programming, this paper proposes a new approach based on utility theory for a certain range of problems and under some practical assumptions. Expected utility programming, as the proposed approach, will be compared with the other well-known methods and its meaningfulness and usefulness will be illustrated via a numerical examples and a real case.

  1. New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

    Science.gov (United States)

    Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid

    2017-09-01

    In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0-1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.

  2. Maximizing the nurses' preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm

    Science.gov (United States)

    Jafari, Hamed; Salmasi, Nasser

    2015-09-01

    The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital's demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses' preferences for working shifts and weekends off by considering several important factors such as hospital's policies, labor laws, governmental regulations, and the status of nurses at the end of the previous planning horizon in one of the largest hospitals in Iran i.e., Milad Hospital. Due to the shortage of available nurses, at first, the minimum total number of required nurses is determined. Then, a mathematical programming model is proposed to solve the problem optimally. Since the proposed research problem is NP-hard, a meta-heuristic algorithm based on simulated annealing (SA) is applied to heuristically solve the problem in a reasonable time. An initial feasible solution generator and several novel neighborhood structures are applied to enhance performance of the SA algorithm. Inspired from our observations in Milad hospital, random test problems are generated to evaluate the performance of the SA algorithm. The results of computational experiments indicate that the applied SA algorithm provides solutions with average percentage gap of 5.49 % compared to the upper bounds obtained from the mathematical model. Moreover, the applied SA algorithm provides significantly better solutions in a reasonable time than the schedules provided by the head nurses.

  3. Comparing Mixed & Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Renata Melo e Silva de Oliveira

    2015-03-01

    Full Text Available Scheduling is a key factor for operations management as well as for business success. From industrial Job-shop Scheduling problems (JSSP, many optimization challenges have emerged since de 1960s when improvements have been continuously required such as bottlenecks allocation, lead-time reductions and reducing response time to requests.  With this in perspective, this work aims to discuss 3 different optimization models for minimizing Makespan. Those 3 models were applied on 17 classical problems of examples JSSP and produced different outputs.  The first model resorts on Mixed and Integer Programming (MIP and it resulted on optimizing 60% of the studied problems. The other models were based on Constraint Programming (CP and approached the problem in two different ways: a model CP1 is a standard IBM algorithm whereof restrictions have an interval structure that fail to solve 53% of the proposed instances, b Model CP-2 approaches the problem with disjunctive constraints and optimized 88% of the instances. In this work, each model is individually analyzed and then compared considering: i Optimization success performance, ii Computational processing time, iii Greatest Resource Utilization and, iv Minimum Work-in-process Inventory. Results demonstrated that CP-2 presented best results on criteria i and ii, but MIP was superior on criteria iii and iv and those findings are discussed at the final section of this work.

  4. A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

    DEFF Research Database (Denmark)

    Wen, Min; Krapper, Emil; Larsen, Jesper

    2011-01-01

    in their fresh meat supply logistics system. The problem consists of a 1‐week planning horizon, heterogeneous vehicles, and drivers with predefined work regulations. These regulations include, among other things, predefined workdays, fixed starting time, maximum weekly working duration, and a break rule......The world's second largest producer of pork, Danish Crown, also provides a fresh meat supply logistics system within Denmark. This is used by the majority of supermarkets in Denmark. This article addresses an integrated vehicle routing and driver scheduling problem arising at Danish Crown....... The objective is to minimize the total delivery cost that is a weighted sum of two kinds of delivery costs. A multilevel variable neighborhood search heuristic is proposed for the problem. In a preprocessing step, the problem size is reduced through an aggregation procedure. Thereafter, the aggregated weekly...

  5. A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem

    DEFF Research Database (Denmark)

    Rahmati, Seyed Habib A.; Ahmadi, Abbas; Govindan, Kannan

    2018-01-01

    the level of the system optimization. By means of this equipment, managers can benefit from a condition-based maintenance (CBM) for monitoring and managing their system. The chief aim of the paper is to develop a stochastic maintenance problem based on CBM activities engaged with a complex applied......Integrated consideration of production planning and maintenance processes is a real world assumption. Specifically, by improving the monitoring equipment such as various sensors or product-embedded information devices in recent years, joint assessment of these processes is inevitable for enhancing...... production problem called flexible job shop scheduling problem (FJSP). This integrated problem considers two maintenance scenarios in terms of corrective maintenance (CM) and preventive maintenance (PM). The activation of scenario is done by monitoring the degradation condition of the system and comparing...

  6. New Mathematical Model and Algorithm for Economic Lot Scheduling Problem in Flexible Flow Shop

    Directory of Open Access Journals (Sweden)

    H. Zohali

    2018-03-01

    Full Text Available This paper addresses the lot sizing and scheduling problem for a number of products in flexible flow shop with identical parallel machines. The production stages are in series, while separated by finite intermediate buffers. The objective is to minimize the sum of setup and inventory holding costs per unit of time. The available mathematical model of this problem in the literature suffers from huge complexity in terms of size and computation. In this paper, a new mixed integer linear program is developed for delay with the huge dimentions of the problem. Also, a new meta heuristic algorithm is developed for the problem. The results of the numerical experiments represent a significant advantage of the proposed model and algorithm compared with the available models and algorithms in the literature.

  7. The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

    DEFF Research Database (Denmark)

    Brouer, Berit Dangaard; Dirksen, Jakob; Pisinger, David

    2013-01-01

    or even omitting one. We present the Vessel Schedule Recovery Problem (VSRP) to evaluate a given disruption scenario and to select a recovery action balancing the trade off between increased bunker consumption and the impact on cargo in the remaining network and the customer service level. It is proven...... due to adverse weather conditions, port contingencies, and many other issues. A common scenario for recovering a schedule is to either increase the speed at the cost of a significant increase in the fuel consumption or delaying cargo. Advanced recovery options might exist by swapping two port calls...... that the VSRP is NP-hard. The model is applied to four real life cases from Maersk Line and results are achieved in less than 5seconds with solutions comparable or superior to those chosen by operations managers in real life. Cost savings of up to 58% may be achieved by the suggested solutions compared...

  8. The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Denis Pinha

    2016-11-01

    Full Text Available This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practical situations where the definition of optimal changes on a regular basis. The proposed approach empowers the project manager to determine what is optimal, on a given day, under the current constraints, such as, change of priorities, lack of skilled worker. The proposed method utilizes a simulation approach to determine feasible solutions, under the current constraints. Resources can be non-consumable, consumable, or doubly constrained. The paper also presents a real-life case study dealing with scheduling of ship repair activities.

  9. Application of Operational Research Techniques in Operating Room Scheduling Problems: Literature Overview

    Directory of Open Access Journals (Sweden)

    Şeyda Gür

    2018-01-01

    Full Text Available Increased healthcare costs are pushing hospitals to reduce costs and increase the quality of care. Operating rooms are the most important source of income and expense for hospitals. Therefore, the hospital management focuses on the effectiveness of schedules and plans. This study includes analyses of recent research on operating room scheduling and planning. Most studies in the literature, from 2000 to the present day, were evaluated according to patient characteristics, performance measures, solution techniques used in the research, the uncertainty of the problem, applicability of the research, and the planning strategy to be dealt within the solution. One hundred seventy studies were examined in detail, after scanning the Emerald, Science Direct, JSTOR, Springer, Taylor and Francis, and Google Scholar databases. To facilitate the identification of these studies, they are grouped according to the different criteria of concern and then, a detailed overview is presented.

  10. A fast method for the unit scheduling problem with significant renewable power generation

    International Nuclear Information System (INIS)

    Osório, G.J.; Lujano-Rojas, J.M.; Matias, J.C.O.; Catalão, J.P.S.

    2015-01-01

    Highlights: • A model to the scheduling of power systems with significant renewable power generation is provided. • A new methodology that takes information from the analysis of each scenario separately is proposed. • Based on a probabilistic analysis, unit scheduling and corresponding economic dispatch are estimated. • A comparison with others methodologies is in favour of the proposed approach. - Abstract: Optimal operation of power systems with high integration of renewable power sources has become difficult as a consequence of the random nature of some sources like wind energy and photovoltaic energy. Nowadays, this problem is solved using Monte Carlo Simulation (MCS) approach, which allows considering important statistical characteristics of wind and solar power production such as the correlation between consecutive observations, the diurnal profile of the forecasted power production, and the forecasting error. However, MCS method requires the analysis of a representative amount of trials, which is an intensive calculation task that increases considerably with the number of scenarios considered. In this paper, a model to the scheduling of power systems with significant renewable power generation based on scenario generation/reduction method, which establishes a proportional relationship between the number of scenarios and the computational time required to analyse them, is proposed. The methodology takes information from the analysis of each scenario separately to determine the probabilistic behaviour of each generator at each hour in the scheduling problem. Then, considering a determined significance level, the units to be committed are selected and the load dispatch is determined. The proposed technique was illustrated through a case study and the comparison with stochastic programming approach was carried out, concluding that the proposed methodology can provide an acceptable solution in a reduced computational time

  11. Robust Parallel Machine Scheduling Problem with Uncertainties and Sequence-Dependent Setup Time

    Directory of Open Access Journals (Sweden)

    Hongtao Hu

    2016-01-01

    Full Text Available A parallel machine scheduling problem in plastic production is studied in this paper. In this problem, the processing time and arrival time are uncertain but lie in their respective intervals. In addition, each job must be processed together with a mold while jobs which belong to one family can share the same mold. Therefore, time changing mold is required for two consecutive jobs that belong to different families, which is known as sequence-dependent setup time. This paper aims to identify a robust schedule by min–max regret criterion. It is proved that the scenario incurring maximal regret for each feasible solution lies in finite extreme scenarios. A mixed integer linear programming formulation and an exact algorithm are proposed to solve the problem. Moreover, a modified artificial bee colony algorithm is developed to solve large-scale problems. The performance of the presented algorithm is evaluated through extensive computational experiments and the results show that the proposed algorithm surpasses the exact method in terms of objective value and computational time.

  12. A Two-Stage Stochastic Mixed-Integer Programming Approach to the Smart House Scheduling Problem

    Science.gov (United States)

    Ozoe, Shunsuke; Tanaka, Yoichi; Fukushima, Masao

    A “Smart House” is a highly energy-optimized house equipped with photovoltaic systems (PV systems), electric battery systems, fuel cell cogeneration systems (FC systems), electric vehicles (EVs) and so on. Smart houses are attracting much attention recently thanks to their enhanced ability to save energy by making full use of renewable energy and by achieving power grid stability despite an increased power draw for installed PV systems. Yet running a smart house's power system, with its multiple power sources and power storages, is no simple task. In this paper, we consider the problem of power scheduling for a smart house with a PV system, an FC system and an EV. We formulate the problem as a mixed integer programming problem, and then extend it to a stochastic programming problem involving recourse costs to cope with uncertain electricity demand, heat demand and PV power generation. Using our method, we seek to achieve the optimal power schedule running at the minimum expected operation cost. We present some results of numerical experiments with data on real-life demands and PV power generation to show the effectiveness of our method.

  13. Flexible Job Shop Scheduling Problem Using an Improved Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Lei Wang

    2017-01-01

    Full Text Available As an extension of the classical job shop scheduling problem, the flexible job shop scheduling problem (FJSP plays an important role in real production systems. In FJSP, an operation is allowed to be processed on more than one alternative machine. It has been proven to be a strongly NP-hard problem. Ant colony optimization (ACO has been proven to be an efficient approach for dealing with FJSP. However, the basic ACO has two main disadvantages including low computational efficiency and local optimum. In order to overcome these two disadvantages, an improved ant colony optimization (IACO is proposed to optimize the makespan for FJSP. The following aspects are done on our improved ant colony optimization algorithm: select machine rule problems, initialize uniform distributed mechanism for ants, change pheromone’s guiding mechanism, select node method, and update pheromone’s mechanism. An actual production instance and two sets of well-known benchmark instances are tested and comparisons with some other approaches verify the effectiveness of the proposed IACO. The results reveal that our proposed IACO can provide better solution in a reasonable computational time.

  14. A Pareto archive floating search procedure for solving multi-objective flexible job shop scheduling problem

    Directory of Open Access Journals (Sweden)

    J. S. Sadaghiani

    2014-04-01

    Full Text Available Flexible job shop scheduling problem is a key factor of using efficiently in production systems. This paper attempts to simultaneously optimize three objectives including minimization of the make span, total workload and maximum workload of jobs. Since the multi objective flexible job shop scheduling problem is strongly NP-Hard, an integrated heuristic approach has been used to solve it. The proposed approach was based on a floating search procedure that has used some heuristic algorithms. Within floating search procedure utilize local heuristic algorithms; it makes the considered problem into two sections including assigning and sequencing sub problem. First of all search is done upon assignment space achieving an acceptable solution and then search would continue on sequencing space based on a heuristic algorithm. This paper has used a multi-objective approach for producing Pareto solution. Thus proposed approach was adapted on NSGA II algorithm and evaluated Pareto-archives. The elements and parameters of the proposed algorithms were adjusted upon preliminary experiments. Finally, computational results were used to analyze efficiency of the proposed algorithm and this results showed that the proposed algorithm capable to produce efficient solutions.

  15. Variable Neighbourhood Search and Mathematical Programming for Just-in-Time Job-Shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Sunxin Wang

    2014-01-01

    Full Text Available This paper presents a combination of variable neighbourhood search and mathematical programming to minimize the sum of earliness and tardiness penalty costs of all operations for just-in-time job-shop scheduling problem (JITJSSP. Unlike classical E/T scheduling problem with each job having its earliness or tardiness penalty cost, each operation in this paper has its earliness and tardiness penalties, which are paid if the operation is completed before or after its due date. Our hybrid algorithm combines (i a variable neighbourhood search procedure to explore the huge feasible solution spaces efficiently by alternating the swap and insertion neighbourhood structures and (ii a mathematical programming model to optimize the completion times of the operations for a given solution in each iteration procedure. Additionally, a threshold accepting mechanism is proposed to diversify the local search of variable neighbourhood search. Computational results on the 72 benchmark instances show that our algorithm can obtain the best known solution for 40 problems, and the best known solutions for 33 problems are updated.

  16. Scheduling by positional completion times: analysis of a two-stage flow shop problem with a batching machine

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Velde, van de S.L.

    1998-01-01

    We consider a scheduling problem introduced by Ahmadi et al., Batching and scheduling jobs on batch and discrete processors, Operation Research 40 (1992) 750–763, in which each job has to be prepared before it can be processed. The preparation is performed by a batching machine; it can prepare at

  17. Task-specific shell for scheduling problems, ARES[sub TM]/SCH. Scheduling mondai muke task tokka shell ARES[sub TM]/SCH

    Energy Technology Data Exchange (ETDEWEB)

    Kojima, S; Narimatsu, K [Toshiba Corp., Tokyo (Japan)

    1994-08-01

    An Expert System (ES) Shell (developed by Toshiba Corp.) which applies to the scheduling of production plan and operation plan is introduced. It describes that this tool is equipped with flowchart editor and constraint condition editor which mention the knowledge related to scheduling method, and that the former expresses scheduling procedure knowledge in the form of flowchart by combining basic tasks prepared beforehand, and the latter expresses constraint conditions which should be satisfied by the schedule, and knowledge related to the priority order which should be considered in-between in the form of IF-THEN Rule which is very close to Japanese. In addition, the knowledge is equipped with knowledge debugging system which conducts debugging while executing the knowledge. It adds that by using this tool, the manhour required for the development and maintenance of ES can be reduced considerably. 2 refs., 3 figs.

  18. An innovative artificial bee colony algorithm and its application to a practical intercell scheduling problem

    Science.gov (United States)

    Li, Dongni; Guo, Rongtao; Zhan, Rongxin; Yin, Yong

    2018-06-01

    In this article, an innovative artificial bee colony (IABC) algorithm is proposed, which incorporates two mechanisms. On the one hand, to provide the evolutionary process with a higher starting level, genetic programming (GP) is used to generate heuristic rules by exploiting the elements that constitute the problem. On the other hand, to achieve a better balance between exploration and exploitation, a leading mechanism is proposed to attract individuals towards a promising region. To evaluate the performance of IABC in solving practical and complex problems, it is applied to the intercell scheduling problem with limited transportation capacity. It is observed that the GP-generated rules incorporate the elements of the most competing human-designed rules, and they are more effective than the human-designed ones. Regarding the leading mechanism, the strategies of the ageing leader and multiple challengers make the algorithm less likely to be trapped in local optima.

  19. A Generalized Ant Colony Algorithm for Job一shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    ZHANG Hong-Guo

    2017-02-01

    Full Text Available Aiming at the problem of ant colony algorithm for solving Job一shop scheduling problem. Considering the complexity of the algorithm that uses disjunctive graph to describe the relationship between workpiece processing. To solve the problem of optimal solution,a generalized ant colony algorithm is proposed. Under the premise of considering constrained relationship between equipment and process,the pheromone update mechanism is applied to solve Job-shop scheduling problem,so as to improve the quality of the solution. In order to improve the search efficiency,according to the state transition rules of ant colony algorithm,this paper makes a detailed study on the selection and improvement of the parameters in the algorithm,and designs the pheromone update strategy. Experimental results show that a generalized ant colony algorithm is more feasible and more effective. Compared with other algorithms in the literature,the results prove that the algorithm improves in computing the optimal solution and convergence speed.

  20. A Variable Interval Rescheduling Strategy for Dynamic Flexible Job Shop Scheduling Problem by Improved Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Lei Wang

    2017-01-01

    Full Text Available In real-world manufacturing systems, production scheduling systems are often implemented under random or dynamic events like machine failure, unexpected processing times, stochastic arrival of the urgent orders, cancellation of the orders, and so on. These dynamic events will lead the initial scheduling scheme to be nonoptimal and/or infeasible. Hence, appropriate dynamic rescheduling approaches are needed to overcome the dynamic events. In this paper, we propose a dynamic rescheduling method based on variable interval rescheduling strategy (VIRS to deal with the dynamic flexible job shop scheduling problem considering machine failure, urgent job arrival, and job damage as disruptions. On the other hand, an improved genetic algorithm (GA is proposed for minimizing makespan. In our improved GA, a mix of random initialization population by combining initialization machine and initialization operation with random initialization is designed for generating high-quality initial population. In addition, the elitist strategy (ES and improved population diversity strategy (IPDS are used to avoid falling into the local optimal solution. Experimental results for static and several dynamic events in the FJSP show that our method is feasible and effective.

  1. A Genetic Algorithm-based Heuristic for Part-Feeding Mobile Robot Scheduling Problem

    DEFF Research Database (Denmark)

    Dang, Vinh Quang; Nielsen, Izabela Ewa; Bocewicz, Grzegorz

    2012-01-01

    This present study deals with the problem of sequencing feeding tasks of a single mobile robot with manipulation arm which is able to provide parts or components for feeders of machines in a manufacturing cell. The mobile robot has to be scheduled in order to keep machines within the cell producing...... products without any shortage of parts. A method based on the characteristics of feeders and inspired by the (s, Q) inventory system, is thus applied to define time windows for feeding tasks of the robot. The performance criterion is to minimize total traveling time of the robot in a given planning horizon...

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

    Science.gov (United States)

    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.

  3. An Adaptive Large Neighborhood Search Algorithm for the Resource-constrained Project Scheduling Problem

    DEFF Research Database (Denmark)

    Muller, Laurent Flindt

    2009-01-01

    We present an application of an Adaptive Large Neighborhood Search (ALNS) algorithm to the Resource-constrained Project Scheduling Problem (RCPSP). The ALNS framework was first proposed by Pisinger and Røpke [19] and can be described as a large neighborhood search algorithm with an adaptive layer......, where a set of destroy/repair neighborhoods compete to modify the current solution in each iteration of the algorithm. Experiments are performed on the wellknown J30, J60 and J120 benchmark instances, which show that the proposed algorithm is competitive and confirms the strength of the ALNS framework...

  4. An interpretation of schedule 1 of the Radioactive Substances Act 1993 and related issues

    International Nuclear Information System (INIS)

    Hill, M.; Wakerley, M.W.

    2000-09-01

    Schedule 1 of the UK's Radioactive Substances Act 1993 was originally Schedule 3 of the 1960 Act of the same name. It is possible that different methods are currently being employed to interpret how Schedule 1 should be used. This report provides an interpretation and guidance on this and related issues. It is primarily for technical specialists already familiar with the workings of the Act. This report covers the period 1999/2000

  5. Modeling Nurse Scheduling Problem Using 0-1 Goal Programming A Case Study Of Tafo Government Hospital Kumasi-Ghana

    Directory of Open Access Journals (Sweden)

    Wallace Agyei

    2015-03-01

    Full Text Available Abstract The problem of scheduling nurses at the Out-Patient Department OPD at Tafo Government Hospital Kumasi Ghana is presented. Currently the schedules are prepared by head nurse who performs this difficult and time consuming task by hand. Due to the existence of many constraints the resulting schedule usually does not guarantee the fairness of distribution of work. The problem was formulated as 0-1goal programming model with the of objective of evenly balancing the workload among nurses and satisfying their preferences as much as possible while complying with the legal and working regulations.. The developed model was then solved using LINGO14.0 software. The resulting schedules based on 0-1goal programming model balanced the workload in terms of the distribution of shift duties fairness in terms of the number of consecutive night duties and satisfied the preferences of the nurses. This is an improvement over the schedules done manually.

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

    Science.gov (United States)

    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.

  7. Hydrothermal self-scheduling problem in a day-ahead electricity market

    International Nuclear Information System (INIS)

    Bisanovic, Smajo; Dlakic, Muris; Hajro, Mensur

    2008-01-01

    This paper addresses the self-scheduling problem of determining the unit commitment status for power generation companies before submitting the hourly bids in a day-ahead market. The hydrothermal model is formulated as a deterministic optimization problem where expected profit is maximized using the 0/1 mixed-integer linear programming technique. This approach allows precise modelling of non-convex variable cost functions and non-linear start-up cost functions of thermal units, non-concave power-discharge characteristics of hydro units, ramp rate limits of thermal units and minimum up and down time constraints for both hydro and thermal units. Model incorporates long-term bilateral contracts with contracted power and price patterns, as well as forecasted market hourly prices for day-ahead auction. Solution is achieved using the homogeneous interior point method for linear programming as state of the art technique, with a branch and bound optimizer for integer programming. The effectiveness of the proposed model in optimizing the generation schedule is demonstrated through the case studies and their analysis. (author)

  8. A hybrid flow shop model for an ice cream production scheduling problem

    Directory of Open Access Journals (Sweden)

    Imma Ribas Vila

    2009-07-01

    Full Text Available Normal 0 21 false false false ES X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Taula normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} In this paper we address the scheduling problem that comes from an ice cream manufacturing company. This production system can be modelled as a three stage nowait hybrid flow shop with batch dependent setup costs. To contribute reducing the gap between theory and practice we have considered the real constraints and the criteria used by planners. The problem considered has been formulated as a mixed integer programming. Further, two competitive heuristic procedures have been developed and one of them will be proposed to schedule in the ice cream factory.

  9. Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals

    Directory of Open Access Journals (Sweden)

    Ming Zeng

    2017-01-01

    Full Text Available The gantry crane scheduling and storage space allocation problem in the main containers yard of railway container terminal is studied. A mixed integer programming model which comprehensively considers the handling procedures, noncrossing constraints, the safety margin and traveling time of gantry cranes, and the storage modes in the main area is formulated. A metaheuristic named backtracking search algorithm (BSA is then improved to solve this intractable problem. A series of computational experiments are carried out to evaluate the performance of the proposed algorithm under some randomly generated cases based on the practical operation conditions. The results show that the proposed algorithm can gain the near-optimal solutions within a reasonable computation time.

  10. Mathematical Model and Algorithm for the Reefer Mechanic Scheduling Problem at Seaports

    Directory of Open Access Journals (Sweden)

    Jiantong Zhang

    2017-01-01

    Full Text Available With the development of seaborne logistics, the international trade of goods transported in refrigerated containers is growing fast. Refrigerated containers, also known as reefers, are used in transportation of temperature sensitive cargo, such as perishable fruits. This trend brings new challenges to terminal managers, that is, how to efficiently arrange mechanics to plug and unplug power for the reefers (i.e., tasks at yards. This work investigates the reefer mechanics scheduling problem at container ports. To minimize the sum of the total tardiness of all tasks and the total working distance of all mechanics, we formulate a mathematical model. For the resolution of this problem, we propose a DE algorithm which is combined with efficient heuristics, local search strategies, and parameter adaption scheme. The proposed algorithm is tested and validated through numerical experiments. Computational results demonstrate the effectiveness and efficiency of the proposed algorithm.

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

    Science.gov (United States)

    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.

  12. Scheduling stochastic two-machine flow shop problems to minimize expected makespan

    Directory of Open Access Journals (Sweden)

    Mehdi Heydari

    2013-07-01

    Full Text Available During the past few years, despite tremendous contribution on deterministic flow shop problem, there are only limited number of works dedicated on stochastic cases. This paper examines stochastic scheduling problems in two-machine flow shop environment for expected makespan minimization where processing times of jobs are normally distributed. Since jobs have stochastic processing times, to minimize the expected makespan, the expected sum of the second machine’s free times is minimized. In other words, by minimization waiting times for the second machine, it is possible to reach the minimum of the objective function. A mathematical method is proposed which utilizes the properties of the normal distributions. Furthermore, this method can be used as a heuristic method for other distributions, as long as the means and variances are available. The performance of the proposed method is explored using some numerical examples.

  13. Hybrid Particle Swarm Optimization for Hybrid Flowshop Scheduling Problem with Maintenance Activities

    Science.gov (United States)

    Li, Jun-qing; Pan, Quan-ke; Mao, Kun

    2014-01-01

    A hybrid algorithm which combines particle swarm optimization (PSO) and iterated local search (ILS) is proposed for solving the hybrid flowshop scheduling (HFS) problem with preventive maintenance (PM) activities. In the proposed algorithm, different crossover operators and mutation operators are investigated. In addition, an efficient multiple insert mutation operator is developed for enhancing the searching ability of the algorithm. Furthermore, an ILS-based local search procedure is embedded in the algorithm to improve the exploitation ability of the proposed algorithm. The detailed experimental parameter for the canonical PSO is tuning. The proposed algorithm is tested on the variation of 77 Carlier and Néron's benchmark problems. Detailed comparisons with the present efficient algorithms, including hGA, ILS, PSO, and IG, verify the efficiency and effectiveness of the proposed algorithm. PMID:24883414

  14. A Hybrid Multiobjective Evolutionary Approach for Flexible Job-Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Jian Xiong

    2012-01-01

    Full Text Available This paper addresses multiobjective flexible job-shop scheduling problem (FJSP with three simultaneously considered objectives: minimizing makespan, minimizing total workload, and minimizing maximal workload. A hybrid multiobjective evolutionary approach (H-MOEA is developed to solve the problem. According to the characteristic of FJSP, a modified crowding distance measure is introduced to maintain the diversity of individuals. In the proposed H-MOEA, well-designed chromosome representation and genetic operators are developed for FJSP. Moreover, a local search procedure based on critical path theory is incorporated in H-MOEA to improve the convergence ability of the algorithm. Experiment results on several well-known benchmark instances demonstrate the efficiency and stability of the proposed algorithm. The comparison with other recently published approaches validates that H-MOEA can obtain Pareto-optimal solutions with better quality and/or diversity.

  15. Hybrid Particle Swarm Optimization for Hybrid Flowshop Scheduling Problem with Maintenance Activities

    Directory of Open Access Journals (Sweden)

    Jun-qing Li

    2014-01-01

    Full Text Available A hybrid algorithm which combines particle swarm optimization (PSO and iterated local search (ILS is proposed for solving the hybrid flowshop scheduling (HFS problem with preventive maintenance (PM activities. In the proposed algorithm, different crossover operators and mutation operators are investigated. In addition, an efficient multiple insert mutation operator is developed for enhancing the searching ability of the algorithm. Furthermore, an ILS-based local search procedure is embedded in the algorithm to improve the exploitation ability of the proposed algorithm. The detailed experimental parameter for the canonical PSO is tuning. The proposed algorithm is tested on the variation of 77 Carlier and Néron’s benchmark problems. Detailed comparisons with the present efficient algorithms, including hGA, ILS, PSO, and IG, verify the efficiency and effectiveness of the proposed algorithm.

  16. Hybrid particle swarm optimization for hybrid flowshop scheduling problem with maintenance activities.

    Science.gov (United States)

    Li, Jun-qing; Pan, Quan-ke; Mao, Kun

    2014-01-01

    A hybrid algorithm which combines particle swarm optimization (PSO) and iterated local search (ILS) is proposed for solving the hybrid flowshop scheduling (HFS) problem with preventive maintenance (PM) activities. In the proposed algorithm, different crossover operators and mutation operators are investigated. In addition, an efficient multiple insert mutation operator is developed for enhancing the searching ability of the algorithm. Furthermore, an ILS-based local search procedure is embedded in the algorithm to improve the exploitation ability of the proposed algorithm. The detailed experimental parameter for the canonical PSO is tuning. The proposed algorithm is tested on the variation of 77 Carlier and Néron's benchmark problems. Detailed comparisons with the present efficient algorithms, including hGA, ILS, PSO, and IG, verify the efficiency and effectiveness of the proposed algorithm.

  17. 78 FR 23981 - Proposed Collection; Comment Request for Form 1041 and Related Schedules D, J, and K-1

    Science.gov (United States)

    2013-04-23

    ... 1041 and Related Schedules D, J, and K-1 AGENCY: Internal Revenue Service (IRS), Treasury. ACTION..., the IRS is soliciting comments concerning Form 1041 and related Schedules D, J, and K-1, U.S. Income... Losses (Schedule D), Accumulation Distribution for Certain Complex Trusts (Schedule J), and Beneficiary's...

  18. A Hybrid Quantum Evolutionary Algorithm with Improved Decoding Scheme for a Robotic Flow Shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Weidong Lei

    2017-01-01

    Full Text Available We aim at solving the cyclic scheduling problem with a single robot and flexible processing times in a robotic flow shop, which is a well-known optimization problem in advanced manufacturing systems. The objective of the problem is to find an optimal robot move sequence such that the throughput rate is maximized. We propose a hybrid algorithm based on the Quantum-Inspired Evolutionary Algorithm (QEA and genetic operators for solving the problem. The algorithm integrates three different decoding strategies to convert quantum individuals into robot move sequences. The Q-gate is applied to update the states of Q-bits in each individual. Besides, crossover and mutation operators with adaptive probabilities are used to increase the population diversity. A repairing procedure is proposed to deal with infeasible individuals. Comparison results on both benchmark and randomly generated instances demonstrate that the proposed algorithm is more effective in solving the studied problem in terms of solution quality and computational time.

  19. Meta-heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date.

    Science.gov (United States)

    Xu, Zhenzhen; Zou, Yongxing; Kong, Xiangjie

    2015-01-01

    To our knowledge, this paper investigates the first application of meta-heuristic algorithms to tackle the parallel machines scheduling problem with weighted late work criterion and common due date ([Formula: see text]). Late work criterion is one of the performance measures of scheduling problems which considers the length of late parts of particular jobs when evaluating the quality of scheduling. Since this problem is known to be NP-hard, three meta-heuristic algorithms, namely ant colony system, genetic algorithm, and simulated annealing are designed and implemented, respectively. We also propose a novel algorithm named LDF (largest density first) which is improved from LPT (longest processing time first). The computational experiments compared these meta-heuristic algorithms with LDF, LPT and LS (list scheduling), and the experimental results show that SA performs the best in most cases. However, LDF is better than SA in some conditions, moreover, the running time of LDF is much shorter than SA.

  20. A Priority Rule-Based Heuristic for Resource Investment Project Scheduling Problem with Discounted Cash Flows and Tardiness Penalties

    Directory of Open Access Journals (Sweden)

    Amir Abbas Najafi

    2009-01-01

    Full Text Available Resource investment problem with discounted cash flows (RIPDCFs is a class of project scheduling problem. In RIPDCF, the availability levels of the resources are considered decision variables, and the goal is to find a schedule such that the net present value of the project cash flows optimizes. In this paper, we consider a new RIPDCF in which tardiness of project is permitted with defined penalty. We mathematically formulated the problem and developed a heuristic method to solve it. The results of the performance analysis of the proposed method show an effective solution approach to the problem.

  1. A HYBRID HEURISTIC ALGORITHM FOR SOLVING THE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM (RCPSP

    Directory of Open Access Journals (Sweden)

    Juan Carlos Rivera

    Full Text Available The Resource Constrained Project Scheduling Problem (RCPSP is a problem of great interest for the scientific community because it belongs to the class of NP-Hard problems and no methods are known that can solve it accurately in polynomial processing times. For this reason heuristic methods are used to solve it in an efficient way though there is no guarantee that an optimal solution can be obtained. This research presents a hybrid heuristic search algorithm to solve the RCPSP efficiently, combining elements of the heuristic Greedy Randomized Adaptive Search Procedure (GRASP, Scatter Search and Justification. The efficiency obtained is measured taking into account the presence of the new elements added to the GRASP algorithm taken as base: Justification and Scatter Search. The algorithms are evaluated using three data bases of instances of the problem: 480 instances of 30 activities, 480 of 60, and 600 of 120 activities respectively, taken from the library PSPLIB available online. The solutions obtained by the developed algorithm for the instances of 30, 60 and 120 are compared with results obtained by other researchers at international level, where a prominent place is obtained, according to Chen (2011.

  2. Maximizing Total Profit in Two-agent Problem of Order Acceptance and Scheduling

    Directory of Open Access Journals (Sweden)

    Mohammad Reisi-Nafchi

    2017-03-01

    Full Text Available In competitive markets, attracting potential customers and keeping current customers is a survival condition for each company. So, paying attention to the requests of customers is important and vital. In this paper, the problem of order acceptance and scheduling has been studied, in which two types of customers or agents compete in a single machine environment. The objective is maximizing sum of the total profit of first agent's accepted orders and the total revenue of second agent. Therefore, only the first agent has penalty and its penalty function is lateness and the second agent's orders have a common due date and this agent does not accept any tardy order. To solve the problem, a mathematical programming, a heuristic algorithm and a pseudo-polynomial dynamic programming algorithm are proposed. Computational results confirm the ability of solving all problem instances up to 70 orders size optimally and also 93.12% of problem instances up to 150 orders size by dynamic programming.

  3. Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem

    Directory of Open Access Journals (Sweden)

    Naoufal Rouky

    2019-01-01

    Full Text Available This work is devoted to the study of the Uncertain Quay Crane Scheduling Problem (QCSP, where the loading /unloading times of containers and travel time of quay cranes are considered uncertain. The problem is solved with a Simulation Optimization approach which takes advantage of the great possibilities offered by the simulation to model the real details of the problem and the capacity of the optimization to find solutions with good quality. An Ant Colony Optimization (ACO meta-heuristic hybridized with a Variable Neighborhood Descent (VND local search is proposed to determine the assignments of tasks to quay cranes and the sequences of executions of tasks on each crane. Simulation is used inside the optimization algorithm to generate scenarios in agreement with the probabilities of the distributions of the uncertain parameters, thus, we carry out stochastic evaluations of the solutions found by each ant. The proposed optimization algorithm is tested first for the deterministic case on several well-known benchmark instances. Then, in the stochastic case, since no other work studied exactly the same problem with the same assumptions, the Simulation Optimization approach is compared with the deterministic version. The experimental results show that the optimization algorithm is competitive as compared to the existing methods and that the solutions found by the Simulation Optimization approach are more robust than those found by the optimization algorithm.

  4. A Literature Survey for Earliness/Tardiness Scheduling Problems with Learning Effect

    Directory of Open Access Journals (Sweden)

    Mesut Cemil İŞLER

    2009-02-01

    Full Text Available When a task or work is done continuously, there will be an experience so following times needs of required resources (manpower, materials, etc. will be reduced. This learning curve described first by Wright. Wright determined how workmanship costs decreased while proceed plain increasing. This investigations correctness found consistent by plain producers. Learning effect is an effect that, works can be done in shorter time in the rate of repeat of work with repeating same or similar works in production process. Nowadays classical production systems adapted more acceptable systems with new approaches. Just in time production system (JIT philosophy is one of the most important production system philosophies. JIT which is known production without stock stands on using all product resources optimum. Minimization problem of Earliness/Tardiness finishing penalty, which we can describe Just in time scheduling, appeared by inspired from JIT philosophy. In this study, there is literature survey which directed to earliness/tardiness performance criteria and learning effect processing in scheduling and as a result of this it is obtained some establishing for literature.

  5. An Agent-Based Solution Framework for Inter-Block Yard Crane Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Omor Sharif

    2012-06-01

    Full Text Available The efficiency of yard operations is critical to the overall productivity of a container terminal because the yard serves as the interface between the landside and waterside operations. Most container terminals use yard cranes to transfer containers between the yard and trucks (both external and internal. To facilitate vessel operations, an efficient work schedule for the yard cranes is necessary given varying work volumes among yard blocks with different planning periods. This paper investigated an agent-based approach to assign and relocate yard cranes among yard blocks based on the forecasted work volumes. The goal of our study is to reduce the work volume that remains incomplete at the end of a planning period. We offered several preference functions for yard cranes and blocks which are modeled as agents. These preference functions are designed to find effective schedules for yard cranes. In addition, we examined various rules for the initial assignment of yard cranes to blocks. Our analysis demonstrated that our model can effectively and efficiently reduce the percentage of incomplete work volume for any real-world sized problem.

  6. Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Yu Zhou

    2014-01-01

    Full Text Available High-speed railway is one of the most important ways to solve the long-standing travel difficulty problem in China. However, due to the high acquisition and maintenance cost, it is impossible for decision-making departments to purchase enough EMUs to satisfy the explosive travel demand. Therefore, there is an urgent need to study how to utilize EMU more efficiently and reduce costs in the case of completing a given task in train diagram. In this paper, an EMU circulation scheduling model is built based on train diagram constraints, maintenance constraints, and so forth; in the model solving process, an improved ACA algorithm has been designed. A case study is conducted to verify the feasibility of the model. Moreover, contrast tests have been carried out to compare the efficiency between the improved ACA and the traditional approaches. The results reveal that improved ACA method can solve the model with less time and the quality of each representative index is much better, which means that efficiency of the improved ACA method is higher and better scheduling scheme can be obtained.

  7. Sustainable employability in shiftwork: related to types of work schedule rather than age.

    Science.gov (United States)

    Peters, Velibor; Engels, Josephine A; de Rijk, Angelique E; Nijhuis, Frans J N

    2015-10-01

    There is scarce research on age and sustainable employability of nurses working in various types of work schedules. Earlier research showed that nurses working in work schedules differ regarding age. Different operationalisations of age might explain variations in sustainable employability. Therefore, the aim of this study was to investigate how nurses working in various types of work schedule differ regarding sustainable employability, and the role that age plays in these differences. Age was defined as chronological age, organisational age, life-span age, and functional age. Questionnaires were distributed to 974 Dutch nurses in residential elder care (response rate 51 %) with questions about the type of work schedule, aspects of sustainable employability, various operationalisations of age, and registered sickness absence data were used. Nurses working in various types of work schedules differed regarding aspects of sustainable employability, also when operationalisations of age were added. The 'life-span age' was directly related to aspects of sustainable employability. Statistically, work ability and job satisfaction were only explained by varying operationalisations of age. Nurses' sustainable employability appeared to be mainly related to differences between the types of work schedule rather than age. Fixed early shifts are characterised by the most positive aspects of sustainable employability, and three rotating schedules score worst. To improve sustainable employability, organisations should implement a system in which nurses with different types of work schedule are monitored in combination with their life-span perspective.

  8. On Several Fundamental Problems of Optimization, Estimation, and Scheduling in Wireless Communications

    Science.gov (United States)

    Gao, Qian

    For both the conventional radio frequency and the comparably recent optical wireless communication systems, extensive effort from the academia had been made in improving the network spectrum efficiency and/or reducing the error rate. To achieve these goals, many fundamental challenges such as power efficient constellation design, nonlinear distortion mitigation, channel training design, network scheduling and etc. need to be properly addressed. In this dissertation, novel schemes are proposed accordingly to deal with specific problems falling in category of these challenges. Rigorous proofs and analyses are provided for each of our work to make a fair comparison with the corresponding peer works to clearly demonstrate the advantages. The first part of this dissertation considers a multi-carrier optical wireless system employing intensity modulation (IM) and direct detection (DD). A block-wise constellation design is presented, which treats the DC-bias that conventionally used solely for biasing purpose as an information basis. Our scheme, we term it MSM-JDCM, takes advantage of the compactness of sphere packing in a higher dimensional space, and in turn power efficient constellations are obtained by solving an advanced convex optimization problem. Besides the significant power gains, the MSM-JDCM has many other merits such as being capable of mitigating nonlinear distortion by including a peak-to-power ratio (PAPR) constraint, minimizing inter-symbol-interference (ISI) caused by frequency-selective fading with a novel precoder designed and embedded, and further reducing the bit-error-rate (BER) by combining with an optimized labeling scheme. The second part addresses several optimization problems in a multi-color visible light communication system, including power efficient constellation design, joint pre-equalizer and constellation design, and modeling of different structured channels with cross-talks. Our novel constellation design scheme, termed CSK-Advanced, is

  9. A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model

    Directory of Open Access Journals (Sweden)

    Daniel Rossit

    2016-06-01

    Full Text Available In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.

  10. An imperialist competitive algorithm for solving the production scheduling problem in open pit mine

    Directory of Open Access Journals (Sweden)

    Mojtaba Mokhtarian Asl

    2016-06-01

    Full Text Available Production scheduling (planning of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA for long-term production planning of open pit mines. The proposed algorithm modifies the original rules of the assimilation process. The ICA performance for different levels of the control factors has been studied and the results are presented. The result showed that ICA could be efficiently applied on mine production planning problem.

  11. Three hybridization models based on local search scheme for job shop scheduling problem

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  14. Integer programming formulation and variable neighborhood search metaheuristic for the multiproduct pipeline scheduling problem

    Energy Technology Data Exchange (ETDEWEB)

    Souza Filho, Erito M.; Bahiense, Laura; Ferreira Filho, Virgilio J.M. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE); Lima, Leonardo [Centro Federal de Educacao Tecnologica Celso Sukow da Fonseca (CEFET-RJ), Rio de Janeiro, RJ (Brazil)

    2008-07-01

    Pipeline are known as the most reliable and economical mode of transportation for petroleum and its derivatives, especially when large amounts of products have to be pumped for large distances. In this work we address the short-term schedule of a pipeline system comprising the distribution of several petroleum derivatives from a single oil refinery to several depots, connected to local consumer markets, through a single multi-product pipeline. We propose an integer linear programming formulation and a variable neighborhood search meta-heuristic in order to compare the performances of the exact and heuristic approaches to the problem. Computational tests in C language and MOSEL/XPRESS-MP language are performed over a real Brazilian pipeline system. (author)

  15. Using Coevolution Genetic Algorithm with Pareto Principles to Solve Project Scheduling Problem under Duration and Cost Constraints

    Directory of Open Access Journals (Sweden)

    Alexandr Victorovich Budylskiy

    2014-06-01

    Full Text Available This article considers the multicriteria optimization approach using the modified genetic algorithm to solve the project-scheduling problem under duration and cost constraints. The work contains the list of choices for solving this problem. The multicriteria optimization approach is justified here. The study describes the Pareto principles, which are used in the modified genetic algorithm. We identify the mathematical model of the project-scheduling problem. We introduced the modified genetic algorithm, the ranking strategies, the elitism approaches. The article includes the example.

  16. Multiobjective Joint Optimization of Production Scheduling and Maintenance Planning in the Flexible Job-Shop Problem

    Directory of Open Access Journals (Sweden)

    Jianfei Ye

    2015-01-01

    Full Text Available In order to solve the joint optimization of production scheduling and maintenance planning problem in the flexible job-shop, a multiobjective joint optimization model considering the maximum completion time and maintenance costs per unit time is established based on the concept of flexible job-shop and preventive maintenance. A weighted sum method is adopted to eliminate the index dimension. In addition, a double-coded genetic algorithm is designed according to the problem characteristics. The best result under the circumstances of joint decision-making is obtained through multiple simulation experiments, which proves the validity of the algorithm. We can prove the superiority of joint optimization model by comparing the result of joint decision-making project with the result of independent decision-making project under fixed preventive maintenance period. This study will enrich and expand the theoretical framework and analytical methods of this problem; it provides a scientific decision analysis method for enterprise to make production plan and maintenance plan.

  17. Chaotic Multiobjective Evolutionary Algorithm Based on Decomposition for Test Task Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Hui Lu

    2014-01-01

    Full Text Available Test task scheduling problem (TTSP is a complex optimization problem and has many local optima. In this paper, a hybrid chaotic multiobjective evolutionary algorithm based on decomposition (CMOEA/D is presented to avoid becoming trapped in local optima and to obtain high quality solutions. First, we propose an improving integrated encoding scheme (IES to increase the efficiency. Then ten chaotic maps are applied into the multiobjective evolutionary algorithm based on decomposition (MOEA/D in three phases, that is, initial population and crossover and mutation operators. To identify a good approach for hybrid MOEA/D and chaos and indicate the effectiveness of the improving IES several experiments are performed. The Pareto front and the statistical results demonstrate that different chaotic maps in different phases have different effects for solving the TTSP especially the circle map and ICMIC map. The similarity degree of distribution between chaotic maps and the problem is a very essential factor for the application of chaotic maps. In addition, the experiments of comparisons of CMOEA/D and variable neighborhood MOEA/D (VNM indicate that our algorithm has the best performance in solving the TTSP.

  18. Disruption Management for the Real-Time Home Caregiver Scheduling and Routing Problem

    Directory of Open Access Journals (Sweden)

    Biao Yuan

    2017-11-01

    Full Text Available The aggravating trend of the aging population, the miniaturization of the family structure, and the increase of families with empty nesters greatly affect the sustainable development of the national economy and social old-age security system of China. The emergence of home health care or home care (HHC/HC service mode provides an alternative for elderly care. How to develop and apply this new mobile service mode is crucial for the government. Therefore, the pertinent optimization problems regarding HHC/HC have constantly attracted the attention of researchers. Unexpected events, such as new requests of customers, cancellations of customers’ services, and changes of customers’ time windows, may occur during the process of executing an a priori visiting plan. These events may sometimes make the original plan non-optimal or even infeasible. To cope with this situation, we introduce disruption management to the real-time home caregiver scheduling and routing problem. The deviation measurements on customers, caregivers, and companies are first defined. A mathematical model that minimizes the weighted sum of deviation measurements is then constructed. Next, a tabu search (TS heuristic is developed to efficiently solve the problem, and a cost recorded mechanism is used to strengthen the performance. Finally, by performing computational experiments on three real-life instances, the effectiveness of the TS heuristic is tested, and the advantages of disruption management are analyzed.

  19. Performance evaluation of different types of particle representation procedures of Particle Swarm Optimization in Job-shop Scheduling Problems

    Science.gov (United States)

    Izah Anuar, Nurul; Saptari, Adi

    2016-02-01

    This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representation procedures in Particle Swarm Optimization (PSO) in the case of solving Job-shop Scheduling Problems (JSP). Particle representation procedures refer to the mapping between the particle position in PSO and the scheduling solution in JSP. It is an important step to be carried out so that each particle in PSO can represent a schedule in JSP. Three procedures such as Operation and Particle Position Sequence (OPPS), random keys representation and random-key encoding scheme are used in this study. These procedures have been tested on FT06 and FT10 benchmark problems available in the OR-Library, where the objective function is to minimize the makespan by the use of MATLAB software. Based on the experimental results, it is discovered that OPPS gives the best performance in solving both benchmark problems. The contribution of this paper is the fact that it demonstrates to the practitioners involved in complex scheduling problems that different particle representation procedures can have significant effects on the performance of PSO in solving JSP.

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

    Science.gov (United States)

    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.

  1. Solving a mixed-integer linear programming model for a multi-skilled project scheduling problem by simulated annealing

    Directory of Open Access Journals (Sweden)

    H Kazemipoor

    2012-04-01

    Full Text Available A multi-skilled project scheduling problem (MSPSP has been generally presented to schedule a project with staff members as resources. Each activity in project network requires different skills and also staff members have different skills, too. This causes the MSPSP becomes a special type of a multi-mode resource-constrained project scheduling problem (MM-RCPSP with a huge number of modes. Given the importance of this issue, in this paper, a mixed integer linear programming for the MSPSP is presented. Due to the complexity of the problem, a meta-heuristic algorithm is proposed in order to find near optimal solutions. To validate performance of the algorithm, results are compared against exact solutions solved by the LINGO solver. The results are promising and show that optimal or near-optimal solutions are derived for small instances and good solutions for larger instances in reasonable time.

  2. A Novel Memetic Algorithm Based on Decomposition for Multiobjective Flexible Job Shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Chun Wang

    2017-01-01

    Full Text Available A novel multiobjective memetic algorithm based on decomposition (MOMAD is proposed to solve multiobjective flexible job shop scheduling problem (MOFJSP, which simultaneously minimizes makespan, total workload, and critical workload. Firstly, a population is initialized by employing an integration of different machine assignment and operation sequencing strategies. Secondly, multiobjective memetic algorithm based on decomposition is presented by introducing a local search to MOEA/D. The Tchebycheff approach of MOEA/D converts the three-objective optimization problem to several single-objective optimization subproblems, and the weight vectors are grouped by K-means clustering. Some good individuals corresponding to different weight vectors are selected by the tournament mechanism of a local search. In the experiments, the influence of three different aggregation functions is first studied. Moreover, the effect of the proposed local search is investigated. Finally, MOMAD is compared with eight state-of-the-art algorithms on a series of well-known benchmark instances and the experimental results show that the proposed algorithm outperforms or at least has comparative performance to the other algorithms.

  3. An approximation solution to refinery crude oil scheduling problem with demand uncertainty using joint constrained programming.

    Science.gov (United States)

    Duan, Qianqian; Yang, Genke; Xu, Guanglin; Pan, Changchun

    2014-01-01

    This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand uncertainty is treated by specifying proximity level on the satisfaction of product demands. However, the joint chance constraints usually hold strong nonlinearity and consequently, it is still hard to handle it directly. In this paper, an approximation method combines a relax-and-tight technique to approximately transform the joint chance constraints to a serial of parameterized linear constraints so that the complicated problem can be attacked iteratively. The basic idea behind this approach is to approximate, as much as possible, nonlinear constraints by a lot of easily handled linear constraints which will lead to a well balance between the problem complexity and tractability. Case studies are conducted to demonstrate the proposed methods. Results show that the operation cost can be reduced effectively compared with the case without considering the demand correlation.

  4. An Approximation Solution to Refinery Crude Oil Scheduling Problem with Demand Uncertainty Using Joint Constrained Programming

    Directory of Open Access Journals (Sweden)

    Qianqian Duan

    2014-01-01

    Full Text Available This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand uncertainty is treated by specifying proximity level on the satisfaction of product demands. However, the joint chance constraints usually hold strong nonlinearity and consequently, it is still hard to handle it directly. In this paper, an approximation method combines a relax-and-tight technique to approximately transform the joint chance constraints to a serial of parameterized linear constraints so that the complicated problem can be attacked iteratively. The basic idea behind this approach is to approximate, as much as possible, nonlinear constraints by a lot of easily handled linear constraints which will lead to a well balance between the problem complexity and tractability. Case studies are conducted to demonstrate the proposed methods. Results show that the operation cost can be reduced effectively compared with the case without considering the demand correlation.

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

    Science.gov (United States)

    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.

  6. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Magalhaes, Marcus V.; Fraga, Eder T. [PETROBRAS, Rio de Janeiro, RJ (Brazil); Shah, Nilay [Imperial College, London (United Kingdom)

    2004-07-01

    This work addresses the refinery scheduling problem using mathematical programming techniques. The solution adopted was to decompose the entire refinery model into a crude oil scheduling and a product scheduling problem. The envelope for the crude oil scheduling problem is composed of a terminal, a pipeline and the crude area of a refinery, including the crude distillation units. The solution method adopted includes a decomposition technique based on the topology of the system. The envelope for the product scheduling comprises all tanks, process units and products found in a refinery. Once crude scheduling decisions are Also available the product scheduling is solved using a rolling horizon algorithm. All models were tested with real data from PETROBRAS' REFAP refinery, located in Canoas, Southern Brazil. (author)

  7. Effects of scheduled exercise on cancer-related fatigue in women with early breast cancer

    OpenAIRE

    Husebø, Anne Marie Lunde; Dyrstad, Sindre Mikal; Mjaaland, Ingvil; Søreide, Jon Arne; Bru, Lars Edvin

    2014-01-01

    The article was originally published in The Scientific World Journal; by Hindawi Publishing Corporation under the Creative Commons Attribution License; see http://dx.doi.org/10.1155/2014/27182. While physical activity during cancer treatment is found beneficial for breast cancer patients, evidence indicates ambiguous findings concerning effects of scheduled exercise programs on treatment-related symptoms. This study investigated effects of a scheduled home-based exercise intervention i...

  8. Traction-related problems after hip arthroscopy

    DEFF Research Database (Denmark)

    Frandsen, Lone; Lund, Bent; Grønbech Nielsen, Torsten

    2017-01-01

    . The questionnaire included questions on patients' perceptions of traction-related problems in the groin area, at the knee and ankle and how patients had coped with these problems. A total of 100 consecutive patients undergoing hip arthroscopy filled out the questionnaire. Primary findings of this study were that 74......% of patients reported some sort of traction-related problems after hip arthroscopy. About 32% of the patients had problems in the groin area and 49% of the patients complained of symptoms in the knee joint. A total of 37% of the patients had experienced problems from the traction boot in the ankle area....... The complications were found to be temporary and disappeared after 2-4 weeks. Five patients still had complaints after 3 months. All five patients had a pre-existing knee injury prior to undergoing hip arthroscopy. Traction-related problems after hip arthroscopy are a challenge and our study showed that 74...

  9. A hybrid electromagnetism-like algorithm for a multi-mode resource-constrained project scheduling problem

    Directory of Open Access Journals (Sweden)

    Mohammad Hossein Sadeghi

    2013-08-01

    Full Text Available In this paper, two different sub-problems are considered to solve a resource constrained project scheduling problem (RCPSP, namely i assignment of modes to tasks and ii scheduling of these tasks in order to minimize the makespan of the project. The modified electromagnetism-like algorithm deals with the first problem to create an assignment of modes to activities. This list is used to generate a project schedule. When a new assignment is made, it is necessary to fix all mode dependent requirements of the project activities and to generate a random schedule with the serial SGS method. A local search will optimize the sequence of the activities. Also in this paper, a new penalty function has been proposed for solutions which are infeasible with respect to non-renewable resources. Performance of the proposed algorithm has been compared with the best algorithms published so far on the basis of CPU time and number of generated schedules stopping criteria. Reported results indicate excellent performance of the algorithm.

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

    Science.gov (United States)

    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.

  11. A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems

    Directory of Open Access Journals (Sweden)

    Yingni Zhai

    2014-10-01

    Full Text Available Purpose: A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems (JSP is proposed.Design/methodology/approach: In the algorithm, a number of sub-problems are constructed by iteratively decomposing the large-scale JSP according to the process route of each job. And then the solution of the large-scale JSP can be obtained by iteratively solving the sub-problems. In order to improve the sub-problems' solving efficiency and the solution quality, a detection method for multi-bottleneck machines based on critical path is proposed. Therewith the unscheduled operations can be decomposed into bottleneck operations and non-bottleneck operations. According to the principle of “Bottleneck leads the performance of the whole manufacturing system” in TOC (Theory Of Constraints, the bottleneck operations are scheduled by genetic algorithm for high solution quality, and the non-bottleneck operations are scheduled by dispatching rules for the improvement of the solving efficiency.Findings: In the process of the sub-problems' construction, partial operations in the previous scheduled sub-problem are divided into the successive sub-problem for re-optimization. This strategy can improve the solution quality of the algorithm. In the process of solving the sub-problems, the strategy that evaluating the chromosome's fitness by predicting the global scheduling objective value can improve the solution quality.Research limitations/implications: In this research, there are some assumptions which reduce the complexity of the large-scale scheduling problem. They are as follows: The processing route of each job is predetermined, and the processing time of each operation is fixed. There is no machine breakdown, and no preemption of the operations is allowed. The assumptions should be considered if the algorithm is used in the actual job shop.Originality/value: The research provides an efficient scheduling method for the

  12. Traction-related problems after hip arthroscopy

    Science.gov (United States)

    Lund, Bent; Grønbech Nielsen, Torsten; Lind, Martin

    2017-01-01

    Abstract Traction-related problems are poorly described in the existing literature. The purpose of this prospective study was to describe traction-related problems and how patients perceive these problems. The study was a descriptive cohort study and data were collected from questionnaires and patient files. The questionnaire included questions on patients’ perceptions of traction-related problems in the groin area, at the knee and ankle and how patients had coped with these problems. A total of 100 consecutive patients undergoing hip arthroscopy filled out the questionnaire. Primary findings of this study were that 74% of patients reported some sort of traction-related problems after hip arthroscopy. About 32% of the patients had problems in the groin area and 49% of the patients complained of symptoms in the knee joint. A total of 37% of the patients had experienced problems from the traction boot in the ankle area. The complications were found to be temporary and disappeared after 2–4 weeks. Five patients still had complaints after 3 months. All five patients had a pre-existing knee injury prior to undergoing hip arthroscopy. Traction-related problems after hip arthroscopy are a challenge and our study showed that 74% of the patients reported traction-related problems. This is significantly higher than previously reported. The present study found a high rate of complaints from the knee and ankle joints that have not previously been reported. The presented data suggest the need for more pre-surgery patient information about possible traction-related problems. PMID:28630721

  13. 75 FR 10018 - Proposed Collection; Comment Request for Form 1041 and Related Schedules D, J, and K-1

    Science.gov (United States)

    2010-03-04

    ... 1041 and Related Schedules D, J, and K-1 AGENCY: Internal Revenue Service (IRS), Treasury. ACTION..., the IRS is soliciting comments concerning Form 1041 and related Schedules D, J, and K-1, U.S. Income...), Accumulation Distribution for Certain Complex Trusts (Schedule J), and Beneficiary's Share of Income...

  14. Joint optimization of green vehicle scheduling and routing problem with time-varying speeds

    Science.gov (United States)

    Zhang, Dezhi; Wang, Xin; Ni, Nan; Zhang, Zhuo

    2018-01-01

    Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions. PMID:29466370

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

    Science.gov (United States)

    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.

  16. Scheduling theory, algorithms, and systems

    CERN Document Server

    Pinedo, Michael L

    2016-01-01

    This new edition of the well-established text Scheduling: Theory, Algorithms, and Systems provides an up-to-date coverage of important theoretical models in the scheduling literature as well as important scheduling problems that appear in the real world. The accompanying website includes supplementary material in the form of slide-shows from industry as well as movies that show actual implementations of scheduling systems. The main structure of the book, as per previous editions, consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing times and other problem data are random and not known in advance. The third part deals with scheduling in practice; it covers heuristics that are popular with practitioners and discusses system design and implementation issues. All three parts of this new edition have been revamped, streamlined, and extended. The reference...

  17. A Hybrid Genetic Algorithm with a Knowledge-Based Operator for Solving the Job Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Hamed Piroozfard

    2016-01-01

    Full Text Available Scheduling is considered as an important topic in production management and combinatorial optimization in which it ubiquitously exists in most of the real-world applications. The attempts of finding optimal or near optimal solutions for the job shop scheduling problems are deemed important, because they are characterized as highly complex and NP-hard problems. This paper describes the development of a hybrid genetic algorithm for solving the nonpreemptive job shop scheduling problems with the objective of minimizing makespan. In order to solve the presented problem more effectively, an operation-based representation was used to enable the construction of feasible schedules. In addition, a new knowledge-based operator was designed based on the problem’s characteristics in order to use machines’ idle times to improve the solution quality, and it was developed in the context of function evaluation. A machine based precedence preserving order-based crossover was proposed to generate the offspring. Furthermore, a simulated annealing based neighborhood search technique was used to improve the local exploitation ability of the algorithm and to increase its population diversity. In order to prove the efficiency and effectiveness of the proposed algorithm, numerous benchmarked instances were collected from the Operations Research Library. Computational results of the proposed hybrid genetic algorithm demonstrate its effectiveness.

  18. A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Antonio Costa

    2014-07-01

    Full Text Available Production processes in Cellular Manufacturing Systems (CMS often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS problem or, whether setup times are sequence-dependent, the Flow-Shop Sequence-Dependent Group Scheduling (FSDGS problem. This paper addresses the FSDGS issue, proposing a hybrid metaheuristic procedure integrating features from Genetic Algorithms (GAs and Biased Random Sampling (BRS search techniques with the aim of minimizing the total flow time, i.e., the sum of completion times of all jobs. A well-known benchmark of test cases, entailing problems with two, three, and six machines, is employed for both tuning the relevant parameters of the developed procedure and assessing its performances against two metaheuristic algorithms recently presented by literature. The obtained results and a properly arranged ANOVA analysis highlight the superiority of the proposed approach in tackling the scheduling problem under investigation.

  19. EARTH RESOURCE PROBLEMS AND RELATED ENVIRONMENTAL CONSIDERATIONS

    Directory of Open Access Journals (Sweden)

    Orlitová Erika

    1997-10-01

    Full Text Available The paper discusses some of the problems of geology and earth resources management in relation to environmental problems of the technosphere. It deals also with some aspects of environmental monitoring of areas where surveying or mining operations are planned or in progress.

  20. Depression and Related Problems in University Students

    Science.gov (United States)

    Field, Tiffany; Diego, Miguel; Pelaez, Martha; Deeds, Osvelia; Delgado, Jeannette

    2012-01-01

    Method: Depression and related problems were studied in a sample of 283 university students. Results: The students with high depression scores also had high scores on anxiety, intrusive thoughts, controlling intrusive thoughts and sleep disturbances scales. A stepwise regression suggested that those problems contributed to a significant proportion…

  1. Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem

    Directory of Open Access Journals (Sweden)

    Julien Maheut

    2013-07-01

    Full Text Available Purpose: The purpose of this paper is to present an algorithm that solves the supply network configuration and operations scheduling problem in a mass customization company that faces alternative operations for one specific tool machine order in a multiplant context. Design/methodology/approach: To achieve this objective, the supply chain network configuration and operations scheduling problem is presented. A model based on stroke graphs allows the design of an algorithm that enumerates all the feasible solutions. The algorithm considers the arrival of a new customized order proposal which has to be inserted into a scheduled program. A selection function is then used to choose the solutions to be simulated in a specific simulation tool implemented in a Decision Support System. Findings and Originality/value: The algorithm itself proves efficient to find all feasible solutions when alternative operations must be considered. The stroke structure is successfully used to schedule operations when considering more than one manufacturing and supply option in each step. Research limitations/implications: This paper includes only the algorithm structure for a one-by-one, sequenced introduction of new products into the list of units to be manufactured. Therefore, the lotsizing process is done on a lot-per-lot basis. Moreover, the validation analysis is done through a case study and no generalization can be done without risk. Practical implications: The result of this research would help stakeholders to determine all the feasible and practical solutions for their problem. It would also allow to assessing the total costs and delivery times of each solution. Moreover, the Decision Support System proves useful to assess alternative solutions. Originality/value: This research offers a simple algorithm that helps solve the supply network configuration problem and, simultaneously, the scheduling problem by considering alternative operations. The proposed system

  2. Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

    Science.gov (United States)

    Santosa, B.; Siswanto, N.; Fiqihesa

    2018-04-01

    This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

  3. A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays

    Directory of Open Access Journals (Sweden)

    Will Lunniss

    2014-04-01

    Full Text Available In multitasking real-time systems, the choice of scheduling algorithm is an important factor to ensure that response time requirements are met while maximising limited system resources. Two popular scheduling algorithms include fixed priority (FP and earliest deadline first (EDF. While they have been studied in great detail before, they have not been compared when taking into account cache related pre-emption delays (CRPD. Memory and cache are split into a number of blocks containing instructions and data. During a pre-emption, cache blocks from the pre-empting task can evict those of the pre-empted task. When the pre-empted task is resumed, if it then has to re-load the evicted blocks, CRPD are introduced which then affect the schedulability of the task. In this paper we compare FP and EDF scheduling algorithms in the presence of CRPD using the state-of-the-art CRPD analysis. We find that when CRPD is accounted for, the performance gains offered by EDF over FP, while still notable, are diminished. Furthermore, we find that under scenarios that cause relatively high CRPD, task layout optimisation techniques can be applied to allow FP to schedule tasksets at a similar processor utilisation to EDF. Thus making the choice of the task layout in memory as important as the choice of scheduling algorithm. This is very relevant for industry, as it is much cheaper and simpler to adjust the task layout through the linker than it is to switch the scheduling algorithm.

  4. Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Laxmi A. Bewoor

    2017-10-01

    Full Text Available The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines. The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time. The classical brute force method for finding the probabilities of scheduling for improving the utilization of resources may become trapped in local optima, and this problem can hence be observed as a typical NP-hard combinatorial optimization problem that requires finding a near optimal solution with heuristic and metaheuristic techniques. This paper proposes an effective hybrid Particle Swarm Optimization (PSO metaheuristic algorithm for solving no-wait flow shop scheduling problems with the objective of minimizing the total flow time of jobs. This Proposed Hybrid Particle Swarm Optimization (PHPSO algorithm presents a solution by the random key representation rule for converting the continuous position information values of particles to a discrete job permutation. The proposed algorithm initializes population efficiently with the Nawaz-Enscore-Ham (NEH heuristic technique and uses an evolutionary search guided by the mechanism of PSO, as well as simulated annealing based on a local neighborhood search to avoid getting stuck in local optima and to provide the appropriate balance of global exploration and local exploitation. Extensive computational experiments are carried out based on Taillard’s benchmark suite. Computational results and comparisons with existing metaheuristics show that the PHPSO algorithm outperforms the existing methods in terms of quality search and robustness for the problem considered. The improvement in solution quality is confirmed by statistical tests of significance.

  5. Solution Approaches for the Parallel Identical Machine Scheduling Problem with Sequence Dependent Setups

    National Research Council Canada - National Science Library

    Anderson, Bradley

    2002-01-01

    ... delivery is an important scheduling objective in the just-in-time (JIT) environment. Items produced too early incur holding costs, while items produced too late incur costs in the form of dissatisfied customers...

  6. The nurse scheduling problem: a goal programming and nonlinear optimization approaches

    Science.gov (United States)

    Hakim, L.; Bakhtiar, T.; Jaharuddin

    2017-01-01

    Nurses scheduling is an activity of allocating nurses to conduct a set of tasks at certain room at a hospital or health centre within a certain period. One of obstacles in the nurse scheduling is the lack of resources in order to fulfil the needs of the hospital. Nurse scheduling which is undertaken manually will be at risk of not fulfilling some nursing rules set by the hospital. Therefore, this study aimed to perform scheduling models that satisfy all the specific rules set by the management of Bogor State Hospital. We have developed three models to overcome the scheduling needs. Model 1 is designed to schedule nurses who are solely assigned to a certain inpatient unit and Model 2 is constructed to manage nurses who are assigned to an inpatient room as well as at Polyclinic room as conjunct nurses. As the assignment of nurses on each shift is uneven, then we propose Model 3 to minimize the variance of the workload in order to achieve equitable assignment on every shift. The first two models are formulated in goal programming framework, while the last model is in nonlinear optimization form.

  7. Nintendo related injuries and other problems: review.

    Science.gov (United States)

    Jalink, Maarten B; Heineman, Erik; Pierie, Jean-Pierre E N; ten Cate Hoedemaker, Henk O

    2014-12-16

    To identify all reported cases of injury and other problems caused by using a Nintendo video gaming system. Review. Search of PubMed and Embase in June 2014 for reports on injuries and other problems caused by using a Nintendo gaming system. Most of the 38 articles identified were case reports or case series. Injuries and problems ranged from neurological and psychological to surgical. Traditional controllers with buttons were associated with tendinitis of the extensor of the thumb. The joystick on the Nintendo 64 controller was linked to palmar ulceration. The motion sensitive Wii remote was associated with musculoskeletal problems and various traumas. Most problems are mild and prevalence is low. The described injuries were related to the way the games are controlled, which varies according to the video game console. © Jalink et al 2014.

  8. Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints

    Directory of Open Access Journals (Sweden)

    Hamidreza Haddad

    2012-04-01

    Full Text Available This paper tackles the single machine scheduling problem with dependent setup time and precedence constraints. The primary objective of this paper is minimization of total weighted tardiness. Since the complexity of the resulted problem is NP-hard we use metaheuristics method to solve the resulted model. The proposed model of this paper uses genetic algorithm to solve the problem in reasonable amount of time. Because of high sensitivity of GA to its initial values of parameters, a Taguchi approach is presented to calibrate its parameters. Computational experiments validate the effectiveness and capability of proposed method.

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

    Science.gov (United States)

    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.

  10. A hybrid Constraint Programming/Mixed Integer Programming framework for the preventive signaling maintenance crew scheduling problem

    DEFF Research Database (Denmark)

    Pour, Shahrzad M.; Drake, John H.; Ejlertsen, Lena Secher

    2017-01-01

    A railway signaling system is a complex and interdependent system which should ensure the safe operation of trains. We introduce and address a mixed integer optimisation model for the preventive signal maintenance crew scheduling problem in the Danish railway system. The problem contains many...... to feed as ‘warm start’ solutions to a Mixed Integer Programming (MIP) solver for further optimisation. We apply the CP/MIP framework to a section of the Danish rail network and benchmark our results against both direct application of a MIP solver and modelling the problem as a Constraint Optimisation...

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

    Directory of Open Access Journals (Sweden)

    Tao Ren

    2014-01-01

    Full Text Available 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.

  12. The Burnside problem and related topics

    International Nuclear Information System (INIS)

    Adian, Sergei I

    2011-01-01

    This paper gives a survey of results related to the famous Burnside problem on periodic groups. A negative solution of this problem was first published in joint papers of P.S. Novikov and the author in 1968. The theory of transformations of words in free periodic groups that was created in these papers and its various modifications give a very productive approach to the investigation of hard problems in group theory. In 1950 the Burnside problem gave rise to another problem on finite periodic groups, formulated by Magnus and called by him the restricted Burnside problem. Here it is called the Burnside-Magnus problem. In the Burnside problem the question of local finiteness of periodic groups of a given exponent was posed, but the Burnside-Magnus problem is the question of the existence of a maximal finite periodic group R(m,n) of a fixed period n with a given number m of generators. These problems complement each other. The publication in a joint paper by the author and Razborov in 1987 of the first effective proof of the well-known result of Kostrikin on the existence of a maximal group R(m,n) for any prime n, together with an indication of primitive recursive upper bounds for the orders of these groups, stimulated investigations of the Burnside-Magnus problem as well. Very soon other effective proofs appeared, and then Zel'manov extended Kostrikin's result to the case when n is any power of a prime number. These results are discussed in the last section of this paper. Bibliography: 105 titles.

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

    Science.gov (United States)

    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.

  14. Modeling the Hybrid Flow Shop Scheduling Problem Followed by an Assembly Stage Considering Aging Effects and Preventive Maintenance Activities

    Directory of Open Access Journals (Sweden)

    Seyyed Mohammad Hassan Hosseini

    2016-05-01

    Full Text Available Scheduling problem for the hybrid flow shop scheduling problem (HFSP followed by an assembly stage considering aging effects additional preventive and maintenance activities is studied in this paper. In this production system, a number of products of different kinds are produced. Each product is assembled with a set of several parts. The first stage is a hybrid flow shop to produce parts. All machines can process all kinds of parts in this stage but each machine can process only one part at the same time. The second stage is a single assembly machine or a single assembly team of workers. The aim is to schedule the parts on the machines and assembly sequence and also determine when the preventive maintenance activities get done in order to minimize the completion time of all products (makespan. A mathematical modeling is presented and its validation is shown by solving an example in small scale. Since this problem has been proved strongly NP-hard, in order to solve the problem in medium and large scale, four heuristic algorithms is proposed based on the Johnson’s algorithm. The numerical experiments are used to run the mathematical model and evaluate the performance of the proposed algorithms.

  15. Combinations of response-reinforcer relations in periodic and aperiodic schedules.

    Science.gov (United States)

    Kuroda, Toshikazu; Cançado, Carlos R X; Lattal, Kennon A; Elcoro, Mirari; Dickson, Chata A; Cook, James E

    2013-03-01

    Key pecking of 4 pigeons was studied under a two-component multiple schedule in which food deliveries were arranged according to a fixed and a variable interfood interval. The percentage of response-dependent food in each component was varied, first in ascending (0, 10, 30, 70 and 100%) and then in descending orders, in successive conditions. The change in response rates was positively related to the percentage of response-dependent food in each schedule component. Across conditions, positively accelerated and linear patterns of responding occurred consistently in the fixed and variable components, respectively. These results suggest that the response-food dependency determines response rates in periodic and aperiodic schedules, and that the temporal distribution of food determines response patterns independently of the response-food dependency. Running rates, but not postfood pauses, also were positively related to the percentage of dependent food in each condition, in both fixed and variable components. Thus, the relation between overall response rate and the percentage of dependent food was mediated by responding that occurred after postfood pausing. The findings together extend previous studies wherein the dependency was either always present or absent, and increase the generality of the effects of variations in the response-food dependency from aperiodic to periodic schedules. © Society for the Experimental Analysis of Behavior.

  16. Schedule Analytics

    Science.gov (United States)

    2016-04-30

    Warfare, Naval Sea Systems Command Acquisition Cycle Time : Defining the Problem David Tate, Institute for Defense Analyses Schedule Analytics Jennifer...research was comprised of the following high- level steps :  Identify and review primary data sources 1...research. However, detailed reviews of the OMB IT Dashboard data revealed that schedule data is highly aggregated. Program start date and program end date

  17. Problems related to fossil fuels utilization

    International Nuclear Information System (INIS)

    Rota, R.

    1999-01-01

    Fossil fuels still present the main energy source in the world since about 90% of the energy produced comes from combustion. This paper, based on the lectures given at the conference of Energy and Environment hold at the Accademia dei Lincei in 1998, presents a short review of some of the problems related to the utilization of fossil fuels, such as their availability in the medium period, the effect of pollutant dispersion in the atmosphere as well as the available technologies to deal with such problems [it

  18. Energy problem and harmony in international relations

    International Nuclear Information System (INIS)

    Ogata, Akira

    1975-01-01

    Energy problems and harmony in international relation are closely related with world politics. Oil is destined to remain as the primary energy source for the time being. The situation of oil has different implications to the U.S. and U.S.S.R., oil producing countries, and consumer countries. The hasty attitude in the past to attain energy sufficiency must be avoided by all means. Congenial harmony is to be established in international relation to meet world energy requirement. This also applies to the case of nuclear power in future. (Mori, K.)

  19. A compressed shift schedule: dealing with some of the problems of shift work

    Energy Technology Data Exchange (ETDEWEB)

    Cunningham, J B [Victoria University, Victoria, BC (Canada). School of Public Administration

    1989-07-01

    This study examines some of the psychological and behavioural effects of a 12-hour compressed shift schedule on coal miners in two organisations in Western Canada. It suggests that young, married compressed shift workers are more satisfied with their family relationship. They spend less of their leisure time with spouses when working shifts, and do not spend any more time with them on their days off. They have less time available for many leisure activities on their workdays. The extra time on days off is not reallocated to the leisure activities they were unable to do on their workdays. Some extra leisure time on days off may be spent on personal hobbies. There is no suggestion that the compressed shift schedule has any negative effect on the individual's health. 38 refs., 3 tabs.

  20. Simplifying Multiproject Scheduling Problem Based on Design Structure Matrix and Its Solution by an Improved aiNet Algorithm

    Directory of Open Access Journals (Sweden)

    Chunhua Ju

    2012-01-01

    Full Text Available Managing multiple project is a complex task involving the unrelenting pressures of time and cost. Many studies have proposed various tools and techniques for single-project scheduling; however, the literature further considering multimode or multiproject issues occurring in the real world is rather scarce. In this paper, design structure matrix (DSM and an improved artificial immune network algorithm (aiNet are developed to solve a multi-mode resource-constrained scheduling problem. Firstly, the DSM is used to simplify the mathematic model of multi-project scheduling problem. Subsequently, aiNet algorithm comprised of clonal selection, negative selection, and network suppression is adopted to realize the local searching and global searching, which will assure that it has a powerful searching ability and also avoids the possible combinatorial explosion. Finally, the approach is tested on a set of randomly cases generated from ProGen. The computational results validate the effectiveness of the proposed algorithm comparing with other famous metaheuristic algorithms such as genetic algorithm (GA, simulated annealing algorithm (SA, and ant colony optimization (ACO.

  1. Optimization of municipal waste collection scheduling and routing using vehicle assignment problem (case study of Surabaya city waste collection)

    Science.gov (United States)

    Ramdhani, M. N.; Baihaqi, I.; Siswanto, N.

    2018-04-01

    Waste collection and disposal become a major problem for many metropolitan cities. Growing population, limited vehicles, and increased road traffic make the waste transportation become more complex. Waste collection involves some key considerations, such as vehicle assignment, vehicle routes, and vehicle scheduling. In the scheduling process, each vehicle has a scheduled departure that serve each route. Therefore, vehicle’s assignments should consider the time required to finish one assigment on that route. The objective of this study is to minimize the number of vehicles needed to serve all routes by developing a mathematical model which uses assignment problem approach. The first step is to generated possible routes from the existing routes, followed by vehicle assignments for those certain routes. The result of the model shows fewer vehicles required to perform waste collection asa well as the the number of journeys that the vehicle to collect the waste to the landfill. The comparison of existing conditions with the model result indicates that the latter’s has better condition than the existing condition because each vehicle with certain route has an equal workload, all the result’s model has the maximum of two journeys for each route.

  2. An Approximation Solution to Refinery Crude Oil Scheduling Problem with Demand Uncertainty Using Joint Constrained Programming

    OpenAIRE

    Duan, Qianqian; Yang, Genke; Xu, Guanglin; Pan, Changchun

    2014-01-01

    This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand unc...

  3. Optimal Scheduling of Material Handling Devices in a PCB Production Line: Problem Formulation and a Polynomial Algorithm

    Directory of Open Access Journals (Sweden)

    Ada Che

    2008-01-01

    Full Text Available Modern automated production lines usually use one or multiple computer-controlled robots or hoists for material handling between workstations. A typical application of such lines is an automated electroplating line for processing printed circuit boards (PCBs. In these systems, cyclic production policy is widely used due to large lot size and simplicity of implementation. This paper addresses cyclic scheduling of a multihoist electroplating line with constant processing times. The objective is to minimize the cycle time, or equivalently to maximize the production throughput, for a given number of hoists. We propose a mathematical model and a polynomial algorithm for this scheduling problem. Computational results on randomly generated instances are reported.

  4. Online scheduling of jobs with fixed start times on related machines

    Czech Academy of Sciences Publication Activity Database

    Epstein, L.; Jeż, Łukasz; Sgall, J.; van Stee, R.

    2016-01-01

    Roč. 74, č. 1 (2016), s. 156-176 ISSN 0178-4617 R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : online scheduling * online algorithms * related machines Subject RIV: BA - General Mathematics Impact factor: 0.735, year: 2016 http://link.springer.com/article/10.1007%2Fs00453-014-9940-2

  5. Thermal Unit Commitment Scheduling Problem in Utility System by Tabu Search Embedded Genetic Algorithm Method

    Directory of Open Access Journals (Sweden)

    C. Christober Asir Rajan

    2008-06-01

    Full Text Available The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal unit commitment in the power system for the next H hours. A 66-bus utility power system in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different IEEE test systems consist of 24, 57 and 175 buses. Numerical results are shown comparing the cost solutions and computation time obtained by different intelligence and conventional methods.

  6. Using the method of ideal point to solve dual-objective problem for production scheduling

    Directory of Open Access Journals (Sweden)

    Mariia Marko

    2016-07-01

    Full Text Available In practice, there are often problems, which must simultaneously optimize several criterias. This so-called multi-objective optimization problem. In the article we consider the use of the method ideal point to solve the two-objective optimization problem of production planning. The process of finding solution to the problem consists of a series of steps where using simplex method, we find the ideal point. After that for solving a scalar problems, we use the method of Lagrange multipliers

  7. TAGUCHI METHOD FOR THREE-STAGE ASSEMBLY FLOW SHOP SCHEDULING PROBLEM WITH BLOCKING AND SEQUENCE-DEPENDENT SET UP TIMES

    Directory of Open Access Journals (Sweden)

    AREF MALEKI-DARONKOLAEI

    2013-10-01

    Full Text Available This article considers a three-stage assembly flowshop scheduling problem minimizing the weighted sum of mean completion time and makespan with sequence-dependent setup times at the first stage and blocking times between each stage. To tackle such an NP-hard, two meta-heuristic algorithms are presented. The novelty of our approach is to develop a variable neighborhood search algorithm (VNS and a well-known simulated annealing (SA for the problem. Furthermore, to enhance the performance of the (SA, its parameters are optimized by the use of Taguchi method, but to setting parameters of VNS just one parameter has been used without Taguchi. The computational results show that the proposed VNS is better in mean and standard deviation for all sizes of the problem than SA, but on the contrary about CPU Time SA outperforms VNS.

  8. A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems

    Directory of Open Access Journals (Sweden)

    Nader Ghaffari-Nasab

    2010-07-01

    Full Text Available During the past two decades, there have been increasing interests on permutation flow shop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. The permutation flow shop is formulated as a mixed integer programming and it is classified as NP-Hard problem. Therefore, a direct solution is not available and meta-heuristic approaches need to be used to find the near-optimal solutions. In this paper, we present a new discrete firefly meta-heuristic to minimize the makespan for the permutation flow shop scheduling problem. The results of implementation of the proposed method are compared with other existing ant colony optimization technique. The preliminary results indicate that the new proposed method performs better than the ant colony for some well known benchmark problems.

  9. Operating room scheduling and surgeon assignment problem under surgery durations uncertainty.

    Science.gov (United States)

    Liu, Hongwei; Zhang, Tianyi; Luo, Shuai; Xu, Dan

    2017-12-29

    Scientific management methods are urgently needed to balance the demand and supply of heath care services in Chinese hospitals. Operating theatre is the bottleneck and costliest department. Therefore, the surgery scheduling is crucial to hospital management. To increase the utilization and reduce the cost of operating theatre, and to improve surgeons' satisfaction in the meantime, a practical surgery scheduling which could assign the operating room (OR) and surgeon for the surgery and sequence surgeries in each OR was provided for hospital managers. Surgery durations were predicted by fitting the distributions. A two-step mixed integer programming model considering surgery duration uncertainty was proposed, and sample average approximation (SAA) method was applied to solve the model. Durations of various surgeries were log-normal distributed respectively. Numerical experiments showed the model and method could get good solutions with different sample sizes. Real-life constraints and duration uncertainty were considered in the study, and the model was also very applicable in practice. Average overtime of each OR was reducing and tending to be stable with the number of surgeons increasing, which is a discipline for OR management.

  10. A Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing

    Directory of Open Access Journals (Sweden)

    Hadi Mokhtari

    2015-11-01

    Full Text Available In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexible job shop scheduling with controllable processing times (FJCPT, is formulated as an integer non-linear programming (INLP model and then it is converted into an integer linear programming (ILP model. Due to NP-hardness of FJCPT, conventional analytic optimization methods are not efficient. Hence, in order to solve the problem, a Scatter Search (SS, as an efficient metaheuristic method, is developed. To show the effectiveness of the proposed method, numerical experiments are conducted. The efficiency of the proposed algorithm is compared with that of a genetic algorithm (GA available in the literature for solving FJSP problem. The results showed that the proposed SS provide better solutions than the existing GA.

  11. Solving a multi-objective manufacturing cell scheduling problem with the consideration of warehouses using a simulated annealing based procedure

    Directory of Open Access Journals (Sweden)

    Adrián A. Toncovich

    2019-01-01

    Full Text Available The competition manufacturing companies face has driven the development of novel and efficient methods that enhance the decision making process. In this work, a specific flow shop scheduling problem of practical interest in the industry is presented and formalized using a mathematical programming model. The problem considers a manufacturing system arranged as a work cell that takes into account the transport operations of raw material and final products between the manufacturing cell and warehouses. For solving this problem, we present a multiobjective metaheuristic strategy based on simulated annealing, the Pareto Archived Simulated Annealing (PASA. We tested this strategy on two kinds of benchmark problem sets proposed by the authors. The first group is composed by small-sized problems. On these tests, PASA was able to obtain optimal or near-optimal solutions in significantly short computing times. In order to complete the analysis, we compared these results to the exact Pareto front of the instances obtained with augmented ε-constraint method. Then, we also tested the algorithm in a set of larger problems to evaluate its performance in more extensive search spaces. We performed this assessment through an analysis of the hypervolume metric. Both sets of tests showed the competitiveness of the Pareto Archived Simulated Annealing to efficiently solve this problem and obtain good quality solutions while using reasonable computational resources.

  12. 36 CFR 1237.14 - What are the additional scheduling requirements for audiovisual, cartographic, and related records?

    Science.gov (United States)

    2010-07-01

    ... scheduling requirements for audiovisual, cartographic, and related records? 1237.14 Section 1237.14 Parks, Forests, and Public Property NATIONAL ARCHIVES AND RECORDS ADMINISTRATION RECORDS MANAGEMENT AUDIOVISUAL... audiovisual, cartographic, and related records? The disposition instructions should also provide that...

  13. A Combined Adaptive Tabu Search and Set Partitioning Approach for the Crew Scheduling Problem with an Air Tanker Crew Application

    Science.gov (United States)

    2002-08-15

    Agency Name(s) and Address(es) Maj Juan Vasquez AFOSR/NM 801 N. Randolph St., Rm 732 Arlington, VA 22203-1977 Sponsor/Monitor’s Acronym(s) Sponsor... Gelman , E., Patty, B., and R. Tanga. 1991. Recent Advances in Crew-Pairing Optimization at American Airlines, Interfaces, 21(1):62-74. Baker, E.K...Operations Research, 25(11):887-894. Chu, H.D., Gelman , E., and E.L. Johnson. 1997. Solving Large Scale Crew Scheduling Problems, European

  14. ROBUST-HYBRID GENETIC ALGORITHM FOR A FLOW-SHOP SCHEDULING PROBLEM (A Case Study at PT FSCM Manufacturing Indonesia

    Directory of Open Access Journals (Sweden)

    Johan Soewanda

    2007-01-01

    Full Text Available This paper discusses the application of Robust Hybrid Genetic Algorithm to solve a flow-shop scheduling problem. The proposed algorithm attempted to reach minimum makespan. PT. FSCM Manufacturing Indonesia Plant 4's case was used as a test case to evaluate the performance of the proposed algorithm. The proposed algorithm was compared to Ant Colony, Genetic-Tabu, Hybrid Genetic Algorithm, and the company's algorithm. We found that Robust Hybrid Genetic produces statistically better result than the company's, but the same as Ant Colony, Genetic-Tabu, and Hybrid Genetic. In addition, Robust Hybrid Genetic Algorithm required less computational time than Hybrid Genetic Algorithm

  15. Schedule and staffing of a nuclear power project

    International Nuclear Information System (INIS)

    Polliart, A.J.; Csik, B.

    1977-01-01

    Establishment of construction schedule: a) preliminary construction schedule; b) PERT (Program Evaluation Review Techniques) analytical method; c) identify key milestone target dates; d) inter-action by participants and contribution to support revised construction schedule. - Construction schedule control: a) ability to update and modify construction schedule; b) alternate plans to circumvent restraints (problems); c) critical path activity-controls; d) continuous review and report system. - Updating construction site reports to include: 1) progress, 2) accomplishments, 3) potential problems and alternate plans; b) progress reports on related support services; c) total assessment of participating groups on schedule; d) information required by management for decisions. - Typical causes for delays in project schedule. (orig.) [de

  16. Relative locality and the soccer ball problem

    International Nuclear Information System (INIS)

    Amelino-Camelia, Giovanni; Freidel, Laurent; Smolin, Lee; Kowalski-Glikman, Jerzy

    2011-01-01

    We consider the behavior of macroscopic bodies within the framework of relative locality [G. Amelino-Camelia, L. Freidel, J. Kowalski-Glikman, and L. Smolin, arXiv:1101.0931]. This is a recent proposal for Planck scale modifications of the relativistic dynamics of particles which are described as arising from deformations in the geometry of momentum space. We consider and resolve a common objection against such proposals, which is that, even if the corrections are small for elementary particles in current experiments, they are huge when applied to composite systems such as soccer balls, planets, and stars, with energies E macro much larger than M P . We show that this soccer ball problem does not arise within the framework of relative locality because the nonlinear effects for the dynamics of a composite system with N elementary particles appear at most of order E macro /N·M P .

  17. Solving Multi-Resource Constrained Project Scheduling Problem using Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Hsiang-Hsi Huang

    2015-01-01

    Full Text Available This paper applied Ant Colony Optimization (ACO to develop a resource constraints scheduling model to achieve the resource allocation optimization and the shortest completion time of a project under resource constraints and the activities precedence requirement for projects. Resource leveling is also discussed and has to be achieved under the resource allocation optimization in this research. Testing cases and examples adopted from the international test bank were studied for verifying the effectiveness of the proposed model. The results showed that the solutions of different cases all have a better performance within a reasonable time. These can be obtained through ACO algorithm under the same constrained conditions. A program was written for the proposed model that is able to automatically produce the project resource requirement figure after the project duration is solved.

  18. Development of a new genetic algorithm to solve the feedstock scheduling problem in an anaerobic digester

    Science.gov (United States)

    Cram, Ana Catalina

    As worldwide environmental awareness grow, alternative sources of energy have become important to mitigate climate change. Biogas in particular reduces greenhouse gas emissions that contribute to global warming and has the potential of providing 25% of the annual demand for natural gas in the U.S. In 2011, 55,000 metric tons of methane emissions were reduced and 301 metric tons of carbon dioxide emissions were avoided through the use of biogas alone. Biogas is produced by anaerobic digestion through the fermentation of organic material. It is mainly composed of methane with a rage of 50 to 80% in its concentration. Carbon dioxide covers 20 to 50% and small amounts of hydrogen, carbon monoxide and nitrogen. The biogas production systems are anaerobic digestion facilities and the optimal operation of an anaerobic digester requires the scheduling of all batches from multiple feedstocks during a specific time horizon. The availability times, biomass quantities, biogas production rates and storage decay rates must all be taken into account for maximal biogas production to be achieved during the planning horizon. Little work has been done to optimize the scheduling of different types of feedstock in anaerobic digestion facilities to maximize the total biogas produced by these systems. Therefore, in the present thesis, a new genetic algorithm is developed with the main objective of obtaining the optimal sequence in which different feedstocks will be processed and the optimal time to allocate to each feedstock in the digester with the main objective of maximizing the production of biogas considering different types of feedstocks, arrival times and decay rates. Moreover, all batches need to be processed in the digester in a specified time with the restriction that only one batch can be processed at a time. The developed algorithm is applied to 3 different examples and a comparison with results obtained in previous studies is presented.

  19. Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm.

    Science.gov (United States)

    Hannan, M A; Akhtar, Mahmuda; Begum, R A; Basri, H; Hussain, A; Scavino, Edgar

    2018-01-01

    Waste collection widely depends on the route optimization problem that involves a large amount of expenditure in terms of capital, labor, and variable operational costs. Thus, the more waste collection route is optimized, the more reduction in different costs and environmental effect will be. This study proposes a modified particle swarm optimization (PSO) algorithm in a capacitated vehicle-routing problem (CVRP) model to determine the best waste collection and route optimization solutions. In this study, threshold waste level (TWL) and scheduling concepts are applied in the PSO-based CVRP model under different datasets. The obtained results from different datasets show that the proposed algorithmic CVRP model provides the best waste collection and route optimization in terms of travel distance, total waste, waste collection efficiency, and tightness at 70-75% of TWL. The obtained results for 1 week scheduling show that 70% of TWL performs better than all node consideration in terms of collected waste, distance, tightness, efficiency, fuel consumption, and cost. The proposed optimized model can serve as a valuable tool for waste collection and route optimization toward reducing socioeconomic and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

  20. An Improved Version of Discrete Particle Swarm Optimization for Flexible Job Shop Scheduling Problem with Fuzzy Processing Time

    Directory of Open Access Journals (Sweden)

    Song Huang

    2016-01-01

    Full Text Available The fuzzy processing time occasionally exists in job shop scheduling problem of flexible manufacturing system. To deal with fuzzy processing time, fuzzy flexible job shop model was established in several papers and has attracted numerous researchers’ attention recently. In our research, an improved version of discrete particle swarm optimization (IDPSO is designed to solve flexible job shop scheduling problem with fuzzy processing time (FJSPF. In IDPSO, heuristic initial methods based on triangular fuzzy number are developed, and a combination of six initial methods is applied to initialize machine assignment and random method is used to initialize operation sequence. Then, some simple and effective discrete operators are employed to update particle’s position and generate new particles. In order to guide the particles effectively, we extend global best position to a set with several global best positions. Finally, experiments are designed to investigate the impact of four parameters in IDPSO by Taguchi method, and IDPSO is tested on five instances and compared with some state-of-the-art algorithms. The experimental results show that the proposed algorithm can obtain better solutions for FJSPF and is more competitive than the compared algorithms.

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

    Science.gov (United States)

    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.

  2. "The stone which the builders rejected...": Delay of reinforcement and response rate on fixed-interval and related schedules.

    Science.gov (United States)

    Wearden, J H; Lejeune, Helga

    2006-02-28

    The article deals with response rates (mainly running and peak or terminal rates) on simple and on some mixed-FI schedules and explores the idea that these rates are determined by the average delay of reinforcement for responses occurring during the response periods that the schedules generate. The effects of reinforcement delay are assumed to be mediated by a hyperbolic delay of reinforcement gradient. The account predicts that (a) running rates on simple FI schedules should increase with increasing rate of reinforcement, in a manner close to that required by Herrnstein's equation, (b) improving temporal control during acquisition should be associated with increasing running rates, (c) two-valued mixed-FI schedules with equiprobable components should produce complex results, with peak rates sometimes being higher on the longer component schedule, and (d) that effects of reinforcement probability on mixed-FI should affect the response rate at the time of the shorter component only. All these predictions were confirmed by data, although effects in some experiments remain outside the scope of the model. In general, delay of reinforcement as a determinant of response rate on FI and related schedules (rather than temporal control on such schedules) seems a useful starting point for a more thorough analysis of some neglected questions about performance on FI and related schedules.

  3. A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs

    Directory of Open Access Journals (Sweden)

    Ahmad Zeraatkar Moghaddam

    2012-01-01

    Full Text Available This paper presents a mathematical model for the problem of minimizing the maximum lateness on a single machine when the deteriorated jobs are delivered to each customer in various size batches. In reality, this issue may happen within a supply chain in which delivering goods to customers entails cost. Under such situation, keeping completed jobs to deliver in batches may result in reducing delivery costs. In literature review of batch scheduling, minimizing the maximum lateness is known as NP-Hard problem; therefore the present issue aiming at minimizing the costs of delivering, in addition to the aforementioned objective function, remains an NP-Hard problem. In order to solve the proposed model, a Simulation annealing meta-heuristic is used, where the parameters are calibrated by Taguchi approach and the results are compared to the global optimal values generated by Lingo 10 software. Furthermore, in order to check the efficiency of proposed method to solve larger scales of problem, a lower bound is generated. The results are also analyzed based on the effective factors of the problem. Computational study validates the efficiency and the accuracy of the presented model.

  4. Relating Actor Analysis Methods to Policy Problems

    NARCIS (Netherlands)

    Van der Lei, T.E.

    2009-01-01

    For a policy analyst the policy problem is the starting point for the policy analysis process. During this process the policy analyst structures the policy problem and makes a choice for an appropriate set of methods or techniques to analyze the problem (Goeller 1984). The methods of the policy

  5. Crane scheduling for a plate storage in a shipyard: Modelling the problem

    DEFF Research Database (Denmark)

    Hansen, Jesper; Kristensen, Torben F.H.

    2003-01-01

    . These blocks are again welded together in the dock to produce a ship. Two gantry cranes move the plates into, around and out of the storage when needed in production. Different principles for organizing the storage and also different approaches for solving the problem are compared. Our results indicate...

  6. Crane scheduling for a plate storage in a shipyard: Solving the problem

    DEFF Research Database (Denmark)

    Hansen, Jesper; Kristensen, Torben F.H.

    2003-01-01

    . These blocks are again welded together in the dock to produce a ship. Two gantry cranes move the plates into, around and out of the storage when needed in production. Different principles for organizing the storage and also different approaches for solving the problem are compared. Our results indicate...

  7. Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

    Science.gov (United States)

    Baniamerian, Ali; Bashiri, Mahdi; Zabihi, Fahime

    2018-03-01

    Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfaction. In this paper, we introduce a vehicle routing and scheduling problem with cross-docking and time windows in a three-echelon supply chain that considers customer satisfaction. A set of homogeneous vehicles collect products from suppliers and after consolidation process in the cross-dock, immediately deliver them to customers. A mixed integer linear programming model is presented for this problem to minimize transportation cost and early/tardy deliveries with scheduling of inbound and outbound vehicles to increase customer satisfaction. A two phase genetic algorithm (GA) is developed for the problem. For investigating the performance of the algorithm, it was compared with exact and lower bound solutions in small and large-size instances, respectively. Results show that there are at least 86.6% customer satisfaction by the proposed method, whereas customer satisfaction in the classical model is at most 33.3%. Numerical examples results show that the proposed two phase algorithm could achieve optimal solutions in small-size instances. Also in large-size instances, the proposed two phase algorithm could achieve better solutions with less gap from the lower bound in less computational time in comparison with the classic GA.

  8. A column generation approach for solving the patient admission scheduling problem

    DEFF Research Database (Denmark)

    Range, Troels Martin; Lusby, Richard Martin; Larsen, Jesper

    2014-01-01

    , different variants of this problem. In this paper we consider one such variant and propose an optimization-based heuristic building on branch-and-bound, column generation, and dynamic constraint aggregation to solve it. We achieve tighter lower bounds than previously reported in the literature and......, in addition, we are able to produce new best known solutions for five out of twelve instances from a publicly available repository. © 2013 Elsevier B.V. All rights reserved....

  9. Regulatory problems relating to energy in Hungary

    International Nuclear Information System (INIS)

    Remenyi, K.

    2002-01-01

    One of basic problems of the transition in the energy economy is, how far the process of liberalisation and privatisation could go, i.e. to what extent the control of state/government would be given up, and how the breakdown of the commanding positions of the government would be managed. The transition in the energy sector toward a market economy is characterised by restructuring the regulatory framework of the energy industry, changing the operational structure of the sector and profound reshaping of ownership structures of the enterprises. In Hungary the government, being convinced of the importance of the implementation of the market forces, in 1991 made the first step on the way of restructuring the energy sector in order to increase economic efficiency, to enable companies to react to market forces and to privatise them. Parallel and partly after the restructuring, a profound modification of legal and regulatory framework took place and finally a relatively large scale of privatisation has newly emerged, which will continue in future, too. The process of the energy sector liberalisation in Hungary has a stop and go character and the game is not over. The process can be characterised by institutional restructuring in the energy sector (coal, oil/gas, power ), which is the basic condition for market liberalisation and privatisation, and by the creation of an appropriate environment (regulatory framework, pricing policy, etc. ) for the smooth implementation of the liberation process(author)

  10. Anholonomic Cauchy problem in general relativity

    International Nuclear Information System (INIS)

    Stachel, J.

    1980-01-01

    The Lie derivative approach to the Cauchy problem in general relativity is applied to the evolution along an arbitrary timelike vector field for the case where the dynamical degrees of freedom are chosen as the (generally anholonomic) metric of the hypersurface elements orthogonal to the vector field. Generalizations of the shear, rotation, and acceleration are given for a nonunit timelike vector field, and applied to the three-plus-one breakup of the Riemann tensor into components parallel and orthogonal to the vector field, resulting in the anholonomic Gauss--Codazzi equations. A similar breakup of the Einstein field equations results in the form of the constraint and evolution equations for the anholonomic case. The results are applied to the case of a space--time with a timelike Killing vector field (stationary field) to demonstrate their utility. Other possible applications, such as in the numerical integration of the field equations, are mentioned. Definitions are given of three-index shear, rotation, and acceleration tensors, and their use in a two-plus-two decomposition of the Riemann tensor and field equations is indicated

  11. A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms

    Directory of Open Access Journals (Sweden)

    Shangchia Liu

    2015-01-01

    Full Text Available In the field of distributed decision making, different agents share a common processing resource, and each agent wants to minimize a cost function depending on its jobs only. These issues arise in different application contexts, including real-time systems, integrated service networks, industrial districts, and telecommunication systems. Motivated by its importance on practical applications, we consider two-agent scheduling on a single machine where the objective is to minimize the total completion time of the jobs of the first agent with the restriction that an upper bound is allowed the total completion time of the jobs for the second agent. For solving the proposed problem, a branch-and-bound and three simulated annealing algorithms are developed for the optimal solution, respectively. In addition, the extensive computational experiments are also conducted to test the performance of the algorithms.

  12. An efficient genetic algorithm for a hybrid flow shop scheduling problem with time lags and sequence-dependent setup time

    Directory of Open Access Journals (Sweden)

    Farahmand-Mehr Mohammad

    2014-01-01

    Full Text Available In this paper, a hybrid flow shop scheduling problem with a new approach considering time lags and sequence-dependent setup time in realistic situations is presented. Since few works have been implemented in this field, the necessity of finding better solutions is a motivation to extend heuristic or meta-heuristic algorithms. This type of production system is found in industries such as food processing, chemical, textile, metallurgical, printed circuit board, and automobile manufacturing. A mixed integer linear programming (MILP model is proposed to minimize the makespan. Since this problem is known as NP-Hard class, a meta-heuristic algorithm, named Genetic Algorithm (GA, and three heuristic algorithms (Johnson, SPTCH and Palmer are proposed. Numerical experiments of different sizes are implemented to evaluate the performance of presented mathematical programming model and the designed GA in compare to heuristic algorithms and a benchmark algorithm. Computational results indicate that the designed GA can produce near optimal solutions in a short computational time for different size problems.

  13. Response-rate differences in variable-interval and variable-ratio schedules: An old problem revisited

    OpenAIRE

    Cole, Mark R.

    1994-01-01

    In Experiment 1, a variable-ratio 10 schedule became, successively, a variable-interval schedule with only the minimum interreinforcement intervals yoked to the variable ratio, or a variable-interval schedule with both interreinforcement intervals and reinforced interresponse times yoked to the variable ratio. Response rates in the variable-interval schedule with both interreinforcement interval and reinforced interresponse time yoking fell between the higher rates maintained by the variable-...

  14. Analysis of the status and problems of mechanical module manufacturing schedule of nuclear power plant

    International Nuclear Information System (INIS)

    Zhao Shuyu; Lu Qinwu; Li Yi

    2014-01-01

    An important feature of the 3rd generation nuclear power projects of AP1000 is the scale application of the modular design and construction technology. The world's first AP1000 project has been started in 2008 in our country, some problems existing in project construction process, such as the mechanical module manufacturing progress can't well meet the needs of the practical engineering. In this article, through investigating and analyzing the main cause of affecting plant mechanical module manufacturing progress, according to our country's actual situation in design, procurement and construction, explore the measures to improve module building progress in the process of AP1000 modular construction project at this stage, provide suggestions for project smooth implementation. (authors)

  15. Improved Harmony Search Algorithm for Truck Scheduling Problem in Multiple-Door Cross-Docking Systems

    Directory of Open Access Journals (Sweden)

    Zhanzhong Wang

    2018-01-01

    Full Text Available The key of realizing the cross docking is to design the joint of inbound trucks and outbound trucks, so a proper sequence of trucks will make the cross-docking system much more efficient and need less makespan. A cross-docking system is proposed with multiple receiving and shipping dock doors. The objective is to find the best door assignments and the sequences of trucks in the principle of products distribution to minimize the total makespan of cross docking. To solve the problem that is regarded as a mixed integer linear programming (MILP model, three metaheuristics, namely, harmony search (HS, improved harmony search (IHS, and genetic algorithm (GA, are proposed. Furthermore, the fixed parameters are optimized by Taguchi experiments to improve the accuracy of solutions further. Finally, several numerical examples are put forward to evaluate the performances of proposed algorithms.

  16. Scheduling with Time Lags

    NARCIS (Netherlands)

    X. Zhang (Xiandong)

    2010-01-01

    textabstractScheduling is essential when activities need to be allocated to scarce resources over time. Motivated by the problem of scheduling barges along container terminals in the Port of Rotterdam, this thesis designs and analyzes algorithms for various on-line and off-line scheduling problems

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

    Science.gov (United States)

    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

  18. Computer Use and Vision.Related Problems Among University ...

    African Journals Online (AJOL)

    Related Problems Among University Students In Ajman, United Arab Emirate. ... of 500 Students studying in Gulf Medical University, Ajman and Ajman University of ... prevalence of vision related problems was noted among university students.

  19. Advances in multiphase flow and related problems

    International Nuclear Information System (INIS)

    Papanicolaou, G.

    1986-01-01

    Proceedings of a workshop in multiphase flow held at Leesburg, Va. in June 1986 representing a cross-disciplinary approach to theoretical as well as computational problems in multiphase flow. Topics include composites, phase transitions, fluid-particle systems, and bubbly liquids

  20. Special Relativity as a Simple Geometry Problem

    Science.gov (United States)

    de Abreu, Rodrigo; Guerra, Vasco

    2009-01-01

    The null result of the Michelson-Morley experiment and the constancy of the one-way speed of light in the "rest system" are used to formulate a simple problem, to be solved by elementary geometry techniques using a pair of compasses and non-graduated rulers. The solution consists of a drawing allowing a direct visualization of all the fundamental…

  1. Evaluation of Absolute and Relative Reinforcer Value Using Progressive-Ratio Schedules

    Science.gov (United States)

    Francisco, Monica T.; Borrero, John C.; Sy, Jolene R.

    2008-01-01

    We evaluated behavior exhibited by individuals with developmental disabilities using progressive-ratio (PR) schedules. High- and low-preference stimuli were determined based on the results of a paired-stimulus preference assessment and were evaluated in subsequent reinforcer and PR assessments using concurrent and single schedules of presentation.…

  2. The initial value problem as it relates to numerical relativity.

    Science.gov (United States)

    Tichy, Wolfgang

    2017-02-01

    Spacetime is foliated by spatial hypersurfaces in the 3+1 split of general relativity. The initial value problem then consists of specifying initial data for all fields on one such a spatial hypersurface, such that the subsequent evolution forward in time is fully determined. On each hypersurface the 3-metric and extrinsic curvature describe the geometry. Together with matter fields such as fluid velocity, energy density and rest mass density, the 3-metric and extrinsic curvature then constitute the initial data. There is a lot of freedom in choosing such initial data. This freedom corresponds to the physical state of the system at the initial time. At the same time the initial data have to satisfy the Hamiltonian and momentum constraint equations of general relativity and can thus not be chosen completely freely. We discuss the conformal transverse traceless and conformal thin sandwich decompositions that are commonly used in the construction of constraint satisfying initial data. These decompositions allow us to specify certain free data that describe the physical nature of the system. The remaining metric fields are then determined by solving elliptic equations derived from the constraint equations. We describe initial data for single black holes and single neutron stars, and how we can use conformal decompositions to construct initial data for binaries made up of black holes or neutron stars. Orbiting binaries will emit gravitational radiation and thus lose energy. Since the emitted radiation tends to circularize the orbits over time, one can thus expect that the objects in a typical binary move on almost circular orbits with slowly shrinking radii. This leads us to the concept of quasi-equilibrium, which essentially assumes that time derivatives are negligible in corotating coordinates for binaries on almost circular orbits. We review how quasi-equilibrium assumptions can be used to make physically well motivated approximations that simplify the elliptic

  3. Ethical Problems Related to Surrogate Motherhood

    OpenAIRE

    Erdem Aydin

    2006-01-01

    Being unable to have children is an important problem for married couples. At present, new reproduction techniques help these couples while those who can not find any solution try new approaches. One of these is the phenomenon of surrogate motherhood, which is based upon an agreement between the infertile couple and surrogate mother. Surrogate mother may conceive with the sperm of the male of the involved couple as well as by the transfer of the embryo formed by invitro fertilization. Couples...

  4. Ethical Problems Related to Surrogate Motherhood

    Directory of Open Access Journals (Sweden)

    Erdem Aydin

    2006-03-01

    Full Text Available Being unable to have children is an important problem for married couples. At present, new reproduction techniques help these couples while those who can not find any solution try new approaches. One of these is the phenomenon of surrogate motherhood, which is based upon an agreement between the infertile couple and surrogate mother. Surrogate mother may conceive with the sperm of the male of the involved couple as well as by the transfer of the embryo formed by invitro fertilization. Couples who choose to have a child born from a pregnancy or to whom they are genetically partially connected rather than adopting a child give rise to the emergence of some ethical problems. Traditional family notion based upon having children after the union of the reproductive cells of the mother and father do not receive the pheneomenon of surrogate mother favourably. Such practices are criticised as they are far from being natural and other ethical problems are faced in the implementation.

  5. Two problems relating to cosmic censorship

    Energy Technology Data Exchange (ETDEWEB)

    Needham, T.R.A.

    1986-01-01

    In the First Problem one unambiguous prediction of cosmic censorship is put to the test, namely that it should be impossible to destroy a black hole (i.e., eliminate its horizon) by injecting test particles into it. Several authors have treated this problem and have verified the prediction for various special cases. This author shows that if a general charged spinning particle (with parameters very much smaller than the respective hole parameters) is injected in an arbitrary manner into an extreme Kerr-Newman black hole, then cosmic censorship is upheld. He also considers the injection of particles with parameters that are not small compared with those of the hole, for which cosmic censorship is apparently violated. The Second Problem is an investigation of a conjecture by W. Israel. It states, in essence, that collapsing stars will generically form black holes even though naked singularities may also be produced. More precisely, he conjectures that if a trapped surface forms during a collapse then it can be extended toward the future into a spacelike 3-cylinder OMEGA whose sections are trapped surfaces having dimensions that remain bounded above and below.

  6. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

    Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid

    2015-01-01

    of car drivers' route and mode choice under uncertain travel times. Our analysis exposes some important methodological issues related to complex non-linear scheduling models: One issue is identifying the point in time where the marginal utility of being at the destination becomes larger than the marginal......Different assumptions about travelers' scheduling preferences yield different measures of the cost of travel time variability. Only few forms of scheduling preferences provide non-trivial measures which are additive over links in transport networks where link travel times are arbitrarily...... utility of being at the origin. Another issue is that models with the exponential marginal utility formulation suffer from empirical identification problems. Though our results are not decisive, they partly support the constant-affine specification, in which the value of travel time variability...

  7. 41 CFR 102-75.170 - What happens to the related personal property in a structure scheduled for demolition?

    Science.gov (United States)

    2010-07-01

    ... consideration should be given to designating items having possible historical or artistic value as personal... related personal property in a structure scheduled for demolition? 102-75.170 Section 102-75.170 Public... As Personal Property § 102-75.170 What happens to the related personal property in a structure...

  8. Current problems in Russian-Latvian relations

    Directory of Open Access Journals (Sweden)

    Mezhevich Nikolay

    2013-09-01

    Full Text Available Current relations between Russia and Latvia are still influenced by a series of mutual claims that appeared after the demise of the USSR. Latvia — as well as Estonia and Lithuania — is both an EU and NATO member state. However, unlike the above mentioned countries, its relations with Russia are developing at a more pragmatic level. Numerous political differences often result in economic losses both for Latvia and Russia. Despite the fact that Latvia has been an independent state for more than 20 years, there are still some unresolved issues in its relations with Russia. Today, relations between the two countries are often viewed through the prism of EU — Russia relations. Nonetheless, they often do not fit this context. Settling differences between Latvia and Russia will contribute to trade relations, which are increasingly important for both parties. In order to prevent and localise emerging conflicts, diplomats, politicians, and experts should interpret Russian-Latvian relations in view of the national features without referring to theoretical models based on the mythological “unity” of the three Baltic States.

  9. Genetic Algorithm Combined with Gradient Information for Flexible Job-shop Scheduling Problem with Different Varieties and Small Batches

    Directory of Open Access Journals (Sweden)

    Chen Ming

    2017-01-01

    Full Text Available To solve the Flexible Job-shop Scheduling Problem (FJSP with different varieties and small batches, a modified meta-heuristic algorithm based on Genetic Algorithm (GA is proposed in which gene encoding is divided into process encoding and machine encoding, and according to the encoding mode, the machine gene fragment is connected with the process gene fragment and can be changed with the alteration of process genes. In order to get the global optimal solutions, the crossover and mutation operation of the process gene fragment and machine gene fragment are carried out respectively. In the initialization operation, the machines with shorter manufacturing time are more likely to be chosen to accelerate the convergence speed and then the tournament selection strategy is applied due to the minimum optimization objective. Meanwhile, a judgment condition of the crossover point quantity is introduced to speed up the population evolution and as an important interaction bridge between the current machine and alternative machines in the incidence matrix, a novel mutation operation of machine genes is proposed to achieve the replacement of manufacturing machines. The benchmark test shows the correctness of proposed algorithm and the case simulation proves the proposed algorithm has better performance compared with existing algorithms.

  10. Analyzing scheduling in the food-processing industry

    DEFF Research Database (Denmark)

    Akkerman, Renzo; van Donk, Dirk Pieter

    2009-01-01

    Production scheduling has been widely studied in several research areas, resulting in a large number of methods, prescriptions, and approaches. However, the impact on scheduling practice seems relatively low. This is also the case in the food-processing industry, where industry......-specific characteristics induce specific and complex scheduling problems. Based on ideas about decomposition of the scheduling task and the production process, we develop an analysis methodology for scheduling problems in food processing. This combines an analysis of structural (technological) elements of the production...... process with an analysis of the tasks of the scheduler. This helps to understand, describe, and structure scheduling problems in food processing, and forms a basis for improving scheduling and applying methods developed in literature. It also helps in evaluating the organisational structures...

  11. An economic lot and delivery scheduling problem with the fuzzy shelf life in a flexible job shop with unrelated parallel machines

    Directory of Open Access Journals (Sweden)

    S. Dousthaghi

    2012-08-01

    Full Text Available This paper considers an economic lot and delivery scheduling problem (ELDSP in a fuzzy environment with the fuzzy shelf life for each product. This problem is formulated in a flexible job shop with unrelated parallel machines, when the planning horizon is finite and it determines lot sizing, scheduling and sequencing, simultaneously. The proposed model of this paper is based on the basic period (BP approach. In this paper, a mixed-integer nonlinear programming (MINLP model is presented and then it is changed into two models in the fuzzy shelf life. The main model is dependent to the multiple basic periods and it is difficult to solve the resulted proposed model for large-scale problems in reasonable amount of time; thus, an efficient heuristic method is proposed to solve the problem. The performance of the proposed model is demonstrated using some numerical examples.

  12. Constraint-based job shop scheduling with ILOG SCHEDULER

    NARCIS (Netherlands)

    Nuijten, W.P.M.; Le Pape, C.

    1998-01-01

    We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using ILOG SCHEDULER. A new way of calculating lower bounds on the makespan of the job shop scheduling problem is presented and

  13. Problems and Issues Related to Alternative Education.

    Science.gov (United States)

    Pilat, Mary

    1997-01-01

    Symposium participants identified policy issues in these areas related to alternative education for at-risk youth: choice, equity, public perception, definition, philosophy, stakeholder involvement, evaluation, staffing, curriculum, governance, and financing. Public discourse and policy discussion were considered essential to implementing…

  14. Relative Effects of Problem-Solving and Concept Mapping ...

    African Journals Online (AJOL)

    Relative Effects of Problem-Solving and Concept Mapping Instructional ... mapping strategies are also discussed and their significance and importance to students. ... development of problem solving skills before the end of SSCE Programmebr ...

  15. Child prostitution: magnitude and related problems.

    Science.gov (United States)

    Ayalew, T; Berhane, Y

    2000-07-01

    In Ethiopia, very little is known about prostitution in general and about child prostitution in particular. The objective of this study was to determine the magnitude of child prostitution and to identify problems associated with it. A cross-sectional study design was utilized. Data were collected using structured questionnaire. A total of 650 commercial sex workers were interviewed. Eighty eight (13.5%) were below the age of 18 years at the time of data collection. At the time of joining prostitution 268 (41.2%) were under 18 years of age. Poverty, disagreement with family, and peer influence were the major reasons leading to prostitution. Child prostitutes were likely to be victim of physical violence [OR = (95% C.I.) = 1.93(1.18,3.15)] and sexual violence [OR = (95% C.I.) = 2.20(1.36,3.35)] compared to adult prostitutes. Child prostitutes were about five times more likely to desire rejoining their family than the adult prostitutes [OR = (95% C.I) = 5.47(3.01;9.93)]. Strategies need to be developed to rescue child prostitutes from on-job violence, and to establish a rehabilitation program for those interested to discontinue prostitution along with efforts to minimize entry into prostitution.

  16. Game injuries in relation to game schedules in the National Basketball Association.

    Science.gov (United States)

    Teramoto, Masaru; Cross, Chad L; Cushman, Daniel M; Maak, Travis G; Petron, David J; Willick, Stuart E

    2017-03-01

    Injury management is critical in the National Basketball Association (NBA), as players experience a wide variety of injuries. Recently, it has been suggested that game schedules, such as back-to-back games and four games in five days, increase the risk of injuries in the NBA. The aim of this study was to examine the association between game schedules and player injuries in the NBA. Descriptive epidemiology study. The present study analyzed game injuries and game schedules in the 2012-13 through 2014-15 regular seasons. Game injuries by game schedules and players' profiles were examined using an exact binomial test, the Fisher's exact test and the Mann-Whitney-Wilcoxon test. A Poisson regression analysis was performed to predict the number of game injuries sustained by each player from game schedules and injured players' profiles. There were a total of 681 cases of game injuries sustained by 280 different players during the three years (total N=1443 players). Playing back-to-back games or playing four games in five days alone was not associated with an increased rate of game injuries, whereas a significant positive association was found between game injuries and playing away from home (pNBA. The findings could be useful for designing optimal game schedules in the NBA as well as helping NBA teams make adjustments to minimize game injuries. Copyright © 2016 Sports Medicine Australia. Published by Elsevier Ltd. All rights reserved.

  17. Issues related to the Fermion mass problem

    Science.gov (United States)

    Murakowski, Janusz Adam

    1998-09-01

    This thesis is divided into three parts. Each illustrates a different aspect of the fermion mass issue in elementary particle physics. In the first part, the possibility of chiral symmetry breaking in the presence of uniform magnetic and electric fields is investigated. The system is studied nonperturbatively with the use of basis functions compatible with the external field configuration, the parabolic cylinder functions. It is found that chiral symmetry, broken by a uniform magnetic field, is restored by electric field. Obtained result is nonperturbative in nature: even the tiniest deviation of the electric field from zero restores chiral symmetry. In the second part, heavy quarkonium systems are investigated. To study these systems, a phenomenological nonrelativistic model is built. Approximate solutions to this model are found with the use of a specially designed Pade approximation and by direct numerical integration of Schrodinger equation. The results are compared with experimental measurements of respective meson masses. Good agreement between theoretical calculations and experimental results is found. Advantages and shortcommings of the new approximation method are analysed. In the third part, an extension of the standard model of elementary particles is studied. The extension, called the aspon model, was originally introduced to cure the so called strong CP problem. In addition to fulfilling its original purpose, the aspon model modifies the couplings of the standard model quarks to the Z boson. As a result, the decay rates of the Z boson to quarks are altered. By using the recent precise measurements of the decay rates Z → bb and Z /to [/it c/=c], new constraints on the aspon model parameters are found.

  18. A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs

    Directory of Open Access Journals (Sweden)

    Imen Chaieb Memmi

    2013-09-01

    Full Text Available Purpose: We aim to examine the capacitated multi-item lot sizing problem which is a typical example of a large bucket model, where many different items can be produced on the same machine in one time period. We propose a new approach to determine the production sequence and lot sizes that minimize the sum of start up and setup costs, inventory and production costs over all periods.Design/methodology/approach: The approach is composed of three steps. First, we compute a lower bound on total cost. Then we propose a three sub-steps iteration procedure. We solve optimally the lot sizing problem without considering products sequencing and their cost. Then, we determine products quantities to produce each period while minimizing the storage and variable production costs. Given the products to manufacture each period, we determine its correspondent optimal products sequencing, by using a Branch and Bound algorithm. Given the sequences of products within each period, we evaluate the total start up and setup cost. We compare then the total cost obtained to the lower bound of the total cost. If this value riches a prefixed value, we stop. Otherwise, we modify the results of lot sizing problem.Findings and Originality/value: We show using an illustrative example, that the difference between the total cost and its lower bound is only 10%. This gap depends on the significance of the inventory and production costs and the machine’s capacity. Comparing the approach we develop with a traditional one, we show that we manage to reduce the total cost by 30%.Research limitations/implications: Our model fits better to real-world situations where production systems run continuously. This model is applied for limited number of part types and periods.Practical implications: Our approach determines the products to manufacture each time period, their economic amounts, and their scheduling within each period. This outcome should help decision makers bearing expensive

  19. Scheduling Maintenance Jobs in Networks

    OpenAIRE

    Abed, Fidaa; Chen, Lin; Disser, Yann; Groß, Martin; Megow, Nicole; Meißner, Julie; Richter, Alexander T.; Rischke, Roman

    2017-01-01

    We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polynomial time in arbitrary networks if preemption is allowed. If preemption is restricted to integral t...

  20. Hydrogen problems related to reactor accidents

    International Nuclear Information System (INIS)

    Bujor, A.

    1993-09-01

    At reactor accidents, the combustion of hydrogen causes pressure and temperature transients which pose supplementary loads in containment. In certain conditions, they could reach hazardous levels and impair the integrity of the containment and the operability of the safety systems. The mechanisms of chemical reactions specific for the hydrogen-oxygen system are presented. Conditions in which combustion can occur and the various combustion modes, including the transition to detonation are also described. The related safety aspects and mitigation methods are discussed. Examples for particular applications and safety approaches for various types of reactors, included those promoted for the advanced reactors are also given. Presentation of the experimental research completed at AECL-Research, Whiteshell Laboratory is given, where the multi-point ignition effects for constant volume and for vented combustion of dry hydrogen-air mixtures in various geometries have been investigated. Various aspects of modelling and simulation of hydrogen combustion are discussed. The adaptations and the new models implemented in the codes VENT and CONTAIN, aimed to widen the simulation capabilities of hydrogen combustion models are described. The capabilities and limitations of the modelling assumptions of these two codes are also evaluated. (EG) (11 tabs., 39 ills., 82 refs.)

  1. A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system

    DEFF Research Database (Denmark)

    Lusby, Richard Martin; Muller, Laurent Flindt; Petersen, Bjørn

    2013-01-01

    This paper describes a Benders decomposition-based framework for solving the large scale energy management problem that was posed for the ROADEF 2010 challenge. The problem was taken from the power industry and entailed scheduling the outage dates for a set of nuclear power plants, which need...... to be regularly taken down for refueling and maintenance, in such away that the expected cost of meeting the power demand in a number of potential scenarios is minimized. We show that the problem structure naturally lends itself to Benders decomposition; however, not all constraints can be included in the mixed...

  2. Alcohol-Related Problems And High Risk Sexual Behaviour In ...

    African Journals Online (AJOL)

    There was a significant association between alcohol-related problems and risky sexual behavior. Alcohol-related problems are fairly common in people already infected with HIV/AIDS and are associated with high-risk sexual behavior. Thus, screening and treatment should be part of an effective HIV intervention program.

  3. An exact approach for relating recovering surgical patient workload to the master surgical schedule

    NARCIS (Netherlands)

    Vanberkel, P.T.; Boucherie, Richardus J.; Hans, Elias W.; Hurink, Johann L.; van Lent, Wineke A.M.; van Lent, W.A.M.; van Harten, Wim H.; van Harten, Willem H.

    2009-01-01

    No other department influences the workload of a hospital more than the Department of Surgery and in particular, the activities in the operating room. These activities are governed by the master surgical schedule (MSS), which states which patient types receive surgery on which day. In this paper we

  4. An exact approach for relating recovering surgical patient workload to the master surgical schedule

    NARCIS (Netherlands)

    Vanberkel, P.T.; Boucherie, Richardus J.; Hans, Elias W.; Hurink, Johann L.; van Lent, W.A.M.; van Harten, Willem H.

    2011-01-01

    No other department influences the workload of a hospital more than the Department of Surgery and in particular, the activities in the operating room. These activities are governed by the master surgical schedule (MSS), which states which patient types receive surgery on which day. In this paper, we

  5. Study on sociological approach to resolve maintenance related social problems

    International Nuclear Information System (INIS)

    Aoki, Takayuki

    2007-01-01

    This study proposes a sociological approach to resolve maintenance related social problems. As a result of consideration, the followings were found. (1) In general, solutions to some kinds of questions can be deduced from basic laws using some theories or methodologies in the field of the natural science or engineering. The approach to resolve maintenance related social problems is similar to the approach in the natural science or engineering. (2) The points of view based on fundamental human rights, market principles and community principles, and so on, are very important in resolving maintenance related social problems and can be placed as theories or tools for resolution. (3) If such theories or tools for resolving maintenance related social problems as described above are systematically prepared, it is estimated that it becomes very much easier to resolve maintenance related social problems. (author)

  6. Proposta de classificação hierarquizada dos modelos de solução para o problema de job shop scheduling A proposition of hierarchical classification for solution models in the job shop scheduling problem

    Directory of Open Access Journals (Sweden)

    Ricardo Ferrari Pacheco

    1999-04-01

    Full Text Available Este artigo propõe uma classificação hierarquizada dos modelos utilizados na solução do problema de programação da produção intermitente do tipo job shop, incluindo tanto os que fornecem solução ótima, quanto os modelos heurísticos mais recentes baseados em métodos de busca estendida. Por meio dessa classificação obteve-se um painel amplo dos modelos existentes, evidenciando as diferentes abordagens do problema e suas soluções, com o objetivo de proporcionar uma orientação preliminar na escolha do modelo de job shop scheduling mais adequado.This paper proposes a hierarchical model classification used in the job shop scheduling problem, including those that provide an optimal solution and the more recent ones based on heuristics, called extended search methods. A panel with the existing models is obtained by this classification, and solutions and approach differences are highlighted with the aim of a preliminary orientation on the choice of a more adequate job shop scheduling model.

  7. Erratum to ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009) 81-87

    OpenAIRE

    Rapine , Christophe

    2013-01-01

    International audience; In Allaoui H., Artiba A, ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009)] the authors propose optimality conditions for the Johnson sequence in presence of one unavailability period on the first machine and pretend for a performance guarantee of 2 when several unavailability periods may occur. We establish in this note that these condit...

  8. A lower bound on deterministic online algorithms for scheduling on related machines without preemption

    Czech Academy of Sciences Publication Activity Database

    Ebenlendr, Tomáš; Sgall, J.

    2015-01-01

    Roč. 56, č. 1 (2015), s. 73-81 ISSN 1432-4350 R&D Projects: GA ČR GBP202/12/G061; GA AV ČR IAA100190902 Institutional support: RVO:67985840 Keywords : online algorithms * scheduling * makespan Subject RIV: IN - Informatics, Computer Science Impact factor: 0.719, year: 2015 http://link.springer.com/article/10.1007%2Fs00224-013-9451-6

  9. Christian – Muslim Relations in Nigeria: The Problems and Prospects

    African Journals Online (AJOL)

    Christian – Muslim Relations in Nigeria: The Problems and Prospects. ... Basic findings of this study show that Nigeria.s stability, democracy, and national ... must embrace Inter-religious dialogue which demands religions nurture, faith, trust, ...

  10. Pharmacist intervention in drug-related problems for patients with ...

    African Journals Online (AJOL)

    Trop J Pharm Res, October 2016; 15(10): 2275. Tropical Journal of ... medication errors in irrational drug use, while patient adherence ..... Drug-related problems identified from geriatric medication safety ... Ann. Pharmacother. 2005; 39:1423-.

  11. Using the internet: skill related problems in users’ online behavior

    NARCIS (Netherlands)

    van Deursen, Alexander Johannes Aloysius Maria; van Dijk, Johannes A.G.M.

    2009-01-01

    This study extends the conventional and superficial notion of measuring digital skills by proposing definitions for operational, formal, information and strategic skills. The main purpose was to identify individual skill related problems that users experience when navigating the Internet. In

  12. Review of xenon-133 production and related problems

    International Nuclear Information System (INIS)

    Barrachina, M.; Ropero, M.

    1980-01-01

    A literature survey is given on the production methods of fission xenon-133 and related problems, such as purification, metrological and dosimetric aspects, preparation of isotopic solutions, recycling, etc. 127 references are included. (Author) 127 refs

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

    Science.gov (United States)

    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.

  14. A rectangle bin packing optimization approach to the signal scheduling problem in the FlexRay static segment

    Institute of Scientific and Technical Information of China (English)

    Rui ZHAO; Gui-he QIN; Jia-qiao LIU

    2016-01-01

    As FlexRay communication protocol is extensively used in distributed real-time applications on vehicles, signal scheduling in FlexRay network becomes a critical issue to ensure the safe and efficient operation of time-critical applications. In this study, we propose a rectangle bin packing optimization approach to schedule communication signals with timing constraints into the FlexRay static segment at minimum bandwidth cost. The proposed approach, which is based on integer linear program-ming (ILP), supports both the slot assignment mechanisms provided by the latest version of the FlexRay specification, namely, the single sender slot multiplexing, and multiple sender slot multiplexing mechanisms. Extensive experiments on a synthetic and an automotive X-by-wire system case study demonstrate that the proposed approach has a well optimized performance.

  15. Mathematical programming and financial objectives for scheduling projects

    CERN Document Server

    Kimms, Alf

    2001-01-01

    Mathematical Programming and Financial Objectives for Scheduling Projects focuses on decision problems where the performance is measured in terms of money. As the title suggests, special attention is paid to financial objectives and the relationship of financial objectives to project schedules and scheduling. In addition, how schedules relate to other decisions is treated in detail. The book demonstrates that scheduling must be combined with project selection and financing, and that scheduling helps to give an answer to the planning issue of the amount of resources required for a project. The author makes clear the relevance of scheduling to cutting budget costs. The book is divided into six parts. The first part gives a brief introduction to project management. Part two examines scheduling projects in order to maximize their net present value. Part three considers capital rationing. Many decisions on selecting or rejecting a project cannot be made in isolation and multiple projects must be taken fully into a...

  16. Travel-related health problems in Japanese travelers.

    Science.gov (United States)

    Mizuno, Yasutaka; Kudo, Koichiro

    2009-09-01

    Although the number of Japanese individuals traveling abroad has increased steadily, reaching approximately 17.3 million in 2007, the incidence of various travel-related health problems in Japan remains unknown. The travel-related health problems of Japanese travelers returning to Japan from abroad are analyzed by assessing the records. Data were collected retrospectively on returning travelers who visited the authors' travel clinic during the period from January 2005 through to December 2006 with any health problem acquired overseas. A total of 345 patients were included in this study (200 male, 145 female; average age, 34+/-12.3 years). Reasons for travel included leisure (45.8%); business (39.1%); visiting friends and relatives or accompanying other travelers (8.7%); volunteering (3.8%); and long stays in order to study or live (2.6%). The most visited destination was Asia (n=260), followed by Africa (n=105). The most commonly reported health problems were gastro-intestinal infections (39.1%), followed by respiratory tract infections (16.2%), animal bites (8.1%), and skin problems (5.8%). Together, malaria and dengue accounted for 10% of diagnoses in 125 febrile patients (36.2%). Although the profile of travel-related health problems in Japanese travelers is similar to that of Western travelers, the characteristics of travel were quite different. Therefore Japanese travel advice should be tailored to suit the Japanese traveler.

  17. Some human-related problems in radiation protection

    International Nuclear Information System (INIS)

    Yoshizawa, Yasuo

    1980-01-01

    Radiation protection includes both human and source-related problems. The human problems have not only medical but also social aspects, such as labor management. Special attention should be paid to the fact that the subject of radiation protection is not a human being as living thing but as member of society. ICRP recommended that conditions of work can be divided into two classed, working condition A and B, according to annual exposure. This application is of great value to radiation protection practice. Nevertheless the legal regulations do not adopt it yet. The present condition of the medical surveillance of radiation workers is not appropriate from the scientific standpoint. This is the difficult problem which is caused by the delay of the legal application of ICRP recommendation. Compensation for occupational radiation hazards should be overlooked. This problem have been investigated by an authorized committee, but a number of unsolved problems still remain. (author)

  18. Automated Scheduling Via Artificial Intelligence

    Science.gov (United States)

    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.

  19. Dental Student Study Strategies: Are Self-Testing and Scheduling Related to Academic Performance?

    Science.gov (United States)

    McAndrew, Maureen; Morrow, Christina S; Atiyeh, Lindsey; Pierre, Gaëlle C

    2016-05-01

    Self-testing, a strategy wherein a student actively engages in creating questions and answers from study materials to assist with studying, has been found to be especially advantageous because it enhances future retrieval of information. Studies have found correlations among students' grade point averages (GPAs), self-testing, and rereading study strategies, as well as the spacing of study sessions over time. The aim of this study was to assess relationships among dental students' study strategies, scheduling of study time, and academic achievement. A 16-item survey requesting information on study habits, study schedules, and GPAs was distributed to 358 second-year dental students at New York University College of Dentistry. Additionally, the survey asked students to report the average number of hours per week they devoted to studying for didactic courses and preparing for hands-on preclinical courses. Of the 358 students, 94 (26%) responded to the survey. The vast majority of the respondents reported utilizing self-testing and rereading study strategies. High performers (with higher GPAs) were more likely to use self-testing, especially with flashcards, and to space their studying over multiple sessions. Lower performing students were more likely to highlight or underline their notes and to mass their study sessions or cram. Longer hours devoted to studying and practicing for simulation courses were associated with stronger performance; lower performers reported spending significantly fewer hours practicing for simulation courses. Half of the dental students surveyed said that they felt their studying would be more productive in the morning, although 84% reported doing most of their studying in the evening or late night. Sound study decisions depend on accurate regulation of ongoing learning and appropriate use and timing of evidence-based study strategies, so these results suggest that dental students may require guidance in these areas.

  20. Press problem related to nuclear energy news reporting

    International Nuclear Information System (INIS)

    Arai, Mitsuo

    2008-01-01

    Since the event of Niigataken Chuetsu-oki Earthquake in 2007 and the subsequent press reports on damage of nuclear power station after it, a stance of media is being questioned. In order to clear this problem, basic organizational structure of the press related to nuclear energy news was analyzed. Local news department, social news department, science news department and economical news department involve in nuclear energy news the accordance with their own situations and concerns. This structure makes problem of nuclear energy news reporting complicated. Changing this system is required but very difficult. It is concluded that the press problem around nuclear energy news is strange. (author)

  1. Integer batch scheduling problems for a single-machine with simultaneous effect of learning and forgetting to minimize total actual flow time

    Directory of Open Access Journals (Sweden)

    Rinto Yusriski

    2015-09-01

    Full Text Available This research discusses an integer batch scheduling problems for a single-machine with position-dependent batch processing time due to the simultaneous effect of learning and forgetting. The decision variables are the number of batches, batch sizes, and the sequence of the resulting batches. The objective is to minimize total actual flow time, defined as total interval time between the arrival times of parts in all respective batches and their common due date. There are two proposed algorithms to solve the problems. The first is developed by using the Integer Composition method, and it produces an optimal solution. Since the problems can be solved by the first algorithm in a worst-case time complexity O(n2n-1, this research proposes the second algorithm. It is a heuristic algorithm based on the Lagrange Relaxation method. Numerical experiments show that the heuristic algorithm gives outstanding results.

  2. Drug-related problems and pharmacy interventions in community practice

    DEFF Research Database (Denmark)

    Westerlund, Tommy; Almarsdóttir, Anna Birna; Melander, Arne

    1999-01-01

    Objectives. (1) To document types and number of drug-related problems identified by community pharmacy personnel in Sweden; (2) to determine relationships among the types and number of problems identified and the gender, age and number of prescribed drugs in patients; and (3) to document the inte......Objectives. (1) To document types and number of drug-related problems identified by community pharmacy personnel in Sweden; (2) to determine relationships among the types and number of problems identified and the gender, age and number of prescribed drugs in patients; and (3) to document...... the interventions made by pharmacy personnel with patients and prescribers. Method. Random samples of pharmacists, prescriptionists and pharmacy technicians were drawn nationwide in Sweden; 144 (63 per cent) of the employees fulfilling the inclusion criteria agreed to take part. The participants documented drug......-related problems, interventions and patient variables on a data collection form, and tallied the number of patients they served on another form. Setting. One hundred and sixteen community pharmacies and 12 outpatient hospital pharmacies. Key findings. One problem or more was identified among 2.5 per cent...

  3. A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time

    Directory of Open Access Journals (Sweden)

    Huixin Tian

    2016-01-01

    Full Text Available Different from most researches focused on the single objective hybrid flowshop scheduling (HFS problem, this paper investigates a biobjective HFS problem with sequence dependent setup time. The two objectives are the minimization of total weighted tardiness and the total setup time. To efficiently solve this problem, a Pareto-based adaptive biobjective variable neighborhood search (PABOVNS is developed. In the proposed PABOVNS, a solution is denoted as a sequence of all jobs and a decoding procedure is presented to obtain the corresponding complete schedule. In addition, the proposed PABOVNS has three major features that can guarantee a good balance of exploration and exploitation. First, an adaptive selection strategy of neighborhoods is proposed to automatically select the most promising neighborhood instead of the sequential selection strategy of canonical VNS. Second, a two phase multiobjective local search based on neighborhood search and path relinking is designed for each selected neighborhood. Third, an external archive with diversity maintenance is adopted to store the nondominated solutions and at the same time provide initial solutions for the local search. Computational results based on randomly generated instances show that the PABOVNS is efficient and even superior to some other powerful multiobjective algorithms in the literature.

  4. Special relativity. An introduction with 200 problems and solutions

    International Nuclear Information System (INIS)

    Tsamparlis, Michael

    2010-01-01

    This textbook develops Special Relativity in a systematic way assuming no prior knowledge of Relativity; however the student is assumed to be familiar with the basics of the standard vector calculus. The approach is structural in the sense that it develops Special Relativity in Minkowski space following the same steps with the development of Newtonian Physics in Euclidian space. A second characteristic of the book is that it discusses the mathematics of the theory independently of the physical principles, so that the reader will appreciate its role in the development of the physical theory. The book is intended to be used both as a text-book for a teaching course in Special Relativity but also as a reference book for the future. In that respect it is linked to an online repository with more than 500 problems, carefully classified according to subject area and solved in detail, providing an independent problem book on Special Relativity. (orig.)

  5. Special relativity. An introduction with 200 problems and solutions

    Energy Technology Data Exchange (ETDEWEB)

    Tsamparlis, Michael [Athens Univ., Zografos (Greece). Dept. of Astrophysics, Astronomy and Mechanics

    2010-07-01

    This textbook develops Special Relativity in a systematic way assuming no prior knowledge of Relativity; however the student is assumed to be familiar with the basics of the standard vector calculus. The approach is structural in the sense that it develops Special Relativity in Minkowski space following the same steps with the development of Newtonian Physics in Euclidian space. A second characteristic of the book is that it discusses the mathematics of the theory independently of the physical principles, so that the reader will appreciate its role in the development of the physical theory. The book is intended to be used both as a text-book for a teaching course in Special Relativity but also as a reference book for the future. In that respect it is linked to an online repository with more than 500 problems, carefully classified according to subject area and solved in detail, providing an independent problem book on Special Relativity. (orig.)

  6. Special Relativity An Introduction with 200 Problems and Solutions

    CERN Document Server

    Tsamparlis, Michael

    2010-01-01

    This textbook develops Special Relativity in a systematic way assuming no prior knowledge of Relativity; however the student is assumed to be familiar with the basics of the standard vector calculus. The approach is structural in the sense that it develops Special Relativity in Minkowski space following the same steps with the development of Newtonian Physics in Euclidian space. A second characteristic of the book is that it discusses the mathematics of the theory independently of the physical principles, so that the reader will appreciate its role in the development of the physical theory. The book is intended to be used both as a text-book for a teaching course in Special Relativity but also as a reference book for the future. In that respect it is linked to an online repository with more than 500 problems, carefully classified according to subject area and solved in detail, providing an independent problem book on Special Relativity.

  7. The problem of non-discrimination in labor relations

    OpenAIRE

    Вишновецька, Світлана Василівна; Національний авіаційний університет; Пінчук, Ольга Борисівна; Національний авіаційний університет

    2015-01-01

    The problem of discrimination on the grounds of gender and age in the field of labor relations are investigated in the article. International and Ukrainian legal regulation of non-discrimination as a guarantee of the right to work was analyzed; solutions to the problem are proposed in the article. The different points of view on the concept of discrimination in labor relations were studied by the authors. It was founded that discrimination by age and gender are the most extended forms of disc...

  8. A multi-level variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

    DEFF Research Database (Denmark)

    Wen, Min; Krapper, Emil; Larsen, Jesper

    things, predefined workdays, fixed starting time, maximum weekly working duration, break rule. The objective is to minimize the total delivery cost. The real-life case study is fi rst introduced and modelled as a mixed integer linear program. A multilevel variable neighborhood search heuristic...... is then proposed for the problem. At the first level, the problem size is reduced through an aggregation procedure. At the second level, the aggregated weekly planning problem is decomposed into daily planning problems, each of which is solved by a variable neighborhood search. At the last level, the solution...

  9. Anxiety Sensitivity and Sleep-Related Problems in Anxious Youth

    Science.gov (United States)

    Weiner, Courtney L.; Elkins, Meredith; Pincus, Donna; Comer, Jonathan

    2015-01-01

    Anxiety disorders constitute the most common mental health disturbance experienced by youth. Sleep-related problems (SRPs) are highly prevalent among anxious youth and encompass a variety of problems including nighttime fears, insomnia, and refusal to sleep alone. Given that chronic sleep disturbance is associated with a range of behavioral and physical problems in youth and predicts future psychopathology, it is important to elucidate the nature of SRPs in anxious youth. The present study investigated the relationship between sleep problems and anxiety sensitivity in a sample of 101 anxious youth, ages 6–17. Heightened anxiety sensitivity significantly predicted prolonged sleep onset latency across the sample, even after accounting for severity of anxiety, depression, and age. Results support previous research indicating that SRPs are common among anxious youth and suggest that anxiety sensitivity may play a particularly important role in sleep onset latency. PMID:25863826

  10. A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case

    DEFF Research Database (Denmark)

    Clausen, Jens; Ju, S.

    2006-01-01

    The ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces and delivers components of different types to a consumer in batches. The task is to determine the cycle time, i.e., the time between deliveries, which minimizes the total cost per time unit. This includes the d...

  11. NASA scheduling technologies

    Science.gov (United States)

    Adair, Jerry R.

    1994-01-01

    This paper is a consolidated report on ten major planning and scheduling systems that have been developed by the National Aeronautics and Space Administration (NASA). A description of each system, its components, and how it could be potentially used in private industry is provided in this paper. The planning and scheduling technology represented by the systems ranges from activity based scheduling employing artificial intelligence (AI) techniques to constraint based, iterative repair scheduling. The space related application domains in which the systems have been deployed vary from Space Shuttle monitoring during launch countdown to long term Hubble Space Telescope (HST) scheduling. This paper also describes any correlation that may exist between the work done on different planning and scheduling systems. Finally, this paper documents the lessons learned from the work and research performed in planning and scheduling technology and describes the areas where future work will be conducted.

  12. Assessment of the environment-related problems and prospects of ...

    African Journals Online (AJOL)

    The study attempted to assess the environment-related problems and prospects of vegetable production in peri – urban areas of Lagos state, Nigeria. A total of one hundred and twenty (120) farmers were interviewed. Data collected were analyzed using frequency, percentages and Pearson Product Moment Correlation ...

  13. Indoor and Outdoor Air Pollution- related Health Problem in Ethiopia ...

    African Journals Online (AJOL)

    Background: The health effects of air pollution are generally global problems, but they have, since recently become issues of particular concern for developing countries. This review assessed the situation of air pollution and related health effects in the context of Ethiopia. Methods: The materials reviewed in this publication ...

  14. RUSSIAN CORPORATIONS: THE PROBLEM OF INTRACORPORATE RELATIONS AND INTERESTS

    Directory of Open Access Journals (Sweden)

    Olga Brizhak

    2015-09-01

    Full Text Available The article actualizes the problem of the study of intra-corporate relations and economic interests of the various economic actors involved in the corporate environment of the Russian economy. The author considers the specific conditions of socio-economic and innovative development of Russian big business.

  15. a survey on drug related problems in cervical cancer patients

    African Journals Online (AJOL)

    userpc

    Cisplatin/5FU/paclitaxel. 6. 9.23. 6. Seizure. Cisplatin. 2. 3.08. 7. Loss of hair. Cisplatin/5FU/Paclitaxel. 3. 4.62. 8. Nephrotoxicity. Cisplatin. 3. 4.62. 9. Hypotension. Paclitaxel. 3. 4.62. TOTAL. 65. 100. Table 3: Relationship between cervical cancer patients' factors and DRPs. Patients Factor. Drug Related Problems (DRPs).

  16. Drug-related problems in patients with osteoporosis

    Directory of Open Access Journals (Sweden)

    Ilić Darko

    2016-01-01

    Full Text Available Background/Aim. Drug-related problems are especially frequent among patients suffering from non-communicable diseases, like osteoporosis, leading to suboptimal treatment response. The aim of this study was to identify drug-related problems in patients with osteoporosis. Methods. This cross-sectional prospective study was conducted in January 2014 on outpatients with osteoporosis from three health facilities in Belgrade, Serbia. The patients included in the study were older than 50 years, and they were offered an anonymous questionnaire with open-ended questions. Results. There were 355 study participants, 329 (92.7% females and 26 (7.3% males. The patients who experienced at least one osteoporotic fracture (n = 208 were significantly less adherent to the therapy, less engaged in sports and regular physical activities, and more prone to nutrition with inadequate intake of calcium and vitamin D than patients without fractures (n = 147. Conclusion. The effectiveness of osteoporosis treatment is decreased by several drug-related problems encountered by both physicians and patients. However, the majority of the drug-related problems could be greatly influenced by appropriate educational programs. [Projekat Ministarstva nauke Republike Srbije, br. 175007

  17. Energy-momentum distribution: A crucial problem in general relativity

    NARCIS (Netherlands)

    Sharif, M.; Fatima, T.

    2005-01-01

    This paper is aimed to elaborate the problem of energy–momentum in general relativity. In this connection, we use the prescriptions of Einstein, Landau–Lifshitz, Papapetrou and Möller to compute the energy–momentum densities for two exact solutions of Einstein field equations. The space–times under

  18. Pharmacist intervention in drug-related problems for patients with ...

    African Journals Online (AJOL)

    Purpose: To investigate the role of the community pharmacist in identifying, preventing and resolving drug related problems (DRPs) encountered by patients, with particular emphasis on cardiovascular drugs in community pharmacies in Northern Cyprus, Turkey. Methods: A prospective observational study for the ...

  19. Factors and Problems Related to Female Genital Mutilation as Seen ...

    African Journals Online (AJOL)

    Objective: To determine the aetiological factors and problems related to female genital mutilation as seen in children at St. Gaspar Hospital. Data source: Secondary data were obtained from St. Gaspar Hospital, records, registers and patients files or case notes from children ward were retrieved and reviewed, later a special ...

  20. The relation of eating problems and amenorrhea in ballet dancers.

    Science.gov (United States)

    Brooks-Gunn, J; Warren, M P; Hamilton, L H

    1987-02-01

    Exercise-induced amenorrhea has received considerable attention in the medical literature. The combination of exercise and low body weight is thought to exert synergistic effects in the pathogenesis of amenorrhea, while the role of dieting and eating problems, another possible causative mechanism, has not been examined. A sample of 55 adult dancers in national and regional classical ballet companies was studied; their mean age was 24.7 yr. Fifty-six percent of the dancers had delayed menarche (age 14 or later) and 19% of the sample were currently amenorrheic (5 months or longer). One-third of the dancers reported having had an eating problem (self-reported anorexia nervosa or bulimia). Amenorrhea and reported eating problems were significantly related: 50% of amenorrheics reported anorexia nervosa while 13% of the normals did. In addition, prolonged amenorrhea was significantly related to dieting (as measured by EAT-26 scales, a measure of dieting behavior). As expected, leanness and absolute weight also were related to prolonged amenorrhea. Amenorrhea in this sample of adult dancers was not related to current activity level or age at which training began. Thus, eating problems may be one factor in the pathogenesis of prolonged amenorrhea in certain athletic groups.

  1. Pharmacists' Intervention to Reduce Drug Related Problems in HIV ...

    African Journals Online (AJOL)

    Despite advances in the use of highly active antiretroviral therapy (HAART) in the management of HIV/AIDS, drug-related problems (DRPs) still remain an issue, particularly in developing countries. This study evaluated the incidence of DRPs among HIV/AIDS patients in a HIV/AIDS care centre in southern Nigeria and the ...

  2. Characteristics of potential drug-related problems among oncology patients

    NARCIS (Netherlands)

    Bulsink, Arjan; Imholz, Alex L. T.; Brouwers, Jacobus R. B. J.; Jansman, Frank G. A.

    Background Oncology patients are more at risk for drug related problems because of treatment with (combinations of) anticancer drugs, as they have a higher risk for organ failure or altered metabolism with progression of their disease. Objective The aim of this study was to characterize and to

  3. Employers’ View on Problems Related to Workforce Skills and Qualification

    Directory of Open Access Journals (Sweden)

    Klimplová Lenka

    2012-12-01

    Full Text Available The aim of this exploratory study is to reveal employers’ views on problems related to workforce human capital (skills and qualification. Where do employers themselves view the core of difficulties with ensuring adequately skilled workforce? Do they assign them to technological and organizational changes (a functional concept of job-specific human capital obsolescence, or do they see these problems as a result of other circumstances, such as macro-structural conditions or institutional settings? To answer these questions selected employers in mechanical engineering and information technology sectors in the Czech Republic were interviewed. The results show that the employers see the problems: 1 on the side of workforce – insufficient abilities and skills, exaggerated demands and low motivation; 2 as inadequate capacities and capabilities of the organization itself; 3 at macro-level as institutional shortcomings in the initial educational system and social benefits system. The problems related to workforce skills and qualification cannot be, thus, interpreted only in the functionalist view as job-specific human capital obsolescence, but the formulation of the problems is significantly affected by the institutional framework.

  4. A Hybrid Algorithm for Solving the Economic Lot and Delivery Scheduling Problem in the Common Cycle Case

    DEFF Research Database (Denmark)

    Ju, Suquan; Clausen, Jens

    2004-01-01

    The ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces and delivers components of different component types to a consumer in batches. The task is to determine the cycle time, i.e. that time between deliveries, which minimizes the total cost per time unit. This incl......The ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces and delivers components of different component types to a consumer in batches. The task is to determine the cycle time, i.e. that time between deliveries, which minimizes the total cost per time unit....... This includes the determination of the production sequence of the component types within each cycle. We investigate the computational behavior of two published algorithms, a heuristic and an optimal algorithm. With large number of component types, the optimal algorithm has long running times. We devise a hybrid...

  5. On the Relationships between (Relatively) Advanced Mathematical Knowledge and (Relatively) Advanced Problem-Solving Behaviours

    Science.gov (United States)

    Koichu, Boris

    2010-01-01

    This article discusses an issue of inserting mathematical knowledge within the problem-solving processes. Relatively advanced mathematical knowledge is defined in terms of "three mathematical worlds"; relatively advanced problem-solving behaviours are defined in terms of taxonomies of "proof schemes" and "heuristic behaviours". The relationships…

  6. Anxiety and health problems related to air travel.

    Science.gov (United States)

    McIntosh, I B; Swanson, V; Power, K G; Raeside, F; Dempster, C

    1998-12-01

    A significant proportion of air travelers experience situational anxiety and physical health problems. Take-off and landing are assumed to be stressful, but anxiety related to other aspects of the air travel process, anxiety coping strategies, and in-flight health problems have not previously been investigated. We aimed to investigate frequency of perceived anxiety at procedural stages of air travel, individual strategies used to reduce such anxiety, and frequency of health problems on short-haul and long-haul flights. A questionnaire measuring the occurrence and frequency of the above was administered to two samples of intending travelers during a 3 month period to: (a) 138 travel agency clients, and (b) 100 individuals attending a hospital travel clinic. Of the 238 respondents, two thirds were women. Take-off and landing were a perceived source of anxiety for about 40% of respondents, flight delays for over 50%, and customs and baggage reclaim for a third of individuals. Most frequent anxiety-reduction methods included alcohol and cigarette use, and distraction or relaxation techniques. Physical health problems related to air travel were common, and there was a strong relationship between such problems and frequency of anxiety. Travel agency clients reported more anxiety but not more physical health symptoms overall than travel clinic clients. Women reported greater air-travel anxiety, and more somatic symptoms than men. Significant numbers of air travelers report perceived anxiety related to aspects of travel, and this is associated with health problems during flights. Airlines and travel companies could institute specific measures, including improved information and communication, to reassure clients and thereby diminish anxiety during stages of air-travel. Medical practitioners and travel agencies should also be aware of the potential stresses of air travel and the need for additional information and advice.

  7. Management implications for the perioperative surgical home related to inpatient case cancellations and add-on case scheduling on the day of surgery.

    Science.gov (United States)

    Epstein, Richard H; Dexter, Franklin

    2015-07-01

    The American Society of Anesthesiologists has embraced the concept of the Perioperative Surgical Home as a means through which anesthesiologists can add value to the health systems in which they practice. One key listed element of the Perioperative Surgical Home is to support "scheduling initiatives to reduce cancellations and increase efficiency." In this study, we explored the potential benefits of the Perioperative Surgical Home with respect to inpatient cancellations and add-on case scheduling. We evaluated 6 hypotheses related to the timing of inpatient cancellations and preoperative anesthesia evaluations. Inpatient cancellations were studied during 26 consecutive 4-week intervals between July 2012 and June 2014 at a tertiary care academic hospital. All timestamps related to scheduling, rescheduling, and cancellation activities were retrieved from the operating room (OR) case scheduling system. Timestamps when patients were seen by anesthesia residents were obtained from the preoperative evaluation system database. Batch mean methods were used to calculate means and SE. For cases cancelled, we determined whether, for "most" (>50%) cancellations, a subsequent procedure (of any type) was performed on the patient within 7 days of the cancellation. Comparisons with most and other fractions were assessed using the 1 group, 1-sided Student t test. We evaluated whether a few procedures were highly represented among the cancelled cases via the Herfindahl (Simpson's) index, comparing it with Data from 24,735 scheduled inpatient cases were assessed. Cases cancelled after 7 AM on the day before or at any time on the scheduled day of surgery accounted for 22.6% ± 0.5% (SE) of the scheduled minutes all scheduled cases, and 26.8% ± 0.4% of the case volume (i.e., number of cases). Most (83.1% ± 0.6%, P 50%, P = 0.12), implying that the indication for the cancelled procedure no longer existed or the patient/family decided not to proceed with surgery. When only

  8. Exposure to alcohol advertisements and teenage alcohol-related problems.

    Science.gov (United States)

    Grenard, Jerry L; Dent, Clyde W; Stacy, Alan W

    2013-02-01

    This study used prospective data to test the hypothesis that exposure to alcohol advertising contributes to an increase in underage drinking and that an increase in underage drinking then leads to problems associated with drinking alcohol. A total of 3890 students were surveyed once per year across 4 years from the 7th through the 10th grades. Assessments included several measures of exposure to alcohol advertising, alcohol use, problems related to alcohol use, and a range of covariates, such as age, drinking by peers, drinking by close adults, playing sports, general TV watching, acculturation, parents' jobs, and parents' education. Structural equation modeling of alcohol consumption showed that exposure to alcohol ads and/or liking of those ads in seventh grade were predictive of the latent growth factors for alcohol use (past 30 days and past 6 months) after controlling for covariates. In addition, there was a significant total effect for boys and a significant mediated effect for girls of exposure to alcohol ads and liking of those ads in 7th grade through latent growth factors for alcohol use on alcohol-related problems in 10th grade. Younger adolescents appear to be susceptible to the persuasive messages contained in alcohol commercials broadcast on TV, which sometimes results in a positive affective reaction to the ads. Alcohol ad exposure and the affective reaction to those ads influence some youth to drink more and experience drinking-related problems later in adolescence.

  9. Exposure to Alcohol Advertisements and Teenage Alcohol-Related Problems

    Science.gov (United States)

    Dent, Clyde W.; Stacy, Alan W.

    2013-01-01

    OBJECTIVE: This study used prospective data to test the hypothesis that exposure to alcohol advertising contributes to an increase in underage drinking and that an increase in underage drinking then leads to problems associated with drinking alcohol. METHODS: A total of 3890 students were surveyed once per year across 4 years from the 7th through the 10th grades. Assessments included several measures of exposure to alcohol advertising, alcohol use, problems related to alcohol use, and a range of covariates, such as age, drinking by peers, drinking by close adults, playing sports, general TV watching, acculturation, parents’ jobs, and parents’ education. RESULTS: Structural equation modeling of alcohol consumption showed that exposure to alcohol ads and/or liking of those ads in seventh grade were predictive of the latent growth factors for alcohol use (past 30 days and past 6 months) after controlling for covariates. In addition, there was a significant total effect for boys and a significant mediated effect for girls of exposure to alcohol ads and liking of those ads in 7th grade through latent growth factors for alcohol use on alcohol-related problems in 10th grade. CONCLUSIONS: Younger adolescents appear to be susceptible to the persuasive messages contained in alcohol commercials broadcast on TV, which sometimes results in a positive affective reaction to the ads. Alcohol ad exposure and the affective reaction to those ads influence some youth to drink more and experience drinking-related problems later in adolescence. PMID:23359585

  10. Statistics and Corporate Environmental Management: Relations and Problems

    DEFF Research Database (Denmark)

    Madsen, Henning; Ulhøi, John Parm

    1997-01-01

    Statistical methods have long been used to analyse the macroeconomic consequences of environmentally damaging activities, political actions to control, prevent, or reduce these damages, and environmental problems in the natural environment. Up to now, however, they have had a limited and not very...... specific use in corporate environmental management systems. This paper will address some of the special problems related to the use of statistical techniques in corporate environmental management systems. One important aspect of this is the interaction of internal decisions and activities with conditions...

  11. Gain scheduling using the Youla parameterization

    DEFF Research Database (Denmark)

    Niemann, Hans Henrik; Stoustrup, Jakob

    1999-01-01

    Gain scheduling controllers are considered in this paper. The gain scheduling problem where the scheduling parameter vector cannot be measured directly, but needs to be estimated is considered. An estimation of the scheduling vector has been derived by using the Youla parameterization. The use...... in connection with H_inf gain scheduling controllers....

  12. Schedule Matters: Understanding the Relationship between Schedule Delays and Costs on Overruns

    Science.gov (United States)

    Majerowicz, Walt; Shinn, Stephen A.

    2016-01-01

    This paper examines the relationship between schedule delays and cost overruns on complex projects. It is generally accepted by many project practitioners that cost overruns are directly related to schedule delays. But what does "directly related to" actually mean? Some reasons or root causes for schedule delays and associated cost overruns are obvious, if only in hindsight. For example, unrealistic estimates, supply chain difficulties, insufficient schedule margin, technical problems, scope changes, or the occurrence of risk events can negatively impact schedule performance. Other factors driving schedule delays and cost overruns may be less obvious and more difficult to quantify. Examples of these less obvious factors include project complexity, flawed estimating assumptions, over-optimism, political factors, "black swan" events, or even poor leadership and communication. Indeed, is it even possible the schedule itself could be a source of delay and subsequent cost overrun? Through literature review, surveys of project practitioners, and the authors' own experience on NASA programs and projects, the authors will categorize and examine the various factors affecting the relationship between project schedule delays and cost growth. The authors will also propose some ideas for organizations to consider to help create an awareness of the factors which could cause or influence schedule delays and associated cost growth on complex projects.

  13. Practical job shop scheduling

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1998-01-01

    The Shifting Bottleneck procedure is an intuitive and reasonably good approximation algorithm for the notoriously difficult classical job shop scheduling problem. The principle of decomposing a classical job shop problem into a series of single-machine problems can also easily be applied to job shop

  14. Floyd-A∗ Algorithm Solving the Least-Time Itinerary Planning Problem in Urban Scheduled Public Transport Network

    Directory of Open Access Journals (Sweden)

    Yu Zhang

    2014-01-01

    Full Text Available We consider an ad hoc Floyd-A∗ algorithm to determine the a priori least-time itinerary from an origin to a destination given an initial time in an urban scheduled public transport (USPT network. The network is bimodal (i.e., USPT lines and walking and time dependent. The modified USPT network model results in more reasonable itinerary results. An itinerary is connected through a sequence of time-label arcs. The proposed Floyd-A∗ algorithm is composed of two procedures designated as Itinerary Finder and Cost Estimator. The A∗-based Itinerary Finder determines the time-dependent, least-time itinerary in real time, aided by the heuristic information precomputed by the Floyd-based Cost Estimator, where a strategy is formed to preestimate the time-dependent arc travel time as an associated static lower bound. The Floyd-A∗ algorithm is proven to guarantee optimality in theory and, demonstrated through a real-world example in Shenyang City USPT network to be more efficient than previous procedures. The computational experiments also reveal the time-dependent nature of the least-time itinerary. In the premise that lines run punctually, “just boarding” and “just missing” cases are identified.

  15. Some problems of solar-terrestrial energy relations

    International Nuclear Information System (INIS)

    Kovalevskij, I.V.

    1982-01-01

    Energy aspects of relations of phenomena occurring on the Sun, in the interplanetary space, magnetosphere, ionosphere and on the Earth's surface are discussed. Particular attention is given to the energy radiated by the Sun (flares, coronal holes). The problems are considered of the energy transfer and transformation in high-velocity and flare flows of solar wind. Estimates are performed: of densities of various types of energy of the interplanetary space at the Earth's orbit level; energy fluxes incident on the magnetosphere; energy accumulated inside the magnetosphere; a series of energy parameters of magnetic storms. It is pointed out that nowadays one of the main problems of the magnetosphere physics is studying ways of the interplanatary space energy transfer into the magnetosphere. In this connection some problems are investigated: plasma penetration through the dayside magnetopause, solar wind plasma entry into the magnetotail, the electric field effect on transition region plasma penetration into the distant magnetotail

  16. State Confessional Relations: Problem of the Subject Structure

    Directory of Open Access Journals (Sweden)

    Alexandra A. Dorskaya

    2014-06-01

    Full Text Available In the article various existing definitions of the concept "state and confessional relations" are analyzed, also author's definition is offered. Three levels of the state and confessional relations are revealed: conceptual, legislative and administrative-managerial. In the article it is shown that in Russia a tradition of only two subjects of the state and confessional relations – government bodies and the religious organizations allocation exists. It is revealed that at the present stage many researchers are dissatisfied with such situation. Scientific sources of the problem of the state and church relations within the psychological school of the law, which are addressed to the personality and experiences in the legal sphere are studied and revealed. Special attention is paid to scientific heritage of the M.A. Reysner, who was one of the first to begin study of this problem. In the article the question of the school of three subjects of the state and confessional relations allocation formation, what adds the faithful or faithless personality in addition to two traditional subjects is analyzed. The state and confessional relations are considered in the context of the human rights development. The question of new type of the believer possessing high education level and knowledge formation is considered. In the article it is shown that at the present stage relations of any regulation between the state and religious organizations is based on the basis of international legal standards, domestic legislation and norms of canon law.

  17. Public acceptance and public relations. Communication approach to related pre-public relation problems

    Energy Technology Data Exchange (ETDEWEB)

    Tanaka, Y [Gakushuin Univ., Tokyo (Japan)

    1977-07-01

    A set of problems are discussed, which must be studied before the public relations are dealt with. Firstly, the trade-off between energy and health must be considered. Although the probability of death caused by atomic accidents is very small (one three hundred millionth a year), many peoples hate atomic power and oppose to the construction of nuclear power plants. Four reasons for this are considered: (1) social diffusion of innovation, (2) nuclear allergy, (3) shortage of the conception of risk-benefit, and (4) heterogeneity of the public. According to the investigation of the relationship between electric power and livelihood, carried out by the policyand science research institute in Tokyo, the highly subjective decision for the acceptance of atomic power is independent of the objective knowledge on atomic power.

  18. Sleep-related problems in common medical conditions.

    Science.gov (United States)

    Parish, James M

    2009-02-01

    Common medical problems are often associated with abnormalities of sleep. Patients with chronic medical disorders often have fewer hours of sleep and less restorative sleep compared to healthy individuals, and this poor sleep may worsen the subjective symptoms of the disorder. Individuals with lung disease often have disturbed sleep related to oxygen desaturations, coughing, or dyspnea. Both obstructive lung disease and restrictive lung diseases are associated with poor quality sleep. Awakenings from sleep are common in untreated or undertreated asthma, and cause sleep disruption. Gastroesophageal reflux is a major cause of disrupted sleep due to awakenings from heartburn, dyspepsia, acid brash, coughing, or choking. Patients with chronic renal disease commonly have sleep complaints often due to insomnia, insufficient sleep, sleep apnea, or restless legs syndrome. Complaints related to sleep are very common in patients with fibromyalgia and other causes of chronic pain. Sleep disruption increases the sensation of pain and decreases quality of life. Patients with infectious diseases, including acute viral illnesses, HIV-related disease, and Lyme disease, may have significant problems with insomnia and hypersomnolence. Women with menopause have from insomnia, sleep-disordered breathing, restless legs syndrome, or fibromyalgia. Patients with cancer or receiving cancer therapy are often bothered by insomnia or other sleep disturbances that affect quality of life and daytime energy. The objective of this article is to review frequently encountered medical conditions and examine their impact on sleep, and to review frequent sleep-related problems associated with these common medical conditions.

  19. Healthcare Scheduling by Data Mining: Literature Review and Future Directions

    Directory of Open Access Journals (Sweden)

    Maria M. Rinder

    2012-01-01

    Full Text Available This article presents a systematic literature review of the application of industrial engineering methods in healthcare scheduling, with a focus on the role of patient behavior in scheduling. Nine articles that used mathematical programming, data mining, genetic algorithms, and local searches for optimum schedules were obtained from an extensive search of literature. These methods are new approaches to solve the problems in healthcare scheduling. Some are adapted from areas such as manufacturing and transportation. Key findings from these studies include reduced time for scheduling, capability of solving more complex problems, and incorporation of more variables and constraints simultaneously than traditional scheduling methods. However, none of these methods modeled no-show and walk-ins patient behavior. Future research should include more variables related to patient and/or environment.

  20. The problem of time quantum mechanics versus general relativity

    CERN Document Server

    Anderson, Edward

    2017-01-01

    This book is a treatise on time and on background independence in physics. It first considers how time is conceived of in each accepted paradigm of physics: Newtonian, special relativity, quantum mechanics (QM) and general relativity (GR). Substantial differences are moreover uncovered between what is meant by time in QM and in GR. These differences jointly source the Problem of Time: Nine interlinked facets which arise upon attempting concurrent treatment of the QM and GR paradigms, as is required in particular for a background independent theory of quantum gravity. A sizeable proportion of current quantum gravity programs - e.g. geometrodynamical and loop quantum gravity approaches to quantum GR, quantum cosmology, supergravity and M-theory - are background independent in this sense. This book's foundational topic is thus furthermore of practical relevance in the ongoing development of quantum gravity programs. This book shows moreover that eight of the nine facets of the Problem of Time already occur upon ...

  1. Ear-related problems among children attending the paediatric and ...

    African Journals Online (AJOL)

    2006-08-31

    Aug 31, 2006 ... Results: Three thousand and twenty-one children were seen during the study period. Out of these, 248 children (8.2%) pre- sented with ear-related problems. Chronic otitis media (30.5%), acute otitis media (29.9%), cerumen auris (11.3%), otitis ex- terna(10.1%), hearing impairment (7.3%) and foreign body ...

  2. MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

    Directory of Open Access Journals (Sweden)

    Ladislav Rosocha

    2015-07-01

    Full Text Available Purpose: The efficiency of medical staff is a fundamental feature of healthcare facilities quality. Therefore the better implementation of their preferences into the scheduling problem might not only rise the work-life balance of doctors and nurses, but also may result into better patient care. This paper focuses on optimization of medical staff preferences considering the scheduling problem.Methodology/Approach: We propose a medical staff scheduling algorithm based on simulated annealing, a well-known method from statistical thermodynamics. We define hard constraints, which are linked to legal and working regulations, and minimize the violations of soft constraints, which are related to the quality of work, psychic, and work-life balance of staff.Findings: On a sample of 60 physicians and nurses from gynecology department we generated monthly schedules and optimized their preferences in terms of soft constraints. Our results indicate that the final value of objective function optimized by proposed algorithm is more than 18-times better in violations of soft constraints than initially generated random schedule that satisfied hard constraints.Research Limitation/implication: Even though the global optimality of final outcome is not guaranteed, desirable solutionwas obtained in reasonable time. Originality/Value of paper: We show that designed algorithm is able to successfully generate schedules regarding hard and soft constraints. Moreover, presented method is significantly faster than standard schedule generation and is able to effectively reschedule due to the local neighborhood search characteristics of simulated annealing.

  3. Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm

    Science.gov (United States)

    Pei, Jun; Liu, Xinbao; Pardalos, Panos M.; Fan, Wenjuan; Wang, Ling; Yang, Shanlin

    2016-03-01

    Motivated by applications in manufacturing industry, we consider a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times. The objective is to minimise the makespan by making batching and sequencing decisions. The problem is formalised as a mixed integer programming model and proved to be strongly NP-hard. Some structural properties are presented for both the general case and a special case. Based on these properties, a lower bound is derived, and a novel two-phase heuristic (TP-H) is developed to solve the problem, which guarantees to obtain a worst case performance ratio of ?. Computational experiments with a set of different sizes of random instances are conducted to evaluate the proposed approach TP-H, which is superior to another two heuristics proposed in the literature. Furthermore, the experimental results indicate that TP-H can effectively and efficiently solve large-size problems in a reasonable time.

  4. Problem solving of student with visual impairment related to mathematical literacy problem

    Science.gov (United States)

    Pratama, A. R.; Saputro, D. R. S.; Riyadi

    2018-04-01

    The student with visual impairment, total blind category depends on the sense of touch and hearing in obtaining information. In fact, the two senses can receive information less than 20%. Thus, students with visual impairment of the total blind categories in the learning process must have difficulty, including learning mathematics. This study aims to describe the problem-solving process of the student with visual impairment, total blind category on mathematical literacy issues based on Polya phase. This research using test method similar problems mathematical literacy in PISA and in-depth interviews. The subject of this study was a student with visual impairment, total blind category. Based on the result of the research, problem-solving related to mathematical literacy based on Polya phase is quite good. In the phase of understanding the problem, the student read about twice by brushing the text and assisted with information through hearing three times. The student with visual impairment in problem-solving based on the Polya phase, devising a plan by summoning knowledge and experience gained previously. At the phase of carrying out the plan, students with visual impairment implement the plan in accordance with pre-made. In the looking back phase, students with visual impairment need to check the answers three times but have not been able to find a way.

  5. Terrorism-related trauma in Africa, an increasing problem.

    Science.gov (United States)

    Alfa-Wali, Maryam; Sritharan, Kaji; Mehes, Mira; Abdullah, Fizan; Rasheed, Shahnawaz

    2015-06-01

    Global terrorist activities have increased significantly over the past decade. The impact of terrorism-related trauma on the health of individuals in low- and middle-income countries is under-reported. Trauma management in African countries in particular is uncoordinated, with little or no infrastructure to cater for emergency surgical needs. This article highlights the need for education, training and research to mitigate the problems related to terrorism and surgical public health. Copyright © 2014 Ministry of Health, Saudi Arabia. Published by Elsevier Ltd. All rights reserved.

  6. The Fertility Problem Inventory: measuring perceived infertility-related stress.

    Science.gov (United States)

    Newton, C R; Sherrard, W; Glavac, I

    1999-07-01

    To develop a reliable, valid instrument to evaluate perceived infertility-related stress. Prospective study. University-affiliated teaching hospital. Consecutively referred patients (1,153 women and 1,149 men) seen for infertility treatment. None. Participants' infertility-related stress was assessed by written questionnaire using the Fertility Problem Inventory. Current levels of anxiety, depression, and marital satisfaction also were determined. Women described greater global stress than men and higher specific stress in terms of social concerns, sexual concerns, and need for parenthood. Both men and women facing male infertility reported higher global stress and more social and sexual concerns than men and women experiencing female infertility. Social, sexual, and relationship concerns related to infertility were more effective predictors of depression and marital dissatisfaction than expressed needs for parenthood or attitudes toward child-free living. The Fertility Problem Inventory provides a reliable measure of perceived infertility-related stress and specific information on five separate domains of patient concern. Patterns of infertility-related stress differed depending on gender, fertility history, and infertility diagnosis. Among patients receiving treatment, social, sexual, and relationship concerns appear central to current distress. Counseling interventions that target these domains appear likely to offer maximal therapeutic benefit.

  7. A Practical and Robust Execution Time-Frame Procedure for the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags

    Directory of Open Access Journals (Sweden)

    Angela Hsiang-Ling Chen

    2016-09-01

    Full Text Available Modeling and optimizing organizational processes, such as the one represented by the Resource-Constrained Project Scheduling Problem (RCPSP, improve outcomes. Based on assumptions and simplification, this model tackles the allocation of resources so that organizations can continue to generate profits and reinvest in future growth. Nonetheless, despite all of the research dedicated to solving the RCPSP and its multi-mode variations, there is no standardized procedure that can guide project management practitioners in their scheduling tasks. This is mainly because many of the proposed approaches are either based on unrealistic/oversimplified scenarios or they propose solution procedures not easily applicable or even feasible in real-life situations. In this study, we solve a more true-to-life and complex model, Multimode RCPSP with minimal and maximal time lags (MRCPSP/max. The complexity of the model solved is presented, and the practicality of the proposed approach is justified depending on only information that is available for every project regardless of its industrial context. The results confirm that it is possible to determine a robust makespan and to calculate an execution time-frame with gaps lower than 11% between their lower and upper bounds. In addition, in many instances, the solved lower bound obtained was equal to the best-known optimum.

  8. Multimode Resource-Constrained Multiple Project Scheduling Problem under Fuzzy Random Environment and Its Application to a Large Scale Hydropower Construction Project

    Science.gov (United States)

    Xu, Jiuping

    2014-01-01

    This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method. PMID:24550708

  9. Multimode resource-constrained multiple project scheduling problem under fuzzy random environment and its application to a large scale hydropower construction project.

    Science.gov (United States)

    Xu, Jiuping; Feng, Cuiying

    2014-01-01

    This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method.

  10. Some geomedical problems in relation to soil science

    International Nuclear Information System (INIS)

    Laag, J.

    1988-01-01

    Geomedicine may be defined as the science dealing with the influence of ordinary environmental factors on geographical distribution of health problems in man and animals. An important group of geomedical problems is connected to nutrition. These problems may either be caused by deficiency or surplus of certain matters. Many questions concerning the pollution of nature are classified under the latter group Radioactive pollutants are regarded as important special occurrences under this group. In order to be able to solve complicated geomedical problems, knowledge is needed on the circulation processes rocks-soils-water-plants-animals-man, and waste products back to the soils. The registration of locations of different radioactive elements can give basic material for special geomedical conclusions. Many chemical reactions in which radioactive matter are involved, depend on properties of the soils. Humus and clay minerals have, generally speaking, a high capacity for the absorbtion of soluble matter, but great variations occur. The reactions of radioactive isotopes supplied from the atmosphere, depend on properties of the soil. Radioactive substances are leached relatively rapidly from a soil with low absorption capacity, and may thus be taken away from the circulation in which terrestrial plants, animals and man take part. If the substances is strongly absorbed (fixed), they can also to some extent be withdrawn from the circulation processes

  11. Design of problem-specific evolutionary algorithm/mixed-integer programming hybrids: two-stage stochastic integer programming applied to chemical batch scheduling

    Science.gov (United States)

    Urselmann, Maren; Emmerich, Michael T. M.; Till, Jochen; Sand, Guido; Engell, Sebastian

    2007-07-01

    Engineering optimization often deals with large, mixed-integer search spaces with a rigid structure due to the presence of a large number of constraints. Metaheuristics, such as evolutionary algorithms (EAs), are frequently suggested as solution algorithms in such cases. In order to exploit the full potential of these algorithms, it is important to choose an adequate representation of the search space and to integrate expert-knowledge into the stochastic search operators, without adding unnecessary bias to the search. Moreover, hybridisation with mathematical programming techniques such as mixed-integer programming (MIP) based on a problem decomposition can be considered for improving algorithmic performance. In order to design problem-specific EAs it is desirable to have a set of design guidelines that specify properties of search operators and representations. Recently, a set of guidelines has been proposed that gives rise to so-called Metric-based EAs (MBEAs). Extended by the minimal moves mutation they allow for a generalization of EA with self-adaptive mutation strength in discrete search spaces. In this article, a problem-specific EA for process engineering task is designed, following the MBEA guidelines and minimal moves mutation. On the background of the application, the usefulness of the design framework is discussed, and further extensions and corrections proposed. As a case-study, a two-stage stochastic programming problem in chemical batch process scheduling is considered. The algorithm design problem can be viewed as the choice of a hierarchical decision structure, where on different layers of the decision process symmetries and similarities can be exploited for the design of minimal moves. After a discussion of the design approach and its instantiation for the case-study, the resulting problem-specific EA/MIP is compared to a straightforward application of a canonical EA/MIP and to a monolithic mathematical programming algorithm. In view of the

  12. Program reference schedule baseline

    International Nuclear Information System (INIS)

    1986-07-01

    This Program Reference Schedule Baseline (PRSB) provides the baseline Program-level milestones and associated schedules for the Civilian Radioactive Waste Management Program. It integrates all Program-level schedule-related activities. This schedule baseline will be used by the Director, Office of Civilian Radioactive Waste Management (OCRWM), and his staff to monitor compliance with Program objectives. Chapter 1 includes brief discussions concerning the relationship of the PRSB to the Program Reference Cost Baseline (PRCB), the Mission Plan, the Project Decision Schedule, the Total System Life Cycle Cost report, the Program Management Information System report, the Program Milestone Review, annual budget preparation, and system element plans. Chapter 2 includes the identification of all Level 0, or Program-level, milestones, while Chapter 3 presents and discusses the critical path schedules that correspond to those Level 0 milestones

  13. An corrigendum on the paper : Solving the job-shop scheduling problem optimally by dynamic programming (Computers and Operations Research 39(12) (2968–2977) (S0305054812000500) (10.1016/j.cor.2012.02.024))

    NARCIS (Netherlands)

    van Hoorn, Jelke J.; Nogueira, Agustín; Ojea, Ignacio; Gromicho Dos Santos, Joaquim Antonio

    2017-01-01

    In [1] an algorithm is proposed for solving the job-shop scheduling problem optimally using a dynamic programming strategy. This is, according to our knowledge, the first exact algorithm for the Job Shop problem which is not based on integer linear programming and branch and bound. Despite the

  14. The Air Traffic Controller Work-Shift Scheduling Problem in Spain from a Multiobjective Perspective: A Metaheuristic and Regular Expression-Based Approach

    Directory of Open Access Journals (Sweden)

    Faustino Tello

    2018-01-01

    Full Text Available We address an air traffic control operator (ATCo work-shift scheduling problem. We consider a multiple objective perspective where the number of ATCos is fixed in advance and a set of ATCo labor conditions have to be satisfied. The objectives deal with the ATCo work and rest periods and positions, the structure of the solution, the number of control center changes, or the distribution of the ATCo workloads. We propose a three-phase problem-solving methodology. In the first phase, a heuristic is used to derive infeasible initial solutions on the basis of templates. Then, a multiple independent run of the simulated annealing metaheuristic is conducted aimed at reaching feasible solutions in the second phase. Finally, a multiple independent simulated annealing run is again conducted from the initial feasible solutions to optimize the objective functions. To do this, we transform the multiple to single optimization problem by using the rank-order centroid function. In the search processes in phases 2 and 3, we use regular expressions to check the ATCo labor conditions in the visited solutions. This provides high testing speed. The proposed approach is illustrated using a real example, and the optimal solution which is reached outperforms an existing template-based reference solution.

  15. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

    Sørensen, M. D.; Clausen, Jens

    2002-01-01

    scheduling is investigated. The airport terminal is divided into zones, where each zone consists of a set of stands geographically next to each other. Staff is assigned to work in only one zone and the staff scheduling is planned decentralized for each zone. The advantage of this approach is that the staff...... work in a smaller area of the terminal and thus spends less time walking between stands. When planning decentralized the allocation of stands to flights influences the staff scheduling since the workload in a zone depends on which flights are allocated to stands in the zone. Hence solving the problem...... depends on the actual stand allocation but also on the number of zones and the layout of these. A mathematical model of the problem is proposed, which integrates the stand allocation and the staff scheduling. A heuristic solution method is developed and applied on a real case from British Airways, London...

  16. Current problems arising from the new law relating to franchise duties; Aktuelle Probleme des neuen Konzessionsabgabenrechts

    Energy Technology Data Exchange (ETDEWEB)

    Becker, P.

    1996-12-31

    The contribution examines the advantages and drawbacks of the new ordinance in German law relating to payment of franchise duties. The ordinance may bring about new problems if abused as a means of bringing pressure to bear in negotiations for takeover of existing electric or gas supply systems by local governments. The author analyses the legitimation of such exploitation of the franchise duty and in this context the general legal framework. (orig./CB) [Deutsch] Der Beitrag untersucht Vor- und Nachteile der neuen Verordnung im Konzessionsabgabenrecht, die im Hinblick auf Auseinandersetzungen um die ``Ubernahme von Strom- oder Gasversorgungssystemen durch Gemeinden neue Probleme mit sich bringen koennte, wenn Konzessionsabgaben als Druckmittel eingesetzt werden. Der Autor analysiert die Zulaessigkeit eines derartigen Einsatzes und in diesem Zusammenhang auch die rechtliche Basis der Konzessionsabgaben. (orig./CB)

  17. Safety problems relating to plutonium recycling in light water reactors

    International Nuclear Information System (INIS)

    Devillers, C.; Frison, J.M.; Mercier, J.P.; Revais, J.P

    1991-01-01

    This paper describes the specific nature, as regards safety, of the mixed oxide (MOX) fuel cycle, with the exception of safety problems relating to the operation of nuclear power plants. These specific characteristics are due mainly to the presence of plutonium in fresh fuel and to the higher plutonium and transuranic element content in spent fuel assemblies. The fuel cycle steps analysed here are the transport of plutonium oxide, the manufacture of MOX fuel assemblies, the transport of fresh and spent fuel assemblies and the processing of spent fuel assemblies. (author) [fr

  18. Safety problems relating to plutonium recycling in light water reactors

    International Nuclear Information System (INIS)

    Devillers, C.; Frison, J.M.; Mercier, J.P.; Revais, J.P.

    1991-01-01

    This paper describes the specific nature, as regards safety, of the mixed oxide (MOX) fuel cycle, with the exception of safety problems relating to the operation of nuclear power plants. These specific characteristics are due mainly to the presence of plutonium in fresh fuel and to the higher plutonium and transuranic element content in spent fuel assemblies. The fuel cycle steps analysed here are the transport of plutonium oxide, the manufacture of MOX fuel assemblies, the transport of fresh and spent fuel assemblies and the processing of spent fuel assemblies

  19. Statistics and Corporate Environmental Management: Relations and Problems

    DEFF Research Database (Denmark)

    Madsen, Henning; Ulhøi, John Parm

    1997-01-01

    Statistical methods have long been used to analyse the macroeconomic consequences of environmentally damaging activities, political actions to control, prevent, or reduce these damages, and environmental problems in the natural environment. Up to now, however, they have had a limited and not very...... in the external environment. The nature and extent of the practical use of quantitative techniques in corporate environmental management systems is discussed on the basis of a number of company surveys in four European countries.......Statistical methods have long been used to analyse the macroeconomic consequences of environmentally damaging activities, political actions to control, prevent, or reduce these damages, and environmental problems in the natural environment. Up to now, however, they have had a limited and not very...... specific use in corporate environmental management systems. This paper will address some of the special problems related to the use of statistical techniques in corporate environmental management systems. One important aspect of this is the interaction of internal decisions and activities with conditions...

  20. Evaluation of scheduling problems for the project planning of large-scale projects using the example of nuclear facility dismantling; Evaluation von Schedulingproblemen fuer die Projektplanung von Grossprojekten am Beispiel des kerntechnischen Rueckbaus

    Energy Technology Data Exchange (ETDEWEB)

    Huebner, Felix; Schellenbaum, Uli; Stuerck, Christian; Gerhards, Patrick; Schultmann, Frank

    2017-05-15

    The magnitude of widespread nuclear decommissioning and dismantling, regarding deconstruction costs and project duration, exceeds even most of the prominent large-scale projects. The deconstruction costs of one reactor are estimated at several hundred million Euros and the dismantling period for more than a decade. The nuclear power plants built in the 1970s are coming closer to the end of their planned operating lifespan. Therefore, the decommissioning and dismantling of nuclear facilities, which is posing a multitude of challenges to planning and implementation, is becoming more and more relevant. This study describes planning methods for large-scale projects. The goal of this paper is to formulate a project planning problem that appropriately copes with the specific challenges of nuclear deconstruction projects. For this purpose, the requirements for appropriate scheduling methods are presented. Furthermore, a variety of possible scheduling problems are introduced and compared by their specifications and their behaviour. A set of particular scheduling problems including possible extensions and generalisations is assessed in detail. Based on the introduced problems and extensions, a Multi-mode Resource Investment Problem with Tardiness Penalty is chosen to fit the requirements of nuclear facility dismantling. This scheduling problem is then customised and adjusted according to the specific challenges of nuclear deconstruction projects. It can be called a Multi-mode Resource Investment Problem under the consideration of generalized precedence constraints and post-operational costs.

  1. Origins and development of the Cauchy problem in general relativity

    International Nuclear Information System (INIS)

    Ringström, Hans

    2015-01-01

    The seminal work of Yvonne Choquet-Bruhat published in 1952 demonstrates that it is possible to formulate Einstein's equations as an initial value problem. The purpose of this article is to describe the background to and impact of this achievement, as well as the result itself. In some respects, the idea of viewing the field equations of general relativity as a system of evolution equations goes back to Einstein himself; in an argument justifying that gravitational waves propagate at the speed of light, Einstein used a special choice of coordinates to derive a system of wave equations for the linear perturbations on a Minkowski background. Over the following decades, Hilbert, de Donder, Lanczos, Darmois and many others worked to put Einstein's ideas on a more solid footing. In fact, the issue of local uniqueness (giving a rigorous justification for the statement that the speed of propagation of the gravitational field is bounded by that of light) was already settled in the 1930s by the work of Stellmacher. However, the first person to demonstrate both local existence and uniqueness in a setting in which the notion of finite speed of propagation makes sense was Yvonne Choquet-Bruhat. In this sense, her work lays the foundation for the formulation of Einstein's equations as an initial value problem. Following a description of the results of Choquet-Bruhat, we discuss the development of three research topics that have their origin in her work. The first one is local existence. One reason for addressing it is that it is at the heart of the original paper. Moreover, it is still an active and important research field, connected to the problem of characterizing the asymptotic behaviour of solutions that blow up in finite time. As a second topic, we turn to the questions of global uniqueness and strong cosmic censorship. These questions are of fundamental importance to anyone interested in justifying that the Cauchy problem makes sense globally. They are

  2. Risk of alcohol dependence: prevalence, related problems and socioeconomic factors

    Directory of Open Access Journals (Sweden)

    Juliana Gabrielle Martins-Oliveira

    2016-01-01

    Full Text Available Abstract The present study evaluated the possible alcohol dependence and related problems among adolescents and determined possible associations with socioeconomic factors and gender. A cross-sectional study was conducted with a representative sample of 936 adolescents aged 15 to 19 years enrolled at public and private schools in the city of Belo Horizonte, Brazil. Data related to alcohol consumption and associated problems were collected using the Alcohol Use Disorder Identification Test (AUDIT. The Social Vulnerability Index (SVI, mother's schooling and type of school were used to assess socioeconomic factors. Statistical analysis involved the chi-square test (p < 0.05 and Poisson regression. The prevalence of possible dependence was 16.4%, 52.1% reported concern of a family member regarding the adolescent's alcohol consumption. Female adolescents were less likely to exhibit possible dependence in comparison to males. Participants with living in a low vulnerability area were more likely to consume alcohol in comparison to those living in underprivileged areas. The results of the present study demonstrate that possible dependence was significantly associated with the male gender and low social vulnerability.

  3. Medicare program; payment policies under the physician fee schedule, five-year review of work relative value units, clinical laboratory fee schedule: signature on requisition, and other revisions to part B for CY 2012. Final rule with comment period.

    Science.gov (United States)

    2011-11-28

    This final rule with comment period addresses changes to the physician fee schedule and other Medicare Part B payment policies to ensure that our payment systems are updated to reflect changes in medical practice and the relative value of services. It also addresses, implements or discusses certain statutory provisions including provisions of the Patient Protection and Affordable Care Act, as amended by the Health Care and Education Reconciliation Act of 2010 (collectively known as the Affordable Care Act) and the Medicare Improvements for Patients and Providers Act (MIPPA) of 2008. In addition, this final rule with comment period discusses payments for Part B drugs; Clinical Laboratory Fee Schedule: Signature on Requisition; Physician Quality Reporting System; the Electronic Prescribing (eRx) Incentive Program; the Physician Resource-Use Feedback Program and the value modifier; productivity adjustment for ambulatory surgical center payment system and the ambulance, clinical laboratory, and durable medical equipment prosthetics orthotics and supplies (DMEPOS) fee schedules; and other Part B related issues.

  4. Artificial intelligence approaches to astronomical observation scheduling

    Science.gov (United States)

    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.

  5. A comparison of genetic algorithm and artificial bee colony approaches in solving blocking hybrid flowshop scheduling problem with sequence dependent setup/changeover times

    Directory of Open Access Journals (Sweden)

    Pongpan Nakkaew

    2016-06-01

    Full Text Available In manufacturing process where efficiency is crucial in order to remain competitive, flowshop is a common configuration in which machines are arranged in series and products are produced through the stages one by one. In certain production processes, the machines are frequently configured in the way that each production stage may contain multiple processing units in parallel or hybrid. Moreover, along with precedent conditions, the sequence dependent setup times may exist. Finally, in case there is no buffer, a machine is said to be blocked if the next stage to handle its output is being occupied. Such NP-Hard problem, referred as Blocking Hybrid Flowshop Scheduling Problem with Sequence Dependent Setup/Changeover Times, is usually not possible to find the best exact solution to satisfy optimization objectives such as minimization of the overall production time. Thus, it is usually solved by approximate algorithms such as metaheuristics. In this paper, we investigate comparatively the effectiveness of the two approaches: a Genetic Algorithm (GA and an Artificial Bee Colony (ABC algorithm. GA is inspired by the process of natural selection. ABC, in the same manner, resembles the way types of bees perform specific functions and work collectively to find their foods by means of division of labor. Additionally, we apply an algorithm to improve the GA and ABC algorithms so that they can take advantage of parallel processing resources of modern multiple core processors while eliminate the need for screening the optimal parameters of both algorithms in advance.

  6. Mission Operations Planning and Scheduling System (MOPSS)

    Science.gov (United States)

    Wood, Terri; Hempel, Paul

    2011-01-01

    MOPSS is a generic framework that can be configured on the fly to support a wide range of planning and scheduling applications. It is currently used to support seven missions at Goddard Space Flight Center (GSFC) in roles that include science planning, mission planning, and real-time control. Prior to MOPSS, each spacecraft project built its own planning and scheduling capability to plan satellite activities and communications and to create the commands to be uplinked to the spacecraft. This approach required creating a data repository for storing planning and scheduling information, building user interfaces to display data, generating needed scheduling algorithms, and implementing customized external interfaces. Complex scheduling problems that involved reacting to multiple variable situations were analyzed manually. Operators then used the results to add commands to the schedule. Each architecture was unique to specific satellite requirements. MOPSS is an expert system that automates mission operations and frees the flight operations team to concentrate on critical activities. It is easily reconfigured by the flight operations team as the mission evolves. The heart of the system is a custom object-oriented data layer mapped onto an Oracle relational database. The combination of these two technologies allows a user or system engineer to capture any type of scheduling or planning data in the system's generic data storage via a GUI.

  7. PROMSYS, Plant Equipment Maintenance and Inspection Scheduling

    International Nuclear Information System (INIS)

    Morgan, D.L.; Srite, B.E.

    1986-01-01

    1 - Description of problem or function: PROMSYS is a computer system designed to automate the scheduling of routine maintenance and inspection of plant equipment. This 'programmed maintenance' provides the detailed planning and accomplishment of lubrication, inspection, and similar repetitive maintenance activities which can be scheduled at specified predetermined intervals throughout the year. The equipment items included are the typical pumps, blowers, motors, compressors, automotive equipment, refrigeration units, filtering systems, machine shop equipment, cranes, elevators, motor-generator sets, and electrical switchgear found throughout industry, as well as cell ventilation, shielding, containment, and material handling equipment unique to nuclear research and development facilities. Four related programs are used to produce sorted schedule lists, delinquent work lists, and optional master lists. Five additional programs are used to create and maintain records of all scheduled and unscheduled maintenance history. 2 - Method of solution: Service specifications and frequency are established and stored. The computer program reviews schedules weekly and prints, on schedule cards, instructions for service that is due the following week. The basic output from the computer program comes in two forms: programmed-maintenance schedule cards and programmed-maintenance data sheets. The data sheets can be issued in numerical building, route, and location number sequence as equipment lists, grouped for work assigned to a particular foreman as the foreman's equipment list, or grouped by work charged to a particular work order as the work-order list. Data sheets grouped by equipment classification are called the equipment classification list

  8. A Polytime Algorithm Based on a Primal LP Model for the Scheduling Problem 1 vertical bar pmtn;p(j)=2;r(j)vertical bar Sigma w(j)C(j)

    NARCIS (Netherlands)

    Bouma, Harmen W.; Goldengorin, Boris; Lagakos, S; Perlovsky, L; Jha, M; Covaci, B; Zaharim, A; Mastorakis, N

    2009-01-01

    In this paper a Boolean Linear Programming (BLP) model is presented for the single machine scheduling problem 1 vertical bar pmtn; p(j) = 2;r(j)vertical bar Sigma w(j)C(j). The problem is a special case of the open problem 1 vertical bar pmtn; p(j) = p; r(j)vertical bar Sigma wj(g)C(j). We show that

  9. Operating Theatre Planning and Scheduling.

    NARCIS (Netherlands)

    Hans, Elias W.; Vanberkel, P.T.; Hall, R.

    2012-01-01

    In this chapter we present a number of approaches to operating theatre planning and scheduling. We organize these approaches hierarchically which serves to illustrate the breadth of problems confronted by researchers. At each hierarchicalplanning level we describe common problems, solution

  10. A Solution to the Cosmological Problem of Relativity Theory

    Science.gov (United States)

    Janzen, Daryl

    After nearly a century of scientific investigation, the standard cosmological theory continues to have many unexplained problems, which invariably amount to one troubling statement: we know of no good reason for the Universe to appear just as it does, which is described extremely well by the flat ΛCDM cosmological model. Therefore, the problem is not that the physical model is at all incompatible with observation, but that, as our empirical results have been increasingly constrained, it has also become increasingly obvious that the Universe does not meet our prior expectations; e.g., the evidence suggests that the Universe began from a singularity of the theory that is used to describe it, and with space expanding thereafter in cosmic time, even though relativity theory is thought to imply that no such objective foliation of the spacetime continuum should reasonably exist. Furthermore, the expanding Universe is well-described as being flat, isotropic, and homogeneous, even though its shape and expansion rate are everywhere supposed to be the products of local energy-content---and the necessary prior uniform distribution, of just the right amount of matter for all three of these conditions to be met, could not have been causally determined to begin with. And finally, the empirically constrained density parameters now indicate that all of the matter that we directly observe should make up only four percent of the total, so that the dominant forms of energy in the Universe should be dark energy in the form of a cosmological constant, Λ, and cold dark matter (CDM). The most common ways of attacking these problems have been: to apply modifications to the basic physical model, e.g. as in the inflation and quintessence theories which strive to resolve the horizon, flatness, and cosmological constant problems; to use particle physics techniques in order to formulate the description of dark matter candidates that might fit with observations; and, in the case of the Big

  11. Alpha decay and various problems related to it

    International Nuclear Information System (INIS)

    Katori, Kenji

    1992-01-01

    On the proton-excessive nucleus side of lanthanide and actinide, alpha decay is the main decay mode. In lanthanide region, alpha decay has been measured to the drip line for most even-even nuclei. In the measurement of alpha decay, emitted energy and life are measured, but the measurement of converted alpha width remains in the limited range. In order to obtain the converted alpha width of high accuracy, the nucleus formation in larger quantity on the drip line and the simultaneous measurement with a multiple detector system including gamma ray and beta ray are required. In this paper, three topics related to alpha cluster and alpha decay and the problems that confront at present are discussed. The continuation to exist of alpha cluster structure to heavy nuclei, the analysis of lanthanide nucleus region by the alpha giant resonance model, and the new data on the alpha ray decaying from the mass of 175, 176 and 177 are reported. In lanthanide nucleus region, remarkable interference was not observed between beta-2 and beta-3 modes in the converted alpha width measured between the ground states. The present problems in alpha decay are enumerated. (K.I.)

  12. The principle of relativity and the problem of knowledge

    International Nuclear Information System (INIS)

    Suarez Antola, R.

    2011-01-01

    This book can be considered as an introduction to some issues on the border between philosophy and science. It is intended for an audience interested in the problems that arise in scientific knowledge about the so-called post-modern era, and willing to study in some detail and depth the physical and mathematical foundations of the theory of relativity, and some of applications in astrophysics and cosmology. It assumes familiarity with the epistemology and other branches of philosophy. The philosophical content, including epistemological, are introduced as needed, starting with the first chapter is intended entirely to them, culminating in the fourteenth chapter, which discusses the structure of the theory of relativity, the theory general physics and cosmology from that point of view. In his chapters describes: the development of ideas in the Newtonian mechanics of particles and the classical theory of fields, including electromagnetism, the crisis in the foundations of nineteenth-century physics, the foundations, limitations and some applications of restricted theory, knowledge of mathematics, calculus of variations, foundations of general relativity theory, applications Schwartzschild solution, applications in astronomy and cosmology, relativistic physics issues and finally, aspects of scientific research work from the point of psychological and sociological

  13. Problems Related to the Translation of Political Texts

    Directory of Open Access Journals (Sweden)

    Sárosi-Márdirosz Krisztina

    2015-03-01

    Full Text Available This study deals with the problems related to the translation of political texts in the theoretical framework elaborated by the researchers working in the field of translation studies and reflects on the terminological peculiarities of the special language used for this text type. Consideration of the theoretical framework is followed by the analysis of a specific text spoken then written in English and translated into Hungarian and Romanian. The conclusions are intended to highlight the fact that there are no recipes for translating a political speech, because translation is not only a technical process that uses translation procedures and applies transfer operations, but also a matter of understanding cultural, historical and political situations and their significance.

  14. CMS Records Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — The CMS Records Schedule provides disposition authorizations approved by the National Archives and Records Administration (NARA) for CMS program-related records...

  15. Intercultural communication problems relating to translation from English into Sesotho

    Directory of Open Access Journals (Sweden)

    Anastacia Sara Motsei

    2013-12-01

    Full Text Available In this article, certain translative communication problems associated with the linguistic and stylistic differences between English and Sesotho are identified and discussed. With a view to help improve translation between the two languages where inaccurate and stilted communication frequently occurs, issues of equivalence, fidelity/faithfulness and the purpose of translation are delved into. It is furthermore argued that in South African multilingual contexts, like legal courts, criminal cases/hearings and hospitals clinics and similar health establishments, inaccurate translation and/or misinterpreting can lead to serious miscarriages of justice and poor service delivery. The reasons for such unfortunate eventualities sometimes relate to the translator-interpreter’s poor understanding of the cultural factors behind the English or Sesotho message. As such, emphasis is lain on the need for a translator-interpreter’s cultural understanding of the source language/text (SL/T and target language/text (TL/T to deliver an accurate version (in the target language or text – TL/T of the original message. It is furthermore shown that one cause of social and legal injustice is closely related to the translator- interpreter’s insufficient knowledge of both the English and Sesotho culture as it exists in grammatical forms, idiomatic structures, collocation patterns and stylistic patterns of the SL/T and the TL/T.

  16. Pediatrician-parent-child communication: problem-related or not?

    NARCIS (Netherlands)

    Dulmen, S. van

    2004-01-01

    Pediatricians are generally confronted with a variety of health problems. Each of these problems may benefit from another pattern of healthcare communication. It is unknown whether the communication process during pediatric visits actually differs by the nature of the child's problem. This study

  17. Constraint-based scheduling

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  19. Goals and everyday problem solving: examining the link between age-related goals and problem-solving strategy use.

    Science.gov (United States)

    Hoppmann, Christiane A; Coats, Abby Heckman; Blanchard-Fields, Fredda

    2008-07-01

    Qualitative interviews on family and financial problems from 332 adolescents, young, middle-aged, and older adults, demonstrated that developmentally relevant goals predicted problem-solving strategy use over and above problem domain. Four focal goals concerned autonomy, generativity, maintaining good relationships with others, and changing another person. We examined both self- and other-focused problem-solving strategies. Autonomy goals were associated with self-focused instrumental problem solving and generative goals were related to other-focused instrumental problem solving in family and financial problems. Goals of changing another person were related to other-focused instrumental problem solving in the family domain only. The match between goals and strategies, an indicator of problem-solving adaptiveness, showed that young individuals displayed the greatest match between autonomy goals and self-focused problem solving, whereas older adults showed a greater match between generative goals and other-focused problem solving. Findings speak to the importance of considering goals in investigations of age-related differences in everyday problem solving.

  20. Problems Related to the Abolition of Divided Real Estate Ownership

    Directory of Open Access Journals (Sweden)

    Dinsberga Jolanta

    2016-12-01

    Full Text Available Legal relationship between apartment owners in residential buildings and the land owners, that is, divided real estate ownership, was created in the Republic of Latvia in 1990, within the framework of the Land Reform, restoring property rights of the former owners or their heirs or privatising apartments in multi-apartment residential buildings. The existence of such legal relationship created different lease problems and restrictions on the property rights to the owners of both the building and the land. To abolish the legal relationship related to divided real estate ownership, the Ministry of Justice of the Republic of Latvia has developed a draft law Regarding the Abolition of Mandatory Divided Real Estate Ownership in Multi-Apartment Buildings (hereinafter referred to as Draft Law. Unfortunately, in the opinion of authors of this article, there are serious shortcomings to the Draft Law which must be corrected. The aim of the research is to identify the problematic issues by selecting and analysing the legislation on the abolition of the divided real estate ownership, which is related to the calculation of redemption price, payment method and consequences of non-payment, which are not regulated by the new Draft Law. The article reflects research on the determination and calculation of redemption price reglamented by the Draft Law and also analyses the Law of December 8, 1938, On the Abolition of Divided Real Estate Ownership and its practical implementation, which may significantly influence the redemption price and the method of its calculation; however, the mentioned law has been disregarded in developing the Draft Law. Thus the research has both theoretical and practical significance. For the research purposes general research methods, such as historical, analytical, inductive, deductive, logical-constructive and descriptive methods, are used. For the interpretation of legislation norms, grammatical, systemic, teleological and historical

  1. [Stomatological problems related to pregnancy. A statistical study].

    Science.gov (United States)

    Masoni, S; Panattoni, E; Rolla, P; Rossi, M; Giuca, M R; Gabriele, M

    1991-12-01

    Pregnancy is related to particular dental issues, such as the increased incidence of diseases( gingivitis, caries, epulis), the fluoride supplementation, and the limits of diagnostics and therapy. Moreover, the mysterious halo surrounding pregnancy often makes the dentist uneasy. In order to objectively evaluate the implications of pregnancy in dentistry, we distributed a form to 100 pregnant women. The results of the form showed that 53 of them had gingival bleeding, 22 had toothache, 19 had caries but that just 12 of them had gone to the dentist because of dental troubles while 54 had not gone at all. Among the pluri-gravidae, all the women with dental diseases in their previous pregnancies had them again in their current pregnancy but nonetheless only some had undergone a dental check-up. The dentists did not show any uneasiness, as they performed tooth extractions in 5 women, endodontics in 2 women and fillings in 11 women. Just 4 out of 100 women had taken a fluoride supplementation. We deem advisable a stronger collaboration between physician, gynecologist and dentist in order to resolve specialist problems and to make pregnant women more aware of the need for dental follow-ups and fluoride supplementations.

  2. Are maternal fertility problems related to childhood leukaemia

    International Nuclear Information System (INIS)

    Steensel-Moll, H.A. van; Valkenburg, H.A.; Vandenbroucke, J.P.; Zanen, G.E. van

    1985-01-01

    A study was conducted in the Netherlands, from a nationwide register of childhood leukaemia (1973-1980). Controls were matched with cases for year of birth, sex and place of residence. Information about exposures of the mother to potential risk factors in the year before and during pregnancy was collected via mailed questionnaires. Analyses concerned data on 519 patients with acute lymphocytic leukaemia and 507 controls. An association between maternal subfertility and childhood leukaemia might be suggested by several findings. A history of two or more miscarriages (OR 1.6; 95% Cl 1.0-2.7) and fertility problems (OR 6.0; 95% Cl 0.9-38.2) were more frequently reported among mothers of cases. Use of oral contraceptives (OC) was significantly higher (OR 1.3; 95% Cl 1.0-1.8) and the duration between discontinuation of OC and the relevant pregnancy was significantly longer. The OR for threatened abortion during the relevant pregnancy was 1.6 (95% Cl 1.0-2.6) and the related use of 'drugs to maintain pregnancy' was 1.9; 95% Cl 1.0-3.5. Among known risk factors, an increased OR for diagnostic irradiation was confirmed (OR 2.2; 95% Cl 1.2-3.8). No association between childhood leukaemia and prenatal viral infections, smoking and alcohol was found. (author)

  3. Energy use and related risk management problems in CEE countries

    International Nuclear Information System (INIS)

    Ney, R.; Michna, J.; Ekmanis, J.; Zeltins, N.; Zebergs, V.

    2008-01-01

    Nowadays, the efficiency of energy use in the Central and East-European (CEE) countries is insufficient, being much lower than in the 'Old Europe'. The problem becomes increasingly pressing due to non-stop increasing prices of energy carriers (especially of crude oil). The authors trace the development of research activities in this sphere, classifying the revealed changes in parameters of energy consumption processes in particular time intervals into deterministic, probabilistic, and fuzzy. The paper presents a thorough analysis of decision-making in the energy management at its different levels normative, strategic, and operative. Particular attention is given to the management under uncertainty conditions - i.e. to the risk management. The most wanted research directions in this area proposed by the energy and environment policy (EEP) Center specially created for CEE countries concern management under risk connected with innovations, international activities, loss of reputation, etc.. The authors consider in detail the risk management with insufficient knowledge (non-knowledge) and under chaos. Much consideration is given to the scenario management and the game theory principles as related to the sphere of energy use. (Authors)

  4. Water Related Health Problems in Central Asia—A Review

    Directory of Open Access Journals (Sweden)

    Zakir Bekturganov

    2016-05-01

    Full Text Available The present paper provides an extensive literature review on water related health issues in Central Asia. Even though the per capita amount of available freshwater is substantial in all Central Asian states the uneven distribution in time and space creates problems for water availability. Due to this, the Central Asian economies are developing under increasing water deficiency. The degradation of water supply systems and sewage treatment plants is often severe leading to potentially high water loss rates and inadequate accessibility to safe water supply. In this context, rural areas are the most affected. Low tariffs in combination with absent metering and low collection rates for water fees mean that operation and maintenance costs for basic services of water supply and sanitation are not covered. Unsafe water supply contains both microbiological and non-microbiological contaminants. Helminthiasis and intestinal protozoa infections are of considerable public health importance in Central Asia. Agricultural and industrial pollution is especially affecting downstream areas of Amu Darya and Syr Darya rivers. In large areas copper, zinc, and chromium concentrations in water exceed maximum permissible concentration. Thus, there is an urgent need to strengthen the environmental monitoring system. Small-scale water supply and sanitation systems need to be developed in line with more efficient public spending on these.

  5. Some problems relating to application of safeguards in the future

    International Nuclear Information System (INIS)

    Tolchenkov, D.L.

    1983-01-01

    By the end of this century there will have been a considerable increase in the amount of nuclear material and the number of facilities subject to IAEA safeguards. The IAEA will therefore be faced with problems due to the increased volume of safeguards activity, the application of safeguards to new types of facility and to large facilities, the optimization of the existing IAEA safeguards system and so on. The authors analyse the potential growth in the IAEA's safeguards activities up to the year 2000 and consider how to optimize methods for the application of safeguards, taking into account a number of factors relating to a State's nuclear activity, the application of full-scope IAEA safeguards etc. On the basis of a hypothetical model of the nuclear fuel cycle that allows for the factors considered as part of the International Nuclear Fuel Cycle Evaluation (INFCE), the authors assess the possible risk of diversion as a function of a full-scope safeguards effort. They also examine possible conceptual approaches to safeguarding large-scale facilities such as fuel reprocessing and uranium enrichment plants. (author)

  6. Sport Tournament Automated Scheduling System

    OpenAIRE

    Raof R. A. A; Sudin S.; Mahrom N.; Rosli A. N. C

    2018-01-01

    The organizer of sport events often facing problems such as wrong calculations of marks and scores, as well as difficult to create a good and reliable schedule. Most of the time, the issues about the level of integrity of committee members and also issues about errors made by human came into the picture. Therefore, the development of sport tournament automated scheduling system is proposed. The system will be able to automatically generate the tournament schedule as well as automatically calc...

  7. Present status of research activities relating global warming problems in Japan (mainly MITI and relating organizations)

    Energy Technology Data Exchange (ETDEWEB)

    Yokoyama, O.

    1993-12-31

    Japanese government has issued action program so called {open_quotes}Action Program to Arrest Global Warming{close_quotes} for preventing global warming at Oct., 1990. According to the program, CO{sub 2} emission should be stabilized on a per capita basis in the year 2000 and beyond at about same level as in 2000 by introducing several methods such as energy conservation, improvement of energy using efficiency, expanding use of renewable energy and so on. The basic concept, target and methods are summarized. At the same time, MITI published so called {open_quotes}New Earth 21{close_quotes} project which aims remedying the earth environment modified by human activities since industrial innovation began at about 200 years ago in coming 100 years. This plan proposed yearly step of research development of technology for mitigating CO{sub 2} emission. According to the MITI`s plan, 15 institutions belonging to AIST have carrying research for developing technology of reducing emission of CO{sub 2} and other greenhouse gases, with cooperation of other research organizations such as RITE (research Institute of Innovative Technology for Earth) and NEDO (New Energy and Industrial Technology Developing Organization). Time schedule of the research development by The New Earth 21 project is summarized in Table 2. Now, in Japan, many national institutions and universities, research works relating reduction and mitigation of GHG are carried out according to this guideline.

  8. Harmonious personnel scheduling

    NARCIS (Netherlands)

    Fijn van Draat, Laurens; Post, Gerhard F.; Veltman, Bart; Winkelhuijzen, Wessel

    2006-01-01

    The area of personnel scheduling is very broad. Here we focus on the ‘shift assignment problem’. Our aim is to discuss how ORTEC HARMONY handles this planning problem. In particular we go into the structure of the optimization engine in ORTEC HARMONY, which uses techniques from genetic algorithms,

  9. Hybrid job shop scheduling

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1995-01-01

    We consider the problem of scheduling jobs in a hybrid job shop. We use the term 'hybrid' to indicate that we consider a lot of extensions of the classic job shop, such as transportation times, multiple resources, and setup times. The Shifting Bottleneck procedure can be generalized to deal with

  10. Explicitly solvable complex Chebyshev approximation problems related to sine polynomials

    Science.gov (United States)

    Freund, Roland

    1989-01-01

    Explicitly solvable real Chebyshev approximation problems on the unit interval are typically characterized by simple error curves. A similar principle is presented for complex approximation problems with error curves induced by sine polynomials. As an application, some new explicit formulae for complex best approximations are derived.

  11. Autonomous scheduling technology for Earth orbital missions

    Science.gov (United States)

    Srivastava, S.

    1982-01-01

    The development of a dynamic autonomous system (DYASS) of resources for the mission support of near-Earth NASA spacecraft is discussed and the current NASA space data system is described from a functional perspective. The future (late 80's and early 90's) NASA space data system is discussed. The DYASS concept, the autonomous process control, and the NASA space data system are introduced. Scheduling and related disciplines are surveyed. DYASS as a scheduling problem is also discussed. Artificial intelligence and knowledge representation is considered as well as the NUDGE system and the I-Space system.

  12. Community mobilization and the framing of alcohol-related problems.

    Science.gov (United States)

    Herd, Denise

    2010-03-01

    The goal of this study was to describe how activists engaged in campaigns to change alcohol policies in inner city areas framed alcohol problems, and whether or not their frameworks reflected major models used in the field, such as the alcoholism as a disease model, an alcohol problems perspective, or a public health approach to alcohol problems. The findings showed that activists' models shared some aspects with dominant approaches which tend to focus on individuals and to a lesser extent on regulating alcohol marketing and sales. However, activists' models differed in significant ways by focusing on community level problems with alcohol; on problems with social norms regarding alcohol use; and on the relationship of alcohol use to illicit drugs.

  13. Community Mobilization and the Framing of Alcohol-Related Problems

    Directory of Open Access Journals (Sweden)

    Denise Herd

    2010-03-01

    Full Text Available The goal of this study was to describe how activists engaged in campaigns to change alcohol policies in inner city areas framed alcohol problems, and whether or not their frameworks reflected major models used in the field, such as the alcoholism as a disease model, an alcohol problems perspective, or a public health approach to alcohol problems. The findings showed that activists’ models shared some aspects with dominant approaches which tend to focus on individuals and to a lesser extent on regulating alcohol marketing and sales. However, activists’ models differed in significant ways by focusing on community level problems with alcohol; on problems with social norms regarding alcohol use; and on the relationship of alcohol use to illicit drugs.

  14. The complexity of scheduling trees with communication delays

    NARCIS (Netherlands)

    Lenstra, J.K.; Veldhorst, M.; Veltman, B.

    1996-01-01

    We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length tasks with a forest of intrees as precedence relation, and with unit interprocessor communication delays. First, we prove that this problem is NP-complete; second, we derive a linear time algorithm for

  15. Scheduling in the FMCG industry : an industrial case study

    NARCIS (Netherlands)

    Elzakker, van M.A.H.; Zondervan, E.; Raikar, N.B.; Grossmann, I.E.; Bongers, P.M.M.

    2012-01-01

    A problem-specific model is presented for the short-term scheduling problem in the Fast Moving Consumer Goods (FMCG) industry. To increase the computational efficiency, the limited intermediate inventory is modeled indirectly by relating mixing and packing intervals. In addition, the model size is

  16. Shiftwork Scheduling for the 1990s.

    Science.gov (United States)

    Coleman, Richard M.

    1989-01-01

    The author discusses the problems of scheduling shift work, touching on such topics as employee desires, health requirements, and business needs. He presents a method for developing shift schedules that addresses these three areas. Implementation hints are also provided. (CH)

  17. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    Over the last ten years, there have been numerous applications of evolutionary algorithms to a variety of scheduling problems. Like most other research on heuristic scheduling, the primary aim of the research has been on deterministic formulations of the problems. This is in contrast to real world...... scheduling problems which are usually not deterministic. Usually at the time the schedule is made some information about the problem and processing environment is available, but this information is uncertain and likely to change during schedule execution. Changes frequently encountered in scheduling...... environments include machine breakdowns, uncertain processing times, workers getting sick, materials being delayed and the appearance of new jobs. These possible environmental changes mean that a schedule which was optimal for the information available at the time of scheduling can end up being highly...

  18. Interactive Anticipatory Scheduling for Two Military Applications

    National Research Council Canada - National Science Library

    Howe, Adele

    2003-01-01

    ...; these models partially explain what makes some job shop scheduling problems difficult. For the second, several algorithms for Air Force Satellite Control Network scheduling have been compared on historical and recent data...

  19. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

    overrun both their budget and time. To improve the quality of initial project plans, we show in this paper the importance of (1) reflecting features’ priorities/risk in task schedules and (2) considering uncertainties related to human factors in plan schedules. To make simulation tasks reflect features......’ priority as well as multimodal team allocation, enhanced project schedules (EPS), where remedial actions scenarios (RAS) are added, were introduced. They reflect potential schedule modifications in case of uncertainties and promote a dynamic sequencing of involved tasks rather than the static conventional...... this document as an instruction set. The electronic file of your paper will be formatted further at Journal of Software. Define all symbols used in the abstract. Do not cite references in the abstract. Do not delete the blank line immediately above the abstract; it sets the footnote at the bottom of this column....

  20. To Problem Pertaining to Provision of Electric Power Load Schedules of Power Sys- tems while Involving Potential of Power Technological Sources of Industrial Enterprises

    Directory of Open Access Journals (Sweden)

    B. M. Khroustalev

    2010-01-01

    Full Text Available The paper considers a possibility to use co-generated complexes having heat technological industrial load for operation in accordance with the requirements of irregularity of electric power generation schedule.

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

    Science.gov (United States)

    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.

  2. How to minimise the incidence of transport-related problem behaviours in horses: a review.

    Science.gov (United States)

    York, Amanda; Matusiewicz, Judith; Padalino, Barbara

    2017-01-01

    This review aims to provide practical outcomes on how to minimise the incidence of transport-related problem behaviours (TRPBs) in horses. TRPBs are unwanted behaviours occurring during different phases of transport, most commonly, a reluctance to load and scrambling during travelling. TRPBs can result in injuries to horses and horse handlers, horse trailer accidents, disruption of time schedules, inability to attend competitions, and poor performance following travel. Therefore, TRPBs are recognised as both a horse-related risk to humans and a human-related risk to horses. From the literature, it is apparent that TRPBs are common throughout the entire equine industry, and a YouTube keyword search of 'horse trailer loading' produced over 67,000 results, demonstrating considerable interest in this topic and the variety of solutions suggested. Drawing upon articles published over the last 35 years, this review summarises current knowledge on TRPBs and provides recommendations on their identification, management, and prevention. It appears that a positive human-horse relationship, in-hand pre-training, systematic training for loading and travelling, appropriate horse handling, and the vehicle driving skills of the transporters are crucial to minimise the incidence of TRPBs. In-hand pre-training based on correct application of the principles of learning for horses and horse handlers, habituation to loading and travelling, and self-loading appear to minimise the risk of TRPBs and are therefore strongly recommended to safeguard horse and horse-handler health and welfare. This review indicates that further research and education with respect to transport management are essential to substantially decrease the incidence of TRPBs in horses.

  3. Flow shop scheduling with heterogeneous workers

    OpenAIRE

    Benavides, Alexander J.; Ritt, Marcus; Miralles Insa, Cristóbal Javier

    2014-01-01

    We propose an extension to the flow shop scheduling problem named Heterogeneous Flow Shop Scheduling Problem (Het-FSSP), where two simultaneous issues have to be resolved: finding the best worker assignment to the workstations, and solving the corresponding scheduling problem. This problem is motivated by Sheltered Work centers for Disabled, whose main objective is the labor integration of persons with disabilities, an important aim not only for these centers but for any company d...

  4. Dismantling of nuclear facilities and related problems - Conference proceedings

    International Nuclear Information System (INIS)

    Tournebize, Frederic; Bordet, Didier; Charlety, Philippe; Gore, Thierry; Estrade, Jerome; Lemaire, Hermine; Ginet, Annick; Fabrier, Lionel; Evrard, Lydie; Furois, Timothee; Butez, Marc; Dutzer, Michel; Faure, Vincent; Billarand, Yann; Menuet, Lise; Lahaye, Thierry; Pin, Alain; Mougnard, Philippe; Charavy, Sylvain; Poncet, Philippe; Moggia, Fabrice; Dochy, Arnaud; Benjamin, Patrick; Poncet, Pierre-Emmanuel; Beneteau, Yannick; Richard, Jean-Baptiste; Pellenz, Gilles; Ollivier Dehaye, Catherine; Gerard, Stephane; Denissen, Luc; Davain, Henri; Duveau, Florent; Guyot, Jean-Luc; Ardellier, Luc

    2012-11-01

    The oldest French nuclear facilities, built for some of them in the 1950's for research or power generation purposes, have reached more or less the end of their life. More than 30 facilities have entered the shutdown or dismantling phase, among which 8 reactors of the very first generations of Electricite de France (EdF) reactors. The aim of this two-days conference is to take stock of the present day status and perspectives of the dismantling activity, to approach the question of the management of the wastes produced, and to share experience about large scale operations already carried out. This document gathers the available presentations given during this conference: 1 - the 'Passage' project (F. Tournebize); 2 - CEA-Grenoble: from Louis Neel to key enabling technologies (D. Bordet); 3 - Dismantling actions in France (L. Evrard); 4 - Securing control of long-term charges funding (T. Furois); 5 - Waste disposal projects and their contribution to the management of dismantling wastes (M. Butez); 6 - Specificities linked with dismantling activities (Y. Billarand); 7 - Dismantling safety: the ASN's point of view (L. Evrad); 8 - Labor Ministry viewpoint about the dismantling related questions (T. Lahaye); 9 - Consideration of organizational and human factors in dismantling operations: a new deal in the operators-service providers relation (L. Menuet); 10 - Diploma and training experience (A. Pin); 11 - Glove-boxes dismantling at La Hague plant - status and experience feedback (P. Mougnard); 12 - Dismantling of Siloe reactor (CEA-Grenoble): application of the ALARA approach (P. Charlety); 13 - BR3 - a complex dismantling: the neutron shield tank (NST) in remote operation and indirect vision (L. Denissen); 14 - Cleansing and dismantling of the Phebus PF containment (S. Charavy); 15 - Integration of dismantling at the design and exploitation stages of nuclear facilities (P. Poncet); 16 - Consideration during the design and exploitation stages of dispositions aiming at

  5. Efficient parallel algorithms for string editing and related problems

    Science.gov (United States)

    Apostolico, Alberto; Atallah, Mikhail J.; Larmore, Lawrence; Mcfaddin, H. S.

    1988-01-01

    The string editing problem for input strings x and y consists of transforming x into y by performing a series of weighted edit operations on x of overall minimum cost. An edit operation on x can be the deletion of a symbol from x, the insertion of a symbol in x or the substitution of a symbol x with another symbol. This problem has a well known O((absolute value of x)(absolute value of y)) time sequential solution (25). The efficient Program Requirements Analysis Methods (PRAM) parallel algorithms for the string editing problem are given. If m = ((absolute value of x),(absolute value of y)) and n = max((absolute value of x),(absolute value of y)), then the CREW bound is O (log m log n) time with O (mn/log m) processors. In all algorithms, space is O (mn).

  6. The relationships between problem characteristics, achievement-related behaviors, and academic achievement in problem-based learning

    NARCIS (Netherlands)

    N. Sockalingam (Nachamma); J.I. Rotgans (Jerome); H.G. Schmidt (Henk)

    2011-01-01

    textabstractThis study investigated the influence of five problem characteristics on students' achievement-related classroom behaviors and academic achievement. Data from 5,949 polytechnic students in PBL curricula across 170 courses were analyzed by means of path analysis. The five problem

  7. Environmental problems related to winter traffic safety conditions

    OpenAIRE

    Hääl, Maire-Liis; Sürje, Peep

    2006-01-01

    The changeable Nordic climate has added problems to road maintenance and the environment to ensure traffic safety under winter conditions. The widespread use of salt (NaCl) for snow and ice removal from roads has resulted in environmental impacts in many areas. Some of the problems associated with the use of NaCl are the corrosion of bridges, road surfaces and vehicles and damage to roadside vegetation and aquatic system that are affected by water from de-iced roads. Accumulation of hard meta...

  8. Delay consequencies in the construction time-schedule of nuclear power plants in relation to its safety and quality

    International Nuclear Information System (INIS)

    Recalde, J.A.

    1991-01-01

    An important delay in the construction time-schedule of a Nuclear Power Plant affects its safety and quality. This mainly occurs as a consequence of four reasons: discontinuity of the personnel working for the project; discontinuities of project suppliers; new safety and quality concepts; long-term storage. This work analyses each of the above reasons so as to foresee countermeasures to garantee the non deterioration of a Nuclear Power Plant. (author)

  9. Efficient Academic Scheduling at the U.S. Naval Academy

    National Research Council Canada - National Science Library

    Zane, David

    2003-01-01

    This research project examined academic scheduling problems at the U.S. Naval Academy. The focus was on devising methods to construct good final exam schedules and improve existing course schedules by facilitation course changes...

  10. Tritium-related materials problems in fusion reactors

    International Nuclear Information System (INIS)

    Hickman, R.G.

    1976-01-01

    Pressing materials problems that must be solved before tritium can be used to produce energy economically in fusion reactors are discussed. The following topics are discussed: (1) breeding tritium, (2) recovering bred tritium, (3) containing tritium, (4) fuel recycling, and (5) laser-fusion fueling

  11. Delayed Stochastic Linear-Quadratic Control Problem and Related Applications

    Directory of Open Access Journals (Sweden)

    Li Chen

    2012-01-01

    stochastic differential equations (FBSDEs with Itô’s stochastic delay equations as forward equations and anticipated backward stochastic differential equations as backward equations. Especially, we present the optimal feedback regulator for the time delay system via a new type of Riccati equations and also apply to a population optimal control problem.

  12. Income inequality, alcohol use, and alcohol-related problems.

    Science.gov (United States)

    Karriker-Jaffe, Katherine J; Roberts, Sarah C M; Bond, Jason

    2013-04-01

    We examined the relationship between state-level income inequality and alcohol outcomes and sought to determine whether associations of inequality with alcohol consumption and problems would be more evident with between-race inequality measures than with the Gini coefficient. We also sought to determine whether inequality would be most detrimental for disadvantaged individuals. Data from 2 nationally representative samples of adults (n = 13,997) from the 2000 and 2005 National Alcohol Surveys were merged with state-level inequality and neighborhood disadvantage indicators from the 2000 US Census. We measured income inequality using the Gini coefficient and between-race poverty ratios (Black-White and Hispanic-White). Multilevel models accounted for clustering of respondents within states. Inequality measured by poverty ratios was positively associated with light and heavy drinking. Associations between poverty ratios and alcohol problems were strongest for Blacks and Hispanics compared with Whites. Household poverty did not moderate associations with income inequality. Poverty ratios were associated with alcohol use and problems, whereas overall income inequality was not. Higher levels of alcohol problems in high-inequality states may be partly due to social context.

  13. Computer Use and Vision‑Related Problems Among University ...

    African Journals Online (AJOL)

    and adjusted OR was calculated using the multiple logistic regression. Results: The ... Nearly 72% of students reported frequent interruption of computer work. Headache ... procedure (non-probability sampling) recruiting 250 .... Table 1: Percentage distribution of visual problems among different genders and ethnic groups.

  14. Mental Health Problems and Related Factors in Ecuadorian College Students

    Directory of Open Access Journals (Sweden)

    Claudia Torres

    2017-05-01

    Full Text Available Although the mental health problems of college students have been the subject of increasing research, there are no studies about its prevalence in Ecuadorian college students. The aim of this study was to determine the mental health problems and their associated factors in Ecuadorian freshmen university students. A sample of 1092 students (53.7% women; mean age = 18.3 years were recruited from the Technical Particular University of Loja (Ecuador. Socio-demographic, academic, and clinical characteristics were gathered, as well as information on the participants’ mental health through a number of mental health screens. Prevalence of positive screens was 6.2% for prevalence of major depressive episodes, 0.02% for generalized anxiety disorders, 2.2% for panic disorders, 32.0% for eating disorders, 13.1% for suicidal risk. Mental health problems were significantly associated with sex, area of study, self-esteem, social support, personality and histories of mental health problems. The findings offer a starting point for identifying useful factors to target prevention and intervention strategies aimed at university students.

  15. Mental Health Problems and Related Factors in Ecuadorian College Students.

    Science.gov (United States)

    Torres, Claudia; Otero, Patricia; Bustamante, Byron; Blanco, Vanessa; Díaz, Olga; Vázquez, Fernando L

    2017-05-15

    Although the mental health problems of college students have been the subject of increasing research, there are no studies about its prevalence in Ecuadorian college students. The aim of this study was to determine the mental health problems and their associated factors in Ecuadorian freshmen university students. A sample of 1092 students (53.7% women; mean age = 18.3 years) were recruited from the Technical Particular University of Loja (Ecuador). Socio-demographic, academic, and clinical characteristics were gathered, as well as information on the participants' mental health through a number of mental health screens. Prevalence of positive screens was 6.2% for prevalence of major depressive episodes, 0.02% for generalized anxiety disorders, 2.2% for panic disorders, 32.0% for eating disorders, 13.1% for suicidal risk. Mental health problems were significantly associated with sex, area of study, self-esteem, social support, personality and histories of mental health problems. The findings offer a starting point for identifying useful factors to target prevention and intervention strategies aimed at university students.

  16. Language and Communication-Related Problems of Aviation Safety.

    Science.gov (United States)

    Cushing, Steven

    A study of the problems posed by the use of natural language in various aspects of aviation is presented. The study, part of a larger investigation of the feasibility of voice input/output interfaces for communication in aviation, looks at representative real examples of accidents and near misses resulting from language confusions and omissions.…

  17. Gambling behaviors and psychopathology related to Attention-Deficit/Hyperactivity Disorder (ADHD) in problem and non-problem adult gamblers.

    Science.gov (United States)

    Fatseas, Melina; Alexandre, Jean-Marc; Vénisse, Jean-Luc; Romo, Lucia; Valleur, Marc; Magalon, David; Chéreau-Boudet, Isabelle; Luquiens, Amandine; Guilleux, Alice; Groupe Jeu; Challet-Bouju, Gaëlle; Grall-Bronnec, Marie

    2016-05-30

    Previous studies showed that Pathological Gambling and Attention Deficit/Hyperactivity Disorder (ADHD) often co-occur. The aim of this study was to examine whether ADHD is associated with specific severity patterns in terms of gambling behavior, psychopathology and personality traits. 599 problem and non-problem-gamblers were recruited in addiction clinics and gambling places in France. Subjects were assessed with the Wender-Utah Rating Scale-Child, the Adult ADHD Self-Report Scale, the Mini International Neuropsychiatric Interview, the Temperament and Character Inventory, the South Oaks Gambling Screen and questionnaires assessing gambling related cognitive distortions and gambling habits. 20.7% (n=124) of gamblers were screened positive for lifetime or current ADHD. Results from the multivariate analysis showed that ADHD was associated with a higher severity of gambling-related problems and with more psychiatric comorbidity. Among problem gamblers, subjects with history of ADHD were also at higher risk for unemployment, psychiatric comorbidity and specific dysfunctional personality traits. This study supports the link between gambling related problems and ADHD in a large sample of problem and non-problem gamblers, including problem-gamblers not seeking treatment. This points out the necessity to consider this disorder in the prevention and in the treatment of pathological gambling. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

  18. The problem of using trade secrets in economic relations

    Directory of Open Access Journals (Sweden)

    А. О. Олефір

    2015-05-01

    Full Text Available Problem setting. In a market economy and increased competition between enterprises become increasingly important concepts such as business information, trade secrets, know-how, confidential information, the information with restricted access. Given the fact that only one patent protection is unable to meet the needs of researchers, in addition to formal public protection and secured legal means we would like to pay attention at private legal measures, particular, the mode of trade secrets. Recent research and publications analysis. Different aspects of the protection of trade secrets were investigated by specialists such as G. Androschuk, J. Berzhye, I. Davydov, O. Davydyuk, D. Zadyhaylo, P. Kraynov, G. Nikiforov, S. Nikiforov, V. Rubanov, E. Solovyov, L. Hoffman, V. Chaplygin, A. Cherniavsky and others. However, at present there is a lack of comprehensive research of this legal phenomenon, equally useful for innovators and businesses that actively protect corporate security. Paper objective. This article is planned to determine the legal characteristics, structural elements and mechanisms by which the use of trade secrets in business have a positive impact on innovation development and corporate security entities. Paper main body. On the basis of requirements of Art. 505 Civil Code of Ukraine and art. 39 of the TRIPS Agreement we formulated commercial information signs under which it receives legal protection as an object of intellectual property: (1 privacy (real or potential in the sense that it is as a whole or in a precise combination of aggregate and its components are not generally known or available to persons in the circles that normally deal with such information; (2 commercial value (not purely industrial or industrial, due to its secrecy; this information is unknown to others, which is a commercial interest; (3 the lawful holder of the information provides active special measures (technical, organizational, legal to preserve secrecy

  19. Open Problems Related to the Hurwitz Stability of Polynomials Segments

    Directory of Open Access Journals (Sweden)

    Baltazar Aguirre-Hernández

    2018-01-01

    Full Text Available In the framework of robust stability analysis of linear systems, the development of techniques and methods that help to obtain necessary and sufficient conditions to determine stability of convex combinations of polynomials is paramount. In this paper, knowing that Hurwitz polynomials set is not a convex set, a brief overview of some results and open problems concerning the stability of the convex combinations of Hurwitz polynomials is then provided.

  20. The global existence problem and cosmic censorship in general relativity

    International Nuclear Information System (INIS)

    Moncrief, V.; Eardley, D.M.

    1981-01-01

    Two global existence conjectures for the Einstein equations are formulated and their relevance to the cosmic censorship conjecture discussed. It is argued that the reformulation of the cosmic censorship conjecture as a global existence problem renders it more amenable to direct analytical attack. To demonstrate the facility of this approach the cosmological version of the global existence conjecture is proved for the Gowdy spacetimes on T 3 X R. (author)

  1. An Automatic Course Scheduling Approach Using Instructors' Preferences

    Directory of Open Access Journals (Sweden)

    Hossam Faris

    2012-03-01

    Full Text Available University Courses Timetabling problem has been extensively researched in the last decade. Therefore, numerous approaches were proposed to solve UCT problem. This paper proposes a new approach to process a sequence of meetings between instructors, rooms, and students in predefined periods of time with satisfying a set of constraints divided in variety of types. In addition, this paper proposes new representation for courses timetabling and conflict-free for each time slot by mining instructor preferences from previous schedules to avoid undesirable times for instructors. Experiments on different real data showed the approach achieved increased satisfaction degree for each instructor and gives feasible schedule with satisfying all hard constraints in construction operation. The generated schedules have high satisfaction degrees comparing with schedules created manually. The research conducts experiments on collected data gathered from the computer science department and other related departments in Jordan University of Science and Technology- Jordan.

  2. A greedy double swap heuristic for nurse scheduling

    Directory of Open Access Journals (Sweden)

    Murphy Choy

    2012-10-01

    Full Text Available One of the key challenges of nurse scheduling problem (NSP is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients’ demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to their work schedules add another dimension of complexity. Most solutions proposed for solving nurse scheduling involve the use of mathematical programming and generally considers only the hard constraints. However, the psychological needs of the nurses are ignored and this resulted in subsequent interventions by the nursing staffs to remedy any deficiency and often results in last minute changes to the schedule. In this paper, we present a staff preference optimization framework solved with a greedy double swap heuristic. The heuristic yields good performance in speed at solving the problem. The heuristic is simple and we will demonstrate its performance by implementing it on open source spreadsheet software.

  3. Scheduling the scheduling task : a time management perspective on scheduling

    NARCIS (Netherlands)

    Larco Martinelli, J.A.; Wiers, V.C.S.; Fransoo, J.C.

    2013-01-01

    Time is the most critical resource at the disposal of schedulers. Hence, an adequate management of time from the schedulers may impact positively on the scheduler’s productivity and responsiveness to uncertain scheduling environments. This paper presents a field study of how schedulers make use of

  4. Staff Scheduling within the Retail Business in Denmark

    DEFF Research Database (Denmark)

    Leedgaard, Jesper; Mortensen, Kim H.; Larsen, Allan

    2002-01-01

    Staff Scheduling within the retail business deals with the assignment of employees such as shop assistants to work tasks so that the right number of employees are available at any given times and the total staff costs are minimized. In this paper the retail staff scheduling problem is formulated...... as a Mixed Integer Problem. The retail staff scheduling problem is solved using the metaheuristic {\\$\\backslash\\$it Simulated Annealing}. The heuristic is implemented by modifying the original MIP model. Some of the constraints defined in the MIP are relaxed, entered into the objective function and weighted...... according to their relative importance. The problem is then formulated as minimizing the overall constraint violation. A thorough parameter test has been applied to the developed heuristics. The developed system has successfully been implemented in a number of shops and stores in Denmark....

  5. Current problems of foreign practice-related educational psychology

    Directory of Open Access Journals (Sweden)

    A.D. Andreeva

    2012-09-01

    Full Text Available The article regards the questions of scientific-methodological provision of psychologist’s activity in an educational settlement which are urgent for the activity of practical educational psychologist in Russia as well. The presented information concerns the psychologist’s particular strands of work which can be both developing (development of ABM and psycho-correcting (reasons and forms of school phobias, bullying displays, lying. The ethical problems of psychologist’s work with families namely in case of the parent-child conflicts is also reviewed in the article.

  6. Nurse scheduling in a hospital emergency department: A case study at a Thai university hospital

    Directory of Open Access Journals (Sweden)

    Aussadavut Dumrongsiri

    2018-02-01

    Full Text Available Common problems of Thai nurses are low quality of life, working long hours, and a high turnover rate. The workload imbalance among nurses also worsens the turnover rate. With careful schedule planning, nurses do not have to work in consecutive shifts and can rest more. We interviewed and collected data from an emergency department at a hospital administered by a Thai university, related to objectives and constraints of monthly nurse scheduling, and actual monthly schedules. A multi-objective mathematical model was developed using the open source “OpenSolver” software in MS-Excel for nurse schedulers to freely use. We tested the model using actual data collected from the department and found that the schedules created by the model tended to provide more balanced workloads and more days off compared to the schedules created manually by a real scheduler. The model also suggested an easy policy to increase the number of nurses for future expansion.

  7. Actual problems of accession in relation with library statistics

    Directory of Open Access Journals (Sweden)

    Tereza Poličnik-Čermelj

    2010-01-01

    Full Text Available Accession is the process of recording bibliographic units in an accession register. Typically,library materials are acquired by purchase, exchange, gift or legal deposit. How-ever, COBISS (Cooperative Online Bibliographic System and Services Holdings software module includes some additional methods of acquisition which causes problems in gathering and presenting statistical data on local holdings. The article explains how to record holdings of different types of library materials and how to record retrospective collections. It describes necessary procedures in case the codes that define the publication pattern of the holdings are changed with special attention to integrating resources. Procedures of accession and circulation of bound materials, supplementary materials, teaching sets, multi parts, multimedia and collection level catalogue records are described. The attention is given to errors in recording lost item replacements and to the problems of circulation of certain types of library materials. The author also suggests how to record remote electronic resources. It is recommended to verify holdings data before the accession register is generated. The relevant and credible statistical data on collection development can only be created by librarians with sufficient acquisition and cataloguing skills.

  8. Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach

    Energy Technology Data Exchange (ETDEWEB)

    Jafarzadeh, Hassan; Moradinasab, Nazanin; Gerami, Ali

    2017-07-01

    Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem. Design/methodology/approach: No-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times and probable rework in both stations, different ready times for all jobs and rework times for both stations as well as unrelated parallel machines with regards to the simultaneous minimization of maximum job completion time and average latency functions have been investigated in a multi-objective manner. In this study, the parameter setting has been carried out using Taguchi Method based on the quality indicator for beater performance of the algorithm. Findings: The results of this algorithm have been compared with those of conventional, multi-objective algorithms to show the better performance of the proposed algorithm. The results clearly indicated the greater performance of the proposed algorithm. Originality/value: This study provides an efficient method for solving multi objective no-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times, probable rework in both stations, different ready times for all jobs, rework times for both stations and unrelated parallel machines which are the real constraints.

  9. Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach

    International Nuclear Information System (INIS)

    Jafarzadeh, Hassan; Moradinasab, Nazanin; Gerami, Ali

    2017-01-01

    Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem. Design/methodology/approach: No-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times and probable rework in both stations, different ready times for all jobs and rework times for both stations as well as unrelated parallel machines with regards to the simultaneous minimization of maximum job completion time and average latency functions have been investigated in a multi-objective manner. In this study, the parameter setting has been carried out using Taguchi Method based on the quality indicator for beater performance of the algorithm. Findings: The results of this algorithm have been compared with those of conventional, multi-objective algorithms to show the better performance of the proposed algorithm. The results clearly indicated the greater performance of the proposed algorithm. Originality/value: This study provides an efficient method for solving multi objective no-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times, probable rework in both stations, different ready times for all jobs, rework times for both stations and unrelated parallel machines which are the real constraints.

  10. 40 Dynamics of Foreign Trade and Trade Relation Problems: Policy ...

    African Journals Online (AJOL)

    FIRST LADY

    2011-01-18

    Jan 18, 2011 ... bounty of material good, but also of intellectual and cultural capital, an .... of market, increased investment and development of other sectors of the .... battered public image that has had an impinging effect on external relations.

  11. Bibliography on the stochastic processes in plasma and related problems

    International Nuclear Information System (INIS)

    Polovin, R.V.

    1976-01-01

    Stochastic processes in plasma and related matters. The bibliography contains 500 references and was compiled from the open literature only. Some references are annotated or completed with short abstracts. There are subject and authors indexes

  12. Relative information entropy in cosmology: The problem of information entanglement

    Energy Technology Data Exchange (ETDEWEB)

    Czinner, Viktor G., E-mail: czinner.viktor@wigner.mta.hu [Centro de Matemática, Universidade do Minho, Campus de Gualtar, 4710-057 Braga (Portugal); HAS Wigner Research Centre for Physics, H-1525 Budapest, P.O. Box 49 (Hungary); Mena, Filipe C., E-mail: fmena@math.uminho.pt [Centro de Matemática, Universidade do Minho, Campus de Gualtar, 4710-057 Braga (Portugal)

    2016-07-10

    The necessary information to distinguish a local inhomogeneous mass density field from its spatial average on a compact domain of the universe can be measured by relative information entropy. The Kullback–Leibler (KL) formula arises very naturally in this context, however, it provides a very complicated way to compute the mutual information between spatially separated but causally connected regions of the universe in a realistic, inhomogeneous model. To circumvent this issue, by considering a parametric extension of the KL measure, we develop a simple model to describe the mutual information which is entangled via the gravitational field equations. We show that the Tsallis relative entropy can be a good approximation in the case of small inhomogeneities, and for measuring the independent relative information inside the domain, we propose the Rényi relative entropy formula.

  13. China's tax system relatively benign, but problems remain

    International Nuclear Information System (INIS)

    Cannon, M.

    1994-01-01

    Recent developments in China's oil market have reignited the interest of multinational oil and gas companies in China. New onshore and offshore blocks are being granted, and the Tarim basin has been opened to foreign participation for the first time. Foreign participation is also being sought in refining and other downstream areas. Though Chinese officials have long been viewed as difficult negotiators, the tax provisions applicable to oil and gas exploration and production in China are some of the more generous in the area. This article describes some of the relevant features of the system and some of the problem areas. The paper describes production sharing contracts, applicable taxes, gross income determination, taxable income, tax consolidation, overseas charges, and withholding taxes on payments to subcontractors and employees

  14. Closed orbit related problems: Correction, feedback, and analysis

    International Nuclear Information System (INIS)

    Bozoki, E.S.

    1995-01-01

    Orbit correction - moving the orbit to a desired orbit, orbit stability - keeping the orbit on the desired orbit using feedback to filter out unwanted noise, and orbit analysis - to learn more about the model of the machine, are strongly interrelated. They are the three facets of the same problem. The better one knows the model of the machine, the better the predictions that can be made on the behavior of the machine (inverse modeling) and the more accurately one can control the machine. On the other hand, one of the tools to learn more about the machine (modeling) is to study and analyze the orbit response to open-quotes kicks.close quotes

  15. Vehicle and driver scheduling for public transit.

    Science.gov (United States)

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

  16. Alcohol- and drug-related absenteeism: a costly problem.

    Science.gov (United States)

    Roche, Ann; Pidd, Ken; Kostadinov, Victoria

    2016-06-01

    Absenteeism related to alcohol and other drug (AOD) use can place a substantial burden on businesses and society. This study estimated the cost of AOD-related absenteeism in Australia using a nationally representative dataset. A secondary analysis of the 2013 National Drug Strategy Household Survey (n=12,196) was undertaken. Two measures of AOD-related absenteeism were used: participants' self-reported absence due to AOD use (M1); and the mean difference in absence due to any illness/injury for AOD users compared to abstainers (M2). Both figures were multiplied by $267.70 (average day's wage in 2013 plus 20% on-costs) to estimate associated costs. M1 resulted in an estimation of 2.5 million days lost annually due to AOD use, at a cost of more than $680 million. M2 resulted in an estimation of almost 11.5 million days lost, at a cost of $3 billion. AOD-related absenteeism represents a significant and preventable impost upon Australian businesses. Workplaces should implement evidence-based interventions to promote healthy employee behaviour and reduce AOD-related absenteeism. © 2015 Public Health Association of Australia.

  17. Development of Watch Schedule Using Rules Approach

    Science.gov (United States)

    Jurkevicius, Darius; Vasilecas, Olegas

    The software for schedule creation and optimization solves a difficult, important and practical problem. The proposed solution is an online employee portal where administrator users can create and manage watch schedules and employee requests. Each employee can login with his/her own account and see his/her assignments, manage requests, etc. Employees set as administrators can perform the employee scheduling online, manage requests, etc. This scheduling software allows users not only to see the initial and optimized watch schedule in a simple and understandable form, but also to create special rules and criteria and input their business. The system using rules automatically will generate watch schedule.

  18. Environmental problems relating to uranium mining and milling

    International Nuclear Information System (INIS)

    Friedman, F.B.

    1979-01-01

    The regulations of the mining and milling of uranium as they relate to the environment are discussed. The industry is primarily under the jurisdiction of the federal government and administered by the Nuclear Regulatory Commission (NRC). This authority can in some instances be relegated to the states. Certain areas of jurisdiction have been given over to Environmental Protection Agency (EPA) by the courts. The Safe Drinking Water Act is discussed as it relates to in situ leach mining. The role of the Department of Interior in the regulating of uranium mining, as described in the Federal Land Policy Management Act of 1976, is discussed. The requirement for environmental impact statements prior to licensing by the NRC or the individual states is also discussed. Air quality and radioactive waste disposal as they relate to uranium mining are also discussed

  19. The relations among maternal depressive disorder, maternal Expressed Emotion, and toddler behavior problems and attachment

    OpenAIRE

    Gravener, Julie A.; Rogosch, Fred A.; Oshri, Assaf; Narayan, Angela J.; Cicchetti, Dante; Toth, Sheree L.

    2012-01-01

    Direct and indirect relations among maternal depression, maternal Expressed Emotion (EE: Self- and Child-Criticism), child internalizing and externalizing symptoms, and child attachment were examined. Participants were mothers with depression (n = 130) and comparison mothers (n = 68) and their toddlers (M age = 20 mo.; 53% male). Assessments included the Diagnostic Interview Schedule (maternal depression); the Five Minute Speech Sample (EE); the Child Behavior Checklist (toddler behavior prob...

  20. Workers' Education in Industrialised Countries and Its Specific Problems in Relation to Development.

    Science.gov (United States)

    Labour Education, 1986

    1986-01-01

    Examines several problems that need to be addressed concerning world crisis: war, poverty, unemployment, overpopulation, environmental issues, and housing; developed versus developing countries; and social justice. The task for workers' education in relation to these problems is discussed. (CT)

  1. Malting and Brewing Industries Encounter Fusarium spp. Related Problems

    Directory of Open Access Journals (Sweden)

    Kristina Mastanjević

    2018-01-01

    Full Text Available Versatile microbiota are inevitably naturally present on cereals. Fungi, yeasts and bacteria and their metabolites all contribute to the quality and safety of the final products derived from most common beer cereals—barley and wheat. The microorganisms that are most often associated with the safety and quality of cereals for beer production belong to the Fusarium spp. They greatly influence yields from the field, and can modify and diminish economic success for farmers. However, the real problem is their harmful metabolites—mycotoxins—that affect the health of humans and animals. In the era of emerging analytical methodologies, the spectrum of known toxins originating from microorganisms that can pose a threat to humans has grown tremendously. Therefore, it is necessary to monitor microflora throughout the productive “barley to beer” chain and to act suppressive on the proliferation of unwanted microorganisms, before and during malting, preventing the occurrence of mycotoxins in final products and by-products. Multi-mycotoxin analyses are very advanced and useful tools for the assessment of product safety, and legislation should follow up and make some important changes to regulate as yet unregulated, but highly occurring, microbial toxins in malt and beer.

  2. [Behavioural problems and personality change related to cerebral amyloid angiopathy].

    Science.gov (United States)

    Gahr, Maximilian; Connemann, Bernhard J; Schönfeldt-Lecuona, Carlos

    2012-11-01

    Cerebral amyloid angiopathy (CAA) belongs to the group of amyloidoses that are characterized by the deposition of insoluble and tissue-damaging amyloid proteins. Spontaneous intracerebral hemorrhage is the common clinical presentation of CAA resulting from the degenerative effect of beta amyloid on the cerebral vascular system. Though CAA is rather a neurological disease psychiatric symptoms can occur and even dominate the clinical picture. A case report is presented in order to illustrate the association between CAA and psychiatric symptoms. We report the case of a 54-year-old female patient with radiologic references to a probable CAA and mild cognitive impairment who developed behavioural difficulties and personality change that necessitated a psychiatric treatment. Psychiatric symptoms were most likely due to CAA. CAA can be associated with psychiatric symptoms and hence should be considered in the treatment of elderly patients with behavioural problems or personality changes. Diagnostic neuroimaging and examination of cerebrospinal fluid is recommended. © Georg Thieme Verlag KG Stuttgart · New York.

  3. Nurses' practice environment and satisfaction with schedule flexibility is related to intention to leave due to dissatisfaction: A multi-country, multilevel study.

    Science.gov (United States)

    Leineweber, Constanze; Chungkham, Holendro Singh; Lindqvist, Rikard; Westerlund, Hugo; Runesdotter, Sara; Smeds Alenius, Lisa; Tishelman, Carol

    2016-06-01

    Nursing turnover is a major issue for health care managers, notably during the global nursing workforce shortage. Despite the often hierarchical structure of the data used in nursing studies, few studies have investigated the impact of the work environment on intention to leave using multilevel techniques. Also, differences between intentions to leave the current workplace or to leave the profession entirely have rarely been studied. The aim of the current study was to investigate how aspects of the nurse practice environment and satisfaction with work schedule flexibility measured at different organisational levels influenced the intention to leave the profession or the workplace due to dissatisfaction. Multilevel models were fitted using survey data from the RN4CAST project, which has a multi-country, multilevel, cross-sectional design. The data analysed here are based on a sample of 23,076 registered nurses from 2020 units in 384 hospitals in 10 European countries (overall response rate: 59.4%). Four levels were available for analyses: country, hospital, unit, and individual registered nurse. Practice environment and satisfaction with schedule flexibility were aggregated and studied at the unit level. Gender, experience as registered nurse, full vs. part-time work, as well as individual deviance from unit mean in practice environment and satisfaction with work schedule flexibility, were included at the individual level. Both intention to leave the profession and the hospital due to dissatisfaction were studied. Regarding intention to leave current workplace, there is variability at both country (6.9%) and unit (6.9%) level. However, for intention to leave the profession we found less variability at the country (4.6%) and unit level (3.9%). Intention to leave the workplace was strongly related to unit level variables. Additionally, individual characteristics and deviance from unit mean regarding practice environment and satisfaction with schedule flexibility were

  4. Some foundational problems in the special theory of relativity

    International Nuclear Information System (INIS)

    Jammer, M.

    1979-01-01

    Attention is drawn to some of the issues of the foundations of special relativity with the aim of contributing possibly to their clarification. Roemer's determination of the velocity of light is reviewed and important issues on the historical development of the theory outlined. The group-theoretical and light-geometrical approaches are discussed and the nature of length contraction considered. (Auth./C.F.)

  5. On a covariant 2+2 formulation of the initial value problem in general relativity

    International Nuclear Information System (INIS)

    Smallwood, J.

    1980-03-01

    The initial value problems in general relativity are considered from a geometrical standpoint with especial reference to the development of a covariant 2+2 formalism in which space-time is foliated by space-like 2-surfaces under the headings; the Cauchy problem in general relativity, the covariant 3+1 formulation of the Cauchy problem, characteristic and mixed initial value problems, on locally imbedding a family of null hypersurfaces, the 2+2 formalism, the 2+2 formulation of the Cauchy problem, the 2+2 formulation of the characteristic and mixed initial value problems, and a covariant Lagrangian 2+2 formulation. (U.K.)

  6. Optimal improvement of graphs related to nuclear safeguards problems

    International Nuclear Information System (INIS)

    Jacobsen, S.E.

    1977-08-01

    This report develops the methodology for optimally improving graphs related to nuclear safeguards issues. In particular, given a fixed number of dollars, the report provides a method for optimally allocating such dollars over the arcs of a weighted graph (the weights vary as a function of dollars spent on arcs) so as to improve the system effectiveness measure which is the shortest of all shortest paths to several targets. Arc weights can be either clock times or detection probabilities and the algorithm does not explicitly consider all paths to the targets

  7. [Trampoline-related injuries in children: an increasing problem].

    Science.gov (United States)

    Königshausen, M; Gothner, M; Kruppa, C; Dudda, M; Godry, H; Schildhauer, T A; Seybold, D

    2014-06-01

    The sales of recreational trampolines have increased during the past few years. Severe injuries are associated in part with trampoline sport in the domestic setting. Therefore, this study was conducted to confirm the hypothesis of an increase in trampoline-related injuries in conjunction with the increasing sales of recreational trampolines and to find out what kind of injuries are most frequent in this context. Between 01/1999 and 09/2013 all trampoline-related injuries of children (0-16 years of age) were assessed retrospectively. Only those cases were evaluated which described with certainty a trampoline-associated trauma. The fractures were considered separately and assigned to specific localisations. Additionally, accidents at home were differentiated from institutional accidents. Within the past 13 years and 9 months trampoline-related injuries were seen in 195 infants. Fractures were present in 83 cases (42 %). The average age was 10 ± 3.4 years (range: 2-16 years). Within first half of the observed time period (7½ years; 01/1999 to 06/2006) 73 cases were detected with a significantly increasing number of injuries up to 122 cases between 07/2006 and 09/2013 (7 years, 3 months), which corresponds to an increase of 67 % (p = 0,028). The vast majority of these injuries happened in the domestic setting (90 %, n = 175), whereas only 10 % (n = 20) of the traumas occurred in public institutions. In 102 children (52 %) the lower extremity was affected and in 51 patients (26 %) the upper extremity was involved (head/spine/pelvis: n = 42, 22 %). The upper extremity was primarily affected by fractures and dislocations (n = 38, 76 %). At the upper extremity there were more injuries requiring surgery in contrast to the lower extremity (n = 11) or cervical spine (n = 1). The underlying data show a significant increase of trampoline-related injuries within the past years. The upper extremity is the second most affected

  8. Love and the commitment problem in romantic relations and friendship.

    Science.gov (United States)

    Gonzaga, G C; Keltner, D; Londahl, E A; Smith, M D

    2001-08-01

    On the basis of the proposition that love promotes commitment, the authors predicted that love would motivate approach, have a distinct signal, and correlate with commitment-enhancing processes when relationships are threatened. The authors studied romantic partners and adolescent opposite-sex friends during interactions that elicited love and threatened the bond. As expected, the experience of love correlated with approach-related states (desire, sympathy). Providing evidence for a nonverbal display of love, four affiliation cues (head nods, Duchenne smiles, gesticulation, forward leans) correlated with self-reports and partner estimates of love. Finally, the experience and display of love correlated with commitment-enhancing processes (e.g., constructive conflict resolution, perceived trust) when the relationship was threatened. Discussion focused on love, positive emotion, and relationships.

  9. Firework-related childhood injuries in Greece: a national problem.

    Science.gov (United States)

    Vassilia, Konte; Eleni, Petridou; Dimitrios, Trichopoulos

    2004-03-01

    During a 5-year period, out of 110066 children with injuries recorded in the Greek Emergency Department Injury Surveillance System (EDISS), 91 had firework-related injuries. Descriptive analyses and the Barrell matrix were used to determine risk factors and extrapolated national firework childhood injury figures were calculated. The estimated annual incidence of childhood firework injuries treated in the emergency departments of hospitals countrywide, was 7 per 100000 children years. Seventy percent of injuries concerned older children (10-14 years), mostly boys with self-inflicted injuries, whereas girls suffered injuries as bystanders. A sharp peak in spring was noted, when the Greek Orthodox Easter is celebrated. Illicitly sold fireworks caused most injuries, but in eight instances homemade firecrackers were responsible.

  10. Normative Beliefs, Expectancies, and Alcohol-Related Problems among College Students; Implications for Theory and Practice.

    Science.gov (United States)

    Fearnow-Kenny, Melodie D.; Wyrick, David L.; Hansen, William B.; Dyreg, Doug; Beau, Dan B.

    2001-01-01

    Investigation (1) examined interrelations among normative beliefs, alcohol expectancies, and alcohol-related problems, and (2) investigated whether alcohol-related expectancies mediate associations between normative beliefs and alcohol-related problems. Analyses revealed that alcohol expectancies mediate the relationship between normative beliefs…

  11. Emotional pain: surviving mental health problems related to childhood experiences.

    Science.gov (United States)

    Holm, A L; Bégat, I; Severinsson, E

    2009-09-01

    Emotional pain is described as intense by women who suffer from borderline personality disorder (BPD), and a high prevalence of reported childhood abuse was found in the literature and in research. The aim of this study was to explore the experiences of women suffering from BPD with focus on emotional pain related to childhood. An explorative design was used. Data were collected from in-depth interviews consisting of women suffering from BPD (n = 13) and an interpretive content analysis was used to analyse the text. The findings revealed two main themes: 'Power' and 'Assessment of vulnerability'. The main theme 'Power' resulted in two categories: 'Surviving the feeling of being forced' and 'Surviving the feeling of having to assume responsibility'. The other main theme 'Assessment of vulnerability' had two categories: 'Surviving the feeling of being victimized' and 'Surviving the feeling of not being loved'. The findings suggest that nursing care need to develop an understanding of how these women endure their emotional pain, and try to survive as fighting spirits and how struggling became their way of life.

  12. Automated scheduling and planning from theory to practice

    CERN Document Server

    Ozcan, Ender; Urquhart, Neil

    2013-01-01

      Solving scheduling problems has long presented a challenge for computer scientists and operations researchers. The field continues to expand as researchers and practitioners examine ever more challenging problems and develop automated methods capable of solving them. This book provides 11 case studies in automated scheduling, submitted by leading researchers from across the world. Each case study examines a challenging real-world problem by analysing the problem in detail before investigating how the problem may be solved using state of the art techniques.The areas covered include aircraft scheduling, microprocessor instruction scheduling, sports fixture scheduling, exam scheduling, personnel scheduling and production schedulingProblem solving methodologies covered include exact as well as (meta)heuristic approaches, such as local search techniques, linear programming, genetic algorithms and ant colony optimisation.The field of automated scheduling has the potential to impact many aspects of our lives...

  13. Uses of ionizing radiation and medical-care-related problems

    International Nuclear Information System (INIS)

    Smathers, J.B.

    1988-01-01

    The uses of ionizing radiation in medicine are currently undergoing changes due to at least four major influences: (1) the constantly changing public perception of the hazards of radiation, (2) continuing technical innovation and development in equipment, (3) the imposition of diagnosis-related group funding by government health-care funding agencies, and (4) an increase in the average age of the U.S. population. The combined effect of these influences will probably result in a major increase in biplanar fluoroscopic examinations to support nonsurgical approaches such as percutaneous transluminal coronary angioplasty, percutaneous transluminal neuroembolism, and lithotripsy (the fracturing of kidney stones). As some of these examinations can result in 1.5 h of fluoroscopy, major doses to the patient and to the clinical staff can be expected. In addition, improved diagnostic techniques, such as using positron emission tomography (a combination of biochemistry and positron-emitting isotopes), can be expected to increase the number of small cyclotrons installed in medical centers. Counteracting these increases in radiation exposure is the development of digital radiography, which generally results in a lowering of the dose per diagnostic procedure. In the realm of therapeutic uses, one can expect higher-energy treatment accelerators, more patients being released from the hospital on therapeutic doses of isotopes, and a potential acceptance of neutron therapy as a cancer treatment modality. The latter treatment may take the form of boron capture therapy, 252Cf implant therapy, or external beam therapy using high-energy cyclotrons and the p,Be or the d,Be reaction to create the neutrons

  14. A study of selected problems related to accidental process fires

    Energy Technology Data Exchange (ETDEWEB)

    Drange, Leiv Anfin

    2011-01-15

    predicted a correct flame length, but estimated a slightly shorter lift-off distance; the end part of the KFX-flame was more influenced by buoyancy and deviated some from that of the experiment; the measurements showed more irregular shaped temperature fields compared to the simulated; the measurements showed larger fluctuations in the temperature fields compared to the simulated; the maximum measured radiative heat flux inside the flame was 185kW/m2. The maximum simulated radiative heat flux was 193kW/m2, representing a deviation of 4.3%; the maximum measured total heat flux was 256kW/m2. A steel cylinder of radius 160mm was placed at various positions in the jet, and the relative heat transfer was assessed by means of thermocouples placed radially inside the cylinder. This work showed that: convection is the major contributor to the total heat transfer from a turbulent jet flame to a steel cylinder impinged by the flame; the largest rate of heat transfer is at the side facing the flame, i.e no high levels of turbulence induced thermal loading could be detected at the back; the heat transfer coefficient, h, is a function of the velocity of the gas flow relative to the impinged object The stability of ignited propane gas jets, discharged from circular cross section outlets of varying diameters and inclinations were examined. This resulted in: a model, with an accuracy of 0.89, that predicts the upper and lower blowout limits for propane in gas phase, as well as a critical outlet diameter of 14mm; no observations were made indicating that the outlet inclination has any effect on the blowout limits The heat attenuation in water spray in a full scale offshore flare situation was examined by applying a known model for calculations and comparing with measurements. The result of this work was: the model predictions slightly under estimated the capacity of the water curtain. There were, however, uncertainties regarding the water curtain properties, and more detailed measurements

  15. Assessment of computer-related health problems among post-graduate nursing students.

    Science.gov (United States)

    Khan, Shaheen Akhtar; Sharma, Veena

    2013-01-01

    The study was conducted to assess computer-related health problems among post-graduate nursing students and to develop a Self Instructional Module for prevention of computer-related health problems in a selected university situated in Delhi. A descriptive survey with co-relational design was adopted. A total of 97 samples were selected from different faculties of Jamia Hamdard by multi stage sampling with systematic random sampling technique. Among post-graduate students, majority of sample subjects had average compliance with computer-related ergonomics principles. As regards computer related health problems, majority of post graduate students had moderate computer-related health problems, Self Instructional Module developed for prevention of computer-related health problems was found to be acceptable by the post-graduate students.

  16. Planning and Scheduling of Airline Operations

    Directory of Open Access Journals (Sweden)

    İlkay ORHAN

    2010-02-01

    Full Text Available The Turkish Civil Aviation sector has grown at a rate of 53 % between the years 2002-2008 owing to countrywide economical developments and some removed restrictions in the aviation field. Successful international companies in the sector use advanced computer-supported solution methods for their planning and scheduling problems. These methods have been providing significant competitive advantages to those companies. There are four major scheduling and planning problems in the airline sector: flight scheduling, aircraft scheduling, crew scheduling and disruptions management. These aforementioned scheduling and planning problems faced by all airline companies in the airline sector were examined in detail. Studies reveal that companies using the advanced methods might gain significant cost reductions. However, even then, the time required for solving large scale problems may not satisfy the decision quality desired by decision makers. In such cases, using modern decision methods integrated with advanced technologies offer companies an opportunity for significant cost-advantages.

  17. Moisture and Home Energy Conservation: How to Detect, Solve and Avoid Related Problems.

    Science.gov (United States)

    National Center for Appropriate Technology, Butte, MT.

    Moisture problems are identified as an important element in home energy conservation programs. A systematic approach to understanding, recognizing, solving, and preventing moisture-related problems is offered in this four-section report. Section I examines the root of moisture problems. Section II discusses symptoms and causes of excess moisture…

  18. Human Performance on the Traveling Salesman and Related Problems: A Review

    Science.gov (United States)

    MacGregor, James N.; Chu, Yun

    2011-01-01

    The article provides a review of recent research on human performance on the traveling salesman problem (TSP) and related combinatorial optimization problems. We discuss what combinatorial optimization problems are, why they are important, and why they may be of interest to cognitive scientists. We next describe the main characteristics of human…

  19. Scheduling periodic tasks with slack

    NARCIS (Netherlands)

    Korst, J.H.M.; Aarts, E.H.L.; Lenstra, J.K.

    1997-01-01

    We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of identical processors, assuming that some slack is allowed in the time between successive executions of a periodic task. We prove that the problem is NP-hard in the strong sense. Necessary and sufficient

  20. Predictors of intimate partner problem-related suicides among suicide decedents in Kentucky

    Directory of Open Access Journals (Sweden)

    Ashley L. Comiford

    2016-07-01

    Full Text Available BACKGROUND: Suicide is the 10th leading cause of death in the United States. Furthermore, intimate partner problems are amid the top precipitating circumstances among suicide decedents. The aim of this study was to determine circumstantial associations of intimate partner problem-related suicides in suicide decedents in Kentucky. METHODS: All suicides that were reported to the Kentucky Violent Death Reporting System between 2005 and 2012 were eligible for this study. Multiple logistic regression was used to explore predictors (precipitating health-related problems, life stressors, and criminal/legal issues of intimate partner problem-related suicides. RESULTS: Of the 4,754 suicides, included in this study, approximately 17% had intimate partner problems prior to suicide. In the adjusted analysis, mental health issues, alcohol problems, history of suicides attempts, suicides precipitated by another crime, and other legal problems increased the odds of having an intimate partner-related suicide. However, having physical health problems, prior to the suicide, decreased the odds of intimate partner-related suicide. CONCLUSIONS: These results provide insight for the development of suicide interventions for individuals with intimate partner problems by targeting risk factors that are prevalent among this population. Moreover, these results may help marriage/relationship and/or family/divorce court representatives identify individuals with intimate partner problems more at risk for suicide and alleviate the influence these suicide risk factors have on individuals experiencing Intimate partner problems.