WorldWideScience

Sample records for integrated job scheduling

  1. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

    We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number of resou...... indicate that the algorithm can be used as an actual scheduling algorithm in the Grid or as a tool for analyzing Grid performance when adding extra machines or jobs. © 2012 Wiley Periodicals, Inc.......We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number...... of resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine. The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be NP-hard. An exact solution approach using Dantzig...

  2. Integrating job scheduling and constrained network routing

    DEFF Research Database (Denmark)

    Gamst, Mette

    2010-01-01

    This paper examines the NP-hard problem of scheduling jobs on resources such that the overall profit of executed jobs is maximized. Job demand must be sent through a constrained network to the resource before execution can begin. The problem has application in grid computing, where a number...

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

  4. Does self-scheduling increase nurses' job satisfaction? An integrative literature review.

    Science.gov (United States)

    Koning, Clare

    2014-09-25

    Flexible work schedules give nurses the freedom and control to manage the demands of work and home, allow organisations to meet their staffing needs and can improve job satisfaction. This article reports the results of an integrative review of published peer-reviewed research and personal narratives that examined nurses' perceptions of the relationship between job satisfaction and a self-scheduling system. Results suggest that self-scheduling is one of a number of factors that influence job satisfaction, but that implementing and sustaining such a system can be challenging. The review also found that self-scheduling programmes underpin more flexible work schedules and can benefit nurses and their organisations.

  5. Revisiting Symbiotic Job Scheduling

    OpenAIRE

    Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

    2015-01-01

    International audience; —Symbiotic job scheduling exploits the fact that in a system with shared resources, the performance of jobs is impacted by the behavior of other co-running jobs. By coscheduling combinations of jobs that have low interference, the performance of a system can be increased. In this paper, we investigate the impact of using symbiotic job scheduling for increasing throughput. We find that even for a theoretically optimal scheduler, this impact is very low, despite the subs...

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

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

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

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

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

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

  12. Scheduling job shop - A case study

    Science.gov (United States)

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

    2016-08-01

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

  13. A hybrid job-shop scheduling system

    Science.gov (United States)

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

    1992-01-01

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

  14. Job shop scheduling by local search

    NARCIS (Netherlands)

    Aarts, E.H.L.; Lenstra, J.K.; Laarhoven, van P.J.M.; Ulder, N.L.J.

    1992-01-01

    We present a computational performance analysis of local search algorithms for job shop scheduling. The algorithms under investigation are iterative improvement, simulated annealing, threshold accepting and genetic local search. Our study shows that simulated annealing performs best in the sense

  15. Job scheduling in a heterogenous grid environment

    Energy Technology Data Exchange (ETDEWEB)

    Oliker, Leonid; Biswas, Rupak; Shan, Hongzhang; Smith, Warren

    2004-02-11

    Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.

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

  17. Job schedul in Grid batch farms

    International Nuclear Information System (INIS)

    Gellrich, Andreas

    2014-01-01

    We present here a study for a scheduler which cooperates with the queueing system TORQUE and is tailored to the needs of a HEP-dominated large Grid site with around 10000 jobs slots. Triggered by severe scaling problems of MAUI, a scheduler, referred to as MYSCHED, was developed and put into operation. We discuss conceptional aspects as well as experiences after almost two years of running.

  18. Job shop scheduling by local search

    NARCIS (Netherlands)

    Vaessens, R.J.M.; Aarts, E.H.L.; Lenstra, J.K.

    1994-01-01

    We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the various methods in terms of their effectiveness

  19. Selection and scheduling of jobs with time-dependent duration

    OpenAIRE

    DM Seegmuller; SE Visagie; HC de Kock; WJ Pienaar

    2007-01-01

    In this paper two mathematical programming models, both with multiple objective functions, are proposed to solve four related categories of job scheduling problems. All four of these categories have the property that the duration of the jobs is dependent on the time of implementation and in some cases the preceding job. Furthermore, some jobs (restricted to subsets of the total pool of jobs) can, to different extents, run in parallel. In addition, not all the jobs need necessarily be implemen...

  20. Job shop scheduling with makespan objective: A heuristic approach

    Directory of Open Access Journals (Sweden)

    Mohsen Ziaee

    2014-04-01

    Full Text Available Job shop has been considered as one of the most challenging scheduling problems and there are literally tremendous efforts on reducing the complexity of solution procedure for solving job shop problem. This paper presents a heuristic method to minimize makespan for different jobs in a job shop scheduling. The proposed model is based on a constructive procedure to obtain good quality schedules, very quickly. The performance of the proposed model of this paper is examined on standard benchmarks from the literature in order to evaluate its performance. Computational results show that, despite its simplicity, the proposed heuristic is computationally efficient and practical approach for the problem.

  1. Job Flow Distribution and Ranked Jobs Scheduling in Grid Virtual Organizations

    CERN Document Server

    Toporkov, Victor; Tselishchev, Alexey; Yemelyanov, Dmitry; Potekhin, Petr

    2015-01-01

    In this work, we consider the problems of job flow distribution and ranked job framework forming within a model of cycle scheduling in Grid virtual organizations. The problem of job flow distribution is solved in terms of jobs and computing resource domains compatibility. A coefficient estimating such compatibility is introduced and studied experimentally. Two distribution strategies are suggested. Job framework forming is justified with such quality of service indicators as an average job execution time, a number of required scheduling cycles, and a number of job execution declines. Two methods for job selection and scheduling are proposed and compared: the first one is based on the knapsack problem solution, while the second one utilizes the mentioned compatibility coefficient. Along with these methods we present experimental results demonstrating the efficiency of proposed approaches and compare them with random job selection.

  2. Selection and scheduling of jobs with time-dependent duration

    Directory of Open Access Journals (Sweden)

    DM Seegmuller

    2007-06-01

    Full Text Available In this paper two mathematical programming models, both with multiple objective functions, are proposed to solve four related categories of job scheduling problems. All four of these categories have the property that the duration of the jobs is dependent on the time of implementation and in some cases the preceding job. Furthermore, some jobs (restricted to subsets of the total pool of jobs can, to different extents, run in parallel. In addition, not all the jobs need necessarily be implemented during the given time period.

  3. Work schedule manager gap analysis : assessing the future training needs of work schedule managers using a strategic job analysis approach

    Science.gov (United States)

    2010-05-01

    This report documents the results of a strategic job analysis that examined the job tasks and knowledge, skills, abilities, and other characteristics (KSAOs) needed to perform the job of a work schedule manager. The strategic job analysis compared in...

  4. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

    Introduction The endgame of CMS installation in the underground cavern is in full swing, with several major milestones having been passed since the last CMS week. The Tracker was installed inside the Vactank just before the CERN end-of-year shutdown. Shortly after the reopening in 2008, the two remaining endcap disks, YE-2 and YE-1, were lowered, marking the completion of eight years of assembly in the surface building SX5. The remaining tasks, before the detector can be closed for the Cosmic Run At Four Tesla (CRAFT), are the installation of the thermal shields, the cabling of the negative endcap, the cabling of the tracker and the beam pipe installation. In addition to these installation tasks, a test closure of the positive endcap is planned just before the installation of the central beam pipe. The schedule is tight and complicated but the goal to close CMS by the end of May for a cosmic test with magnetic field remains feasible. Safety With all large components now being underground, the shortage...

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

  6. Scheduling Agreeable Jobs On A Single Machine To Minimize ...

    African Journals Online (AJOL)

    Journal of Applied Science and Technology ... (NP) scheduling of number of jobs on a single machine to minimize weighted number of early and tardy jobs where the earliest start times and latest due date are agreeable (i.e. earliest start time must increase in the same sequence as latest due dates) has been considered.

  7. Performance analysis of job scheduling policies in parallel supercomputing environments

    Energy Technology Data Exchange (ETDEWEB)

    Naik, V.K.; Squillante, M.S. [IBM T.J. Watson Research Center, Yorktown Heights, NY (United States); Setia, S.K. [George Mason Univ., Fairfax, VA (United States). Dept. of Computer Science

    1993-12-31

    In this paper the authors analyze three general classes of scheduling policies under a workload typical of largescale scientific computing. These policies differ in the manner in which processors are partitioned among the jobs as well as the way in which jobs are prioritized for execution on the partitions. Their results indicate that existing static schemes do not perform well under varying workloads. Adaptive policies tend to make better scheduling decisions, but their ability to adjust to workload changes is limited. Dynamic partitioning policies, on the other hand, yield the best performance and can be tuned to provide desired performance differences among jobs with varying resource demands.

  8. Backfilling with Fairness and Slack for Parallel Job Scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Sodan, Angela C; Wei Jin, E-mail: acsodan@uwindsor.ca [University of Windsor, Computer Science, Windsor, Ontario (Canada)

    2010-11-01

    Parallel job scheduling typically combines a basic policy like FCFS with backfilling, i.e. moving jobs to an earlier than their regular scheduling position if they do not delay the jobs ahead in the queue according to the rules of the backfilling approach applied. Commonly used are conservative and easy backfilling which either have worse response times but better predictability or better response times and poor predictability. The paper proposes a relaxation of conservative backfilling by permitting to shift jobs within certain constraints to backfill more jobs and reduce fragmentation and subsequently obtain better response times. At the same time, deviation from fairness is kept low and predictability remains high. The results of the experimentation evaluation show that the goals are met, with response-time performance lying as expected between conservative and easy backfilling.

  9. Backfilling with Fairness and Slack for Parallel Job Scheduling

    International Nuclear Information System (INIS)

    Sodan, Angela C; Wei Jin

    2010-01-01

    Parallel job scheduling typically combines a basic policy like FCFS with backfilling, i.e. moving jobs to an earlier than their regular scheduling position if they do not delay the jobs ahead in the queue according to the rules of the backfilling approach applied. Commonly used are conservative and easy backfilling which either have worse response times but better predictability or better response times and poor predictability. The paper proposes a relaxation of conservative backfilling by permitting to shift jobs within certain constraints to backfill more jobs and reduce fragmentation and subsequently obtain better response times. At the same time, deviation from fairness is kept low and predictability remains high. The results of the experimentation evaluation show that the goals are met, with response-time performance lying as expected between conservative and easy backfilling.

  10. Scheduling Parallel Jobs Using Migration and Consolidation in the Cloud

    Directory of Open Access Journals (Sweden)

    Xiaocheng Liu

    2012-01-01

    Full Text Available An increasing number of high performance computing parallel applications leverages the power of the cloud for parallel processing. How to schedule the parallel applications to improve the quality of service is the key to the successful host of parallel applications in the cloud. The large scale of the cloud makes the parallel job scheduling more complicated as even simple parallel job scheduling problem is NP-complete. In this paper, we propose a parallel job scheduling algorithm named MEASY. MEASY adopts migration and consolidation to enhance the most popular EASY scheduling algorithm. Our extensive experiments on well-known workloads show that our algorithm takes very good care of the quality of service. For two common parallel job scheduling objectives, our algorithm produces an up to 41.1% and an average of 23.1% improvement on the average response time; an up to 82.9% and an average of 69.3% improvement on the average slowdown. Our algorithm is robust even in terms that it allows inaccurate CPU usage estimation and high migration cost. Our approach involves trivial modification on EASY and requires no additional technique; it is practical and effective in the cloud environment.

  11. Job shop scheduling by simulated annealing

    NARCIS (Netherlands)

    Laarhoven, van P.J.M.; Aarts, E.H.L.; Lenstra, J.K.

    1992-01-01

    We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems. The generalization involves the acceptance of

  12. A multi-criteria model for maintenance job scheduling

    Directory of Open Access Journals (Sweden)

    Sunday A. Oke

    2007-12-01

    Full Text Available This paper presents a multi-criteria maintenance job scheduling model, which is formulated using a weighted multi-criteria integer linear programming maintenance scheduling framework. Three criteria, which have direct relationship with the primary objectives of a typical production setting, were used. These criteria are namely minimization of equipment idle time, manpower idle time and lateness of job with unit parity. The mathematical model constrained by available equipment, manpower and job available time within planning horizon was tested with a 10-job, 8-hour time horizon problem with declared equipment and manpower available as against the required. The results, analysis and illustrations justify multi-criteria consideration. Thus, maintenance managers are equipped with a tool for adequate decision making that guides against error in the accumulated data which may lead to wrong decision making. The idea presented is new since it provides an approach that has not been documented previously in the literature.

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

  14. Online Algorithms for Parallel Job Scheduling and Strip Packing

    NARCIS (Netherlands)

    Hurink, Johann L.; Paulus, J.J.

    We consider the online scheduling problem of parallel jobs on parallel machines, $P|online{−}list,m_j |C_{max}$. For this problem we present a 6.6623-competitive algorithm. This improves the best known 7-competitive algorithm for this problem. The presented algorithm also applies to the problem

  15. No-Wait Job Shop Scheduling, a Constraint Propagation Approach

    NARCIS (Netherlands)

    Lennartz, P.M.

    2006-01-01

    Multi-machine scheduling problems have earned themselves a reputation of intractability. In this thesis we try to solve a special kind of these problems, the so-called no-wait job shop problems. In an instance of this problem-class we are given a number of operations that are to be executed on a

  16. Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter

    Directory of Open Access Journals (Sweden)

    Shyamala Loganathan

    2015-01-01

    Full Text Available Cloud computing is an on-demand computing model, which uses virtualization technology to provide cloud resources to users in the form of virtual machines through internet. Being an adaptable technology, cloud computing is an excellent alternative for organizations for forming their own private cloud. Since the resources are limited in these private clouds maximizing the utilization of resources and giving the guaranteed service for the user are the ultimate goal. For that, efficient scheduling is needed. This research reports on an efficient data structure for resource management and resource scheduling technique in a private cloud environment and discusses a cloud model. The proposed scheduling algorithm considers the types of jobs and the resource availability in its scheduling decision. Finally, we conducted simulations using CloudSim and compared our algorithm with other existing methods, like V-MCT and priority scheduling algorithms.

  17. An improved ant colony optimization algorithm with fault tolerance for job scheduling in grid computing systems.

    Directory of Open Access Journals (Sweden)

    Hajara Idris

    Full Text Available The Grid scheduler, schedules user jobs on the best available resource in terms of resource characteristics by optimizing job execution time. Resource failure in Grid is no longer an exception but a regular occurring event as resources are increasingly being used by the scientific community to solve computationally intensive problems which typically run for days or even months. It is therefore absolutely essential that these long-running applications are able to tolerate failures and avoid re-computations from scratch after resource failure has occurred, to satisfy the user's Quality of Service (QoS requirement. Job Scheduling with Fault Tolerance in Grid Computing using Ant Colony Optimization is proposed to ensure that jobs are executed successfully even when resource failure has occurred. The technique employed in this paper, is the use of resource failure rate, as well as checkpoint-based roll back recovery strategy. Check-pointing aims at reducing the amount of work that is lost upon failure of the system by immediately saving the state of the system. A comparison of the proposed approach with an existing Ant Colony Optimization (ACO algorithm is discussed. The experimental results of the implemented Fault Tolerance scheduling algorithm show that there is an improvement in the user's QoS requirement over the existing ACO algorithm, which has no fault tolerance integrated in it. The performance evaluation of the two algorithms was measured in terms of the three main scheduling performance metrics: makespan, throughput and average turnaround time.

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

    Science.gov (United States)

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

    2016-02-01

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

  19. EFFICIENT MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING

    Institute of Scientific and Technical Information of China (English)

    Lei Deming; Wu Zhiming

    2005-01-01

    A new representation method is first presented based on priority rules. According to this method, each entry in the chromosome indicates that in the procedure of the Giffler and Thompson (GT) algorithm, the conflict occurring in the corresponding machine is resolved by the corresponding priority rule. Then crowding-measure multi-objective evolutionary algorithm (CMOEA) is designed,in which both archive maintenance and fitness assignment use crowding measure. Finally the comparisons between CMOEA and SPEA in solving 15 scheduling problems demonstrate that CMOEA is suitable to job shop scheduling.

  20. Spent nuclear fuel project integrated schedule plan

    International Nuclear Information System (INIS)

    Squires, K.G.

    1995-01-01

    The Spent Nuclear Fuel Integrated Schedule Plan establishes the organizational responsibilities, rules for developing, maintain and status of the SNF integrated schedule, and an implementation plan for the integrated schedule. The mission of the SNFP on the Hanford site is to provide safe, economic, environmentally sound management of Hanford SNF in a manner which stages it to final disposition. This particularly involves K Basin fuel

  1. Spent nuclear fuel project integrated schedule plan

    Energy Technology Data Exchange (ETDEWEB)

    Squires, K.G.

    1995-03-06

    The Spent Nuclear Fuel Integrated Schedule Plan establishes the organizational responsibilities, rules for developing, maintain and status of the SNF integrated schedule, and an implementation plan for the integrated schedule. The mission of the SNFP on the Hanford site is to provide safe, economic, environmentally sound management of Hanford SNF in a manner which stages it to final disposition. This particularly involves K Basin fuel.

  2. Overlap Algorithms in Flexible Job-shop Scheduling

    Directory of Open Access Journals (Sweden)

    Celia Gutierrez

    2014-06-01

    Full Text Available The flexible Job-shop Scheduling Problem (fJSP considers the execution of jobs by a set of candidate resources while satisfying time and technological constraints. This work, that follows the hierarchical architecture, is based on an algorithm where each objective (resource allocation, start-time assignment is solved by a genetic algorithm (GA that optimizes a particular fitness function, and enhances the results by the execution of a set of heuristics that evaluate and repair each scheduling constraint on each operation. The aim of this work is to analyze the impact of some algorithmic features of the overlap constraint heuristics, in order to achieve the objectives at a highest degree. To demonstrate the efficiency of this approach, experimentation has been performed and compared with similar cases, tuning the GA parameters correctly.

  3. Scheduling Non-Preemptible Jobs to Minimize Peak Demand

    Directory of Open Access Journals (Sweden)

    Sean Yaw

    2017-10-01

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

  4. Application of Tabu Search Algorithm in Job Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Betrianis Betrianis

    2010-10-01

    Full Text Available Tabu Search is one of local search methods which is used to solve the combinatorial optimization problem. This method aimed is to make the searching process of the best solution in a complex combinatorial optimization problem(np hard, ex : job shop scheduling problem, became more effective, in a less computational time but with no guarantee to optimum solution.In this paper, tabu search is used to solve the job shop scheduling problem consists of 3 (three cases, which is ordering package of September, October and November with objective of minimizing makespan (Cmax. For each ordering package, there is a combination for initial solution and tabu list length. These result then  compared with 4 (four other methods using basic dispatching rules such as Shortest Processing Time (SPT, Earliest Due Date (EDD, Most Work Remaining (MWKR dan First Come First Served (FCFS. Scheduling used Tabu Search Algorithm is sensitive for variables changes and gives makespan shorter than scheduling used by other four methods.

  5. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction Since the lowering of YB0 in February, less spectacular but nonetheless crucial progress has been made along the critical path to CMS completion. The YB0 has been aligned with the beamline to a fraction of a mm, and the HCAL has been fully installed. Cabling scaffolding for YB0 services has been built and one half (-z end) of the ECAL barrel has been installed. The YB0 services installation has begun, with two of the major technical challenges delaying bulk installation, namely PP1 detailed design, manufacture and installation plus Tracker cooling pipe insulation, now apparently solved. Significant difficulties in detailed design, integration and procurement of cable ducts remain. Despite this, the design of the +end is close to complete, and Tracker power cable installation on two sectors of the +end is well advanced. A new master schedule, v36.0, is being prepared to account for the updated actual situation at point 5 and for the revised LHC machine planning. Safety The enormous amount of...

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

  7. Integrated test schedule for buried waste integrated demonstration

    International Nuclear Information System (INIS)

    Brown, J.T.; McDonald, J.K.

    1992-05-01

    The Integrated Test Schedule incorporates the various schedules the Buried Waste Integrated Demonstration (BWID) supports into one document. This document contains the Federal Facilities Agreement and Consent Order schedules for the Idaho National Engineering Laboratory, Hanford Reservation, Oak Ridge Reservation, and Fernald Environmental Materials Center. Included in the Integrated Test Schedule is the Buried Waste Integrated Demonstration ''windows of opportunity'' schedule. The ''windows of opportunity'' schedule shows periods of time in which Buried Waste Integrated Demonstration Program-sponsored technology demonstrations could support key decisions in the Federal Facilities Agreement and Consent Order. Schedules for the Buried Waste Integrated Demonstration-sponsored technology task plans are categorized by technology area and divided by current fiscal year and out-year. Total estimated costs for Buried Waste Integrated Demonstration-sponsored Technology Task Plans for FY-92 through FY-97 are $74.756M

  8. Multi-objective group scheduling optimization integrated with preventive maintenance

    Science.gov (United States)

    Liao, Wenzhu; Zhang, Xiufang; Jiang, Min

    2017-11-01

    This article proposes a single-machine-based integration model to meet the requirements of production scheduling and preventive maintenance in group production. To describe the production for identical/similar and different jobs, this integrated model considers the learning and forgetting effects. Based on machine degradation, the deterioration effect is also considered. Moreover, perfect maintenance and minimal repair are adopted in this integrated model. The multi-objective of minimizing total completion time and maintenance cost is taken to meet the dual requirements of delivery date and cost. Finally, a genetic algorithm is developed to solve this optimization model, and the computation results demonstrate that this integrated model is effective and reliable.

  9. Multiagent scheduling method with earliness and tardiness objectives in flexible job shops.

    Science.gov (United States)

    Wu, Zuobao; Weng, Michael X

    2005-04-01

    Flexible job-shop scheduling problems are an important extension of the classical job-shop scheduling problems and present additional complexity. Such problems are mainly due to the existence of a considerable amount of overlapping capacities with modern machines. Classical scheduling methods are generally incapable of addressing such capacity overlapping. We propose a multiagent scheduling method with job earliness and tardiness objectives in a flexible job-shop environment. The earliness and tardiness objectives are consistent with the just-in-time production philosophy which has attracted significant attention in both industry and academic community. A new job-routing and sequencing mechanism is proposed. In this mechanism, two kinds of jobs are defined to distinguish jobs with one operation left from jobs with more than one operation left. Different criteria are proposed to route these two kinds of jobs. Job sequencing enables to hold a job that may be completed too early. Two heuristic algorithms for job sequencing are developed to deal with these two kinds of jobs. The computational experiments show that the proposed multiagent scheduling method significantly outperforms the existing scheduling methods in the literature. In addition, the proposed method is quite fast. In fact, the simulation time to find a complete schedule with over 2000 jobs on ten machines is less than 1.5 min.

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

  11. Designing an advanced available-to-promise mechanism compatible with the make-to-forecast production systems through integrating inventory allocation and job shop scheduling with due dates and weighted earliness/tardiness cost

    Directory of Open Access Journals (Sweden)

    Masoud Rabbani

    2016-06-01

    Full Text Available In the competitive business world, applying a reliable and powerful mechanism to support decision makers in manufacturing companies and helping them save time by considering varieties of effective factors is an inevitable issue. Advanced Available-to-Promise is a perfect tool to design and perform such a mechanism. In this study, this mechanism which is compatible with the Make-to-Forecast production systems is presented. The ability to distinguish between batch mode and real-time mode advanced available-to-promise is one of the unique superiorities of the proposed model. We also try to strengthen this mechanism by integrating the inventory allocation and job shop scheduling by considering due dates and weighted earliness/tardiness cost that leads to more precise decisions. A mixed integer programming (MIP model and a heuristic algorithm according to its disability to solve large size problems are presented. The designed experiments and the obtained results have proved the efficiency of the proposed heuristic method.

  12. A neural network approach to job-shop scheduling.

    Science.gov (United States)

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

    1991-01-01

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

  13. Fog computing job scheduling optimization based on bees swarm

    Science.gov (United States)

    Bitam, Salim; Zeadally, Sherali; Mellouk, Abdelhamid

    2018-04-01

    Fog computing is a new computing architecture, composed of a set of near-user edge devices called fog nodes, which collaborate together in order to perform computational services such as running applications, storing an important amount of data, and transmitting messages. Fog computing extends cloud computing by deploying digital resources at the premise of mobile users. In this new paradigm, management and operating functions, such as job scheduling aim at providing high-performance, cost-effective services requested by mobile users and executed by fog nodes. We propose a new bio-inspired optimization approach called Bees Life Algorithm (BLA) aimed at addressing the job scheduling problem in the fog computing environment. Our proposed approach is based on the optimized distribution of a set of tasks among all the fog computing nodes. The objective is to find an optimal tradeoff between CPU execution time and allocated memory required by fog computing services established by mobile users. Our empirical performance evaluation results demonstrate that the proposal outperforms the traditional particle swarm optimization and genetic algorithm in terms of CPU execution time and allocated memory.

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

  15. Emergency Radiology Practice Patterns: Shifts, Schedules, and Job Satisfaction.

    Science.gov (United States)

    Hanna, Tarek N; Shekhani, Haris; Lamoureux, Christine; Mar, Hanna; Nicola, Refky; Sliker, Clint; Johnson, Jamlik-Omari

    2017-03-01

    To assess the practice environment of emergency radiologists with a focus on schedule, job satisfaction, and self-perception of health, wellness, and diagnostic accuracy. A survey drawing from prior radiology and health care shift-work literature was distributed via e-mail to national societies, teleradiology groups, and private practices. The survey remained open for 4 weeks in 2016, with one reminder. Data were analyzed using hypothesis testing and logistic regression modeling. Response rate was 29.6% (327/1106); 69.1% of respondents (n = 226) were greater than 40 years old, 73% (n = 240) were male, and 87% (n = 284) practiced full time. With regard to annual overnight shifts (NS): 36% (n = 118) did none, 24.9% (n = 81) did 182 or more, and 15.6% (n = 51) did 119. There was a significant association between average NS worked per year and both perceived negative health effects (P impact on memory (P job enjoyment and number of annual NS (P job" for radiologists who work no NS is 2.21 times greater than for radiologists who work at least 119 NS, when shift length is held constant. Radiologists with 11+ years of experience who work no NS or 1 to 100 NS annually have lower odds of feeling overwhelmed when compared with those working the same number of NS with job satisfaction and negative health self-perception. Copyright © 2016 American College of Radiology. Published by Elsevier Inc. All rights reserved.

  16. Single-machine scheduling of proportionally deteriorating jobs by two agents

    OpenAIRE

    S Gawiejnowicz; W-C Lee; C-L Lin; C-C Wu

    2011-01-01

    We consider a problem of scheduling a set of independent jobs by two agents on a single machine. Every agent has its own subset of jobs to be scheduled and uses its own optimality criterion. The processing time of each job proportionally deteriorates with respect to the starting time of the job. The problem is to find a schedule that minimizes the total tardiness of the first agent, provided that no tardy job is allowed for the second agent. We prove basic properties of the problem and give a...

  17. Planning construction of integrative schedule management for nuclear power project

    International Nuclear Information System (INIS)

    Zeng Zhenglin; Wang Wenying; Peng Fei

    2012-01-01

    This paper introduces the planning construction of integrative schedule management for Nuclear Power Project. It details schedule management system and the requirement of schedulers and the mode of three schedule management flats. And analysis it combing with the implementation of construction water and all special schedules before FCD to further propose the improving and researching direction for the integrative schedule management. (authors)

  18. Review of job shop scheduling research and its new perspectives under Industry 4.0

    OpenAIRE

    Zhang, Jian; Ding, Guofu; Zou, Yisheng; Qin, Sheng-feng; Fu, Jianlin

    2017-01-01

    Traditional job shop scheduling is concentrated on centralized scheduling or semi-distributed scheduling. Under the Industry 4.0, the scheduling should deal with a smart and distributed manufacturing system supported by novel and emerging manufacturing technologies such as mass customization, Cyber-Physics Systems, Digital Twin, and SMAC (Social, Mobile, Analytics, Cloud). The scheduling research needs to shift its focus to smart distributed scheduling modeling and optimization. In order to t...

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

  20. Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs

    Directory of Open Access Journals (Sweden)

    Long Wan

    2015-01-01

    Full Text Available This paper investigates a single-machine two-agent scheduling problem to minimize the maximum costs with position-dependent jobs. There are two agents, each with a set of independent jobs, competing to perform their jobs on a common machine. In our scheduling setting, the actual position-dependent processing time of one job is characterized by variable function dependent on the position of the job in the sequence. Each agent wants to fulfil the objective of minimizing the maximum cost of its own jobs. We develop a feasible method to achieve all the Pareto optimal points in polynomial time.

  1. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction and Schedule After nearly seven months of concentrated effort, the installation of services on YB0 moved off the CMS critical path in late November. In line with v36 planning provisions, the additional time needed to finish this challeng¬ing task was accommodated by reducing sequential dependencies between assembly tasks, putting more tasks (especially heavy logistic movements) in parallel with activities on, or within, the central wheel. Thus the lowering of wheels YB-1 and YB -2 and of disk YE-3 is already complete, the latter made possible, in the shadow of YB0 work, by inverting the order of the 3 endcap disks in the surface building. Weather conditions permitting, the Tracker will be transported to point 5 during CMS week for insertion in EB before CERN closes. The lowering of the last two disks will take place mid- and end-of January, respectively. Thus central beampipe installation can be confidently planned to start in February as foreseen, allowing closure of CMS in time for CRA...

  2. TECHNICAL COORDINATION, SCHEDULE AND INTEGRATION

    CERN Multimedia

    A. Ball

    Introduction Despite the holiday season affecting available manpower, many key internal milestones have been passed over the summer, thanks to the dedication and commitment of the team at point 5. In particular, the installation on, and within, YB0 has progressed steadily through several potentially difficult phases. The v36 planning contingency of lowering YB-1 and YB-1 wheels on schedule in October, before Tracker installation, will be executed in order to give more time to complete YB0 services work, whilst still being consistent with completion of heavy lowering by the end of 2007. Safety In the underground areas the peak level of activity and parallel work has been reached and this will continue for the coming months. Utmost vigilance is required of everybody working underground and this must be maintained. However, it is encouraging to note that the compliance with safety rules is, in general, good. More and more work will be carried out from scaffolding and mobile access platforms. (cherry-picke...

  3. A tabu search algorithm for scheduling a single robot in a job-shop environment

    NARCIS (Netherlands)

    Hurink, Johann L.; Knust, S.

    1999-01-01

    We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot. The robot scheduling problem may be regarded as a generalization of the travelling-salesman problem with time

  4. A tabu search algorithm for scheduling a single robot in a job-shop environment

    NARCIS (Netherlands)

    Hurink, Johann L.; Knust, Sigrid

    2002-01-01

    We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot. The robot scheduling problem may be regarded as a generalization of the travelling-salesman problem with time

  5. On-line scheduling on a single machine : maximizing the number of early jobs

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Potts, C.N.; Woeginger, G.J.

    2000-01-01

    This note deals with the scheduling problem of maximizing the number of early jobs on a single machine. We investigate the on-line version of this problem in the Preemption-Restart model. This means that jobs may be preempted, but preempting results in all the work done on this job so far being

  6. On-line scheduling of two-machine open shops where jobs arrive over time

    NARCIS (Netherlands)

    Chen, B.; Vestjens, A.P.A.; Woeginger, G.J.

    1998-01-01

    We investigate the problem of on-line scheduling two-machine open shops with the objective of minimizing the makespan.Jobs arrive independently over time, and the existence of a job is not known until its arrival. In the clairvoyant on-line model, the processing requirement of every job becomes

  7. A genetic algorithm-based job scheduling model for big data analytics.

    Science.gov (United States)

    Lu, Qinghua; Li, Shanshan; Zhang, Weishan; Zhang, Lei

    Big data analytics (BDA) applications are a new category of software applications that process large amounts of data using scalable parallel processing infrastructure to obtain hidden value. Hadoop is the most mature open-source big data analytics framework, which implements the MapReduce programming model to process big data with MapReduce jobs. Big data analytics jobs are often continuous and not mutually separated. The existing work mainly focuses on executing jobs in sequence, which are often inefficient and consume high energy. In this paper, we propose a genetic algorithm-based job scheduling model for big data analytics applications to improve the efficiency of big data analytics. To implement the job scheduling model, we leverage an estimation module to predict the performance of clusters when executing analytics jobs. We have evaluated the proposed job scheduling model in terms of feasibility and accuracy.

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

  9. Parallelization and scheduling of data intensive particle physics analysis jobs on clusters of PCs

    CERN Document Server

    Ponce, S

    2004-01-01

    Summary form only given. Scheduling policies are proposed for parallelizing data intensive particle physics analysis applications on computer clusters. Particle physics analysis jobs require the analysis of tens of thousands of particle collision events, each event requiring typically 200ms processing time and 600KB of data. Many jobs are launched concurrently by a large number of physicists. At a first view, particle physics jobs seem to be easy to parallelize, since particle collision events can be processed independently one from another. However, since large amounts of data need to be accessed, the real challenge resides in making an efficient use of the underlying computing resources. We propose several job parallelization and scheduling policies aiming at reducing job processing times and at increasing the sustainable load of a cluster server. Since particle collision events are usually reused by several jobs, cache based job splitting strategies considerably increase cluster utilization and reduce job ...

  10. Job schedulers for Big data processing in Hadoop environment: testing real-life schedulers using benchmark programs

    Directory of Open Access Journals (Sweden)

    Mohd Usama

    2017-11-01

    Full Text Available At present, big data is very popular, because it has proved to be much successful in many fields such as social media, E-commerce transactions, etc. Big data describes the tools and technologies needed to capture, manage, store, distribute, and analyze petabyte or larger-sized datasets having different structures with high speed. Big data can be structured, unstructured, or semi structured. Hadoop is an open source framework that is used to process large amounts of data in an inexpensive and efficient way, and job scheduling is a key factor for achieving high performance in big data processing. This paper gives an overview of big data and highlights the problems and challenges in big data. It then highlights Hadoop Distributed File System (HDFS, Hadoop MapReduce, and various parameters that affect the performance of job scheduling algorithms in big data such as Job Tracker, Task Tracker, Name Node, Data Node, etc. The primary purpose of this paper is to present a comparative study of job scheduling algorithms along with their experimental results in Hadoop environment. In addition, this paper describes the advantages, disadvantages, features, and drawbacks of various Hadoop job schedulers such as FIFO, Fair, capacity, Deadline Constraints, Delay, LATE, Resource Aware, etc, and provides a comparative study among these schedulers.

  11. Simultaneous Scheduling of Jobs, AGVs and Tools Considering Tool Transfer Times in Multi Machine FMS By SOS Algorithm

    Science.gov (United States)

    Sivarami Reddy, N.; Ramamurthy, D. V., Dr.; Prahlada Rao, K., Dr.

    2017-08-01

    This article addresses simultaneous scheduling of machines, AGVs and tools where machines are allowed to share the tools considering transfer times of jobs and tools between machines, to generate best optimal sequences that minimize makespan in a multi-machine Flexible Manufacturing System (FMS). Performance of FMS is expected to improve by effective utilization of its resources, by proper integration and synchronization of their scheduling. Symbiotic Organisms Search (SOS) algorithm is a potent tool which is a better alternative for solving optimization problems like scheduling and proven itself. The proposed SOS algorithm is tested on 22 job sets with makespan as objective for scheduling of machines and tools where machines are allowed to share tools without considering transfer times of jobs and tools and the results are compared with the results of existing methods. The results show that the SOS has outperformed. The same SOS algorithm is used for simultaneous scheduling of machines, AGVs and tools where machines are allowed to share tools considering transfer times of jobs and tools to determine the best optimal sequences that minimize makespan.

  12. Collectives for Multiple Resource Job Scheduling Across Heterogeneous Servers

    Science.gov (United States)

    Tumer, K.; Lawson, J.

    2003-01-01

    Efficient management of large-scale, distributed data storage and processing systems is a major challenge for many computational applications. Many of these systems are characterized by multi-resource tasks processed across a heterogeneous network. Conventional approaches, such as load balancing, work well for centralized, single resource problems, but breakdown in the more general case. In addition, most approaches are often based on heuristics which do not directly attempt to optimize the world utility. In this paper, we propose an agent based control system using the theory of collectives. We configure the servers of our network with agents who make local job scheduling decisions. These decisions are based on local goals which are constructed to be aligned with the objective of optimizing the overall efficiency of the system. We demonstrate that multi-agent systems in which all the agents attempt to optimize the same global utility function (team game) only marginally outperform conventional load balancing. On the other hand, agents configured using collectives outperform both team games and load balancing (by up to four times for the latter), despite their distributed nature and their limited access to information.

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

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

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

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

    Science.gov (United States)

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

    2017-12-01

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

  17. Minimizing tardiness for job shop scheduling under uncertainties

    OpenAIRE

    Yahouni , Zakaria; Mebarki , Nasser; Sari , Zaki

    2016-01-01

    International audience; —Many disturbances can occur during the execution of a manufacturing scheduling process. To cope with this drawback , flexible solutions are proposed based on the offline and the online phase of the schedule. Groups of permutable operations is one of the most studied flexible scheduling methods bringing flexibility as well as quality to a schedule. The online phase of this method is based on a human-machine system allowing to choose in real-time one schedule from a set...

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

  19. Genetic algorithm and neural network hybrid approach for job-shop scheduling

    OpenAIRE

    Zhao, Kai; Yang, Shengxiang; Wang, Dingwei

    1998-01-01

    Copyright @ 1998 ACTA Press This paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems. In the hybrid approach, GA is used to iterate for searching optimal solutions, CSANN is used to obtain feasible solutions during the iteration of genetic algorithm. Simulations have shown the valid performance of the proposed hybrid approach for job-shop scheduling with respect to the quality of solutions and ...

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

    Science.gov (United States)

    1993-09-01

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

  1. Manufacturing scheduling systems an integrated view on models, methods and tools

    CERN Document Server

    Framinan, Jose M; Ruiz García, Rubén

    2014-01-01

    The book is devoted to the problem of manufacturing scheduling, which is the efficient allocation of jobs (orders) over machines (resources) in a manufacturing facility. It offers a comprehensive and integrated perspective on the different aspects required to design and implement systems to efficiently and effectively support manufacturing scheduling decisions. Obtaining economic and reliable schedules constitutes the core of excellence in customer service and efficiency in manufacturing operations. Therefore, scheduling forms an area of vital importance for competition in manufacturing companies. However, only a fraction of scheduling research has been translated into practice, due to several reasons. First, the inherent complexity of scheduling has led to an excessively fragmented field in which different sub problems and issues are treated in an independent manner as goals themselves, therefore lacking a unifying view of the scheduling problem. Furthermore, mathematical brilliance and elegance has sometime...

  2. One-machine job-scheduling with non-constant capacity - Minimizing weighted completion times

    NARCIS (Netherlands)

    Amaddeo, H.F.; Amaddeo, H.F.; Nawijn, W.M.; van Harten, Aart

    1997-01-01

    In this paper an n-job one-machine scheduling problem is considered, in which the machine capacity is time-dependent and jobs are characterized by their work content. The objective is to minimize the sum of weighted completion times. A necessary optimality condition is presented and we discuss some

  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. Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource

    Directory of Open Access Journals (Sweden)

    Różycki Rafał

    2016-09-01

    Full Text Available In this work we consider a problem of scheduling preemptable, independent jobs, characterized by the fact that their processing speeds depend on the amounts of a continuous, renewable resource allocated to jobs at a time. Jobs are scheduled on parallel, identical machines, with the criterion of minimization of the schedule length. Since two categories of resources occur in the problem: discrete (set of machines and continuous, it is generally called a discrete-continuous scheduling problem. The model studied in this paper allows the total available amount of the continuous resource to vary over time, which is a practically important generalization that has not been considered yet for discrete-continuous scheduling problems. For this model we give some properties of optimal schedules on a basis of which we propose a general methodology for solving the considered class of problems. The methodology uses a two-phase approach in which, firstly, an assignment of machines to jobs is defined and, secondly, for this assignment an optimal continuous resource allocation is found by solving an appropriate mathematical programming problem. In the approach various cases are considered, following from assumptions made on the form of the processing speed functions of jobs. For each case an iterative algorithm is designed, leading to an optimal solution in a finite number of steps.

  5. Selection and scheduling of jobs with time-dependent duration

    African Journals Online (AJOL)

    †Department of Logistics, University of Stellenbosch, Private Bag X1, ... station must apply to occupy the test station and sometimes may even choose ... are considered where the job duration and cost are dependent on the time and sequence.

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

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

  8. Preventive maintenance optimization for a multi-component system under changing job shop schedule

    International Nuclear Information System (INIS)

    Zhou Xiaojun; Lu Zhiqiang; Xi Lifeng

    2012-01-01

    Variability and small lot size is a common feature for many discrete manufacturing processes designed to meet a wide array of customer needs. Because of this, job shop schedule often has to be continuously updated in reaction to changes in production plan. Generally, the aim of preventive maintenance is to ensure production effectiveness and therefore the preventive maintenance models must have the ability to be adaptive to changes in job shop schedule. In this paper, a dynamic opportunistic preventive maintenance model is developed for a multi-component system with considering changes in job shop schedule. Whenever a job is completed, preventive maintenance opportunities arise for all the components in the system. An optimal maintenance practice is dynamically determined by maximizing the short-term cumulative opportunistic maintenance cost savings for the system. The numerical example shows that the scheme obtained by the proposed model can effectively address the preventive maintenance scheduling problem caused by the changes in job shop schedule and is more efficient than the ones based on two other commonly used preventive maintenance models.

  9. Decentralized Job Scheduling in the Cloud Based on a Spatially Generalized Prisoner’s Dilemma Game

    Directory of Open Access Journals (Sweden)

    Gąsior Jakub

    2015-12-01

    Full Text Available We present in this paper a novel distributed solution to a security-aware job scheduling problem in cloud computing infrastructures. We assume that the assignment of the available resources is governed exclusively by the specialized brokers assigned to individual users submitting their jobs to the system. The goal of this scheme is allocating a limited quantity of resources to a specific number of jobs minimizing their execution failure probability and total completion time. Our approach is based on the Pareto dominance relationship and implemented at an individual user level. To select the best scheduling strategies from the resulting Pareto frontiers and construct a global scheduling solution, we developed a decision-making mechanism based on the game-theoretic model of Spatial Prisoner’s Dilemma, realized by selfish agents operating in the two-dimensional cellular automata space. Their behavior is conditioned by the objectives of the various entities involved in the scheduling process and driven towards a Nash equilibrium solution by the employed social welfare criteria. The performance of the scheduler applied is verified by a number of numerical experiments. The related results show the effectiveness and scalability of the scheme in the presence of a large number of jobs and resources involved in the scheduling process.

  10. GLOA: A New Job Scheduling Algorithm for Grid Computing

    Directory of Open Access Journals (Sweden)

    Zahra Pooranian

    2013-03-01

    Full Text Available The purpose of grid computing is to produce a virtual supercomputer by using free resources available through widespread networks such as the Internet. This resource distribution, changes in resource availability, and an unreliable communication infrastructure pose a major challenge for efficient resource allocation. Because of the geographical spread of resources and their distributed management, grid scheduling is considered to be a NP-complete problem. It has been shown that evolutionary algorithms offer good performance for grid scheduling. This article uses a new evaluation (distributed algorithm inspired by the effect of leaders in social groups, the group leaders' optimization algorithm (GLOA, to solve the problem of scheduling independent tasks in a grid computing system. Simulation results comparing GLOA with several other evaluation algorithms show that GLOA produces shorter makespans.

  11. Cultural-Based Genetic Tabu Algorithm for Multiobjective Job Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Yuzhen Yang

    2014-01-01

    Full Text Available The job shop scheduling problem, which has been dealt with by various traditional optimization methods over the decades, has proved to be an NP-hard problem and difficult in solving, especially in the multiobjective field. In this paper, we have proposed a novel quadspace cultural genetic tabu algorithm (QSCGTA to solve such problem. This algorithm provides a different structure from the original cultural algorithm in containing double brief spaces and population spaces. These spaces deal with different levels of populations globally and locally by applying genetic and tabu searches separately and exchange information regularly to make the process more effective towards promising areas, along with modified multiobjective domination and transform functions. Moreover, we have presented a bidirectional shifting for the decoding process of job shop scheduling. The computational results we presented significantly prove the effectiveness and efficiency of the cultural-based genetic tabu algorithm for the multiobjective job shop scheduling problem.

  12. Data location-aware job scheduling in the grid. Application to the GridWay metascheduler

    International Nuclear Information System (INIS)

    Delgado Peris, Antonio; Hernandez, Jose; Huedo, Eduardo; Llorente, Ignacio M

    2010-01-01

    Grid infrastructures constitute nowadays the core of the computing facilities of the biggest LHC experiments. These experiments produce and manage petabytes of data per year and run thousands of computing jobs every day to process that data. It is the duty of metaschedulers to allocate the tasks to the most appropriate resources at the proper time. Our work reviews the policies that have been proposed for the scheduling of grid jobs in the context of very data-intensive applications. We indicate some of the practical problems that such models will face and describe what we consider essential characteristics of an optimum scheduling system: aim to minimise not only job turnaround time but also data replication, flexibility to support different virtual organisation requirements and capability to coordinate the tasks of data placement and job allocation while keeping their execution decoupled. These ideas have guided the development of an enhanced prototype for GridWay, a general purpose metascheduler, part of the Globus Toolkit and member of the EGEE's RESPECT program. Current GridWay's scheduling algorithm is unaware of data location. Our prototype makes it possible for job requests to set data needs not only as absolute requirements but also as functions for resource ranking. As our tests show, this makes it more flexible than currently used resource brokers to implement different data-aware scheduling algorithms.

  13. Multiobjective Variable Neighborhood Search algorithm for scheduling independent jobs on computational grid

    Directory of Open Access Journals (Sweden)

    S. Selvi

    2015-07-01

    Full Text Available Grid computing solves high performance and high-throughput computing problems through sharing resources ranging from personal computers to super computers distributed around the world. As the grid environments facilitate distributed computation, the scheduling of grid jobs has become an important issue. In this paper, an investigation on implementing Multiobjective Variable Neighborhood Search (MVNS algorithm for scheduling independent jobs on computational grid is carried out. The performance of the proposed algorithm has been evaluated with Min–Min algorithm, Simulated Annealing (SA and Greedy Randomized Adaptive Search Procedure (GRASP algorithm. Simulation results show that MVNS algorithm generally performs better than other metaheuristics methods.

  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. A controlled genetic algorithm by fuzzy logic and belief functions for job-shop scheduling.

    Science.gov (United States)

    Hajri, S; Liouane, N; Hammadi, S; Borne, P

    2000-01-01

    Most scheduling problems are highly complex combinatorial problems. However, stochastic methods such as genetic algorithm yield good solutions. In this paper, we present a controlled genetic algorithm (CGA) based on fuzzy logic and belief functions to solve job-shop scheduling problems. For better performance, we propose an efficient representational scheme, heuristic rules for creating the initial population, and a new methodology for mixing and computing genetic operator probabilities.

  17. Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

    Science.gov (United States)

    Zelinski, Shannon; Windhorst, Robert

    2016-01-01

    A departure metering concept to be demonstrated at Charlotte Douglas International Airport (CLT) will integrate strategic and tactical surface scheduling components to enable the respective collaborative decision making and improved efficiency benefits these two methods of scheduling provide. This study analyzes the effect of tactical scheduling on strategic scheduler predictability. Strategic queue predictions and target gate pushback times to achieve a desired queue length are compared between fast time simulations of CLT surface operations with and without tactical scheduling. The use of variable departure rates as a strategic scheduler input was shown to substantially improve queue predictions over static departure rates. With target queue length calibration, the strategic scheduler can be tuned to produce average delays within one minute of the tactical scheduler. However, root mean square differences between strategic and tactical delays were between 12 and 15 minutes due to the different methods the strategic and tactical schedulers use to predict takeoff times and generate gate pushback clearances. This demonstrates how difficult it is for the strategic scheduler to predict tactical scheduler assigned gate delays on an individual flight basis as the tactical scheduler adjusts departure sequence to accommodate arrival interactions. Strategic/tactical scheduler compatibility may be improved by providing more arrival information to the strategic scheduler and stabilizing tactical scheduler changes to runway sequence in response to arrivals.

  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. Integrated multi-resource planning and scheduling in engineering project

    Directory of Open Access Journals (Sweden)

    Samer Ben Issa

    2017-01-01

    Full Text Available Planning and scheduling processes in project management are carried out sequentially in prac-tice, i.e. planning project activities first without visibility of resource limitation, and then schedul-ing the project according to these pre-planned activities. This is a need to integrate these two pro-cesses. In this paper, we use Branch and Bound approach for generating all the feasible and non-feasible project schedules with/without activity splitting, and with a new criterion called “the Minimum Moments of Resources Required around X-Y axes (MMORR”, we select the best feasible project schedule to integrate plan processing and schedule processing for engineering projects. The results illustrate that this integrated approach can effectively select the best feasible project schedule among alternatives, improves the resource utilization, and shortens the project lead time.

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

  2. Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

    NARCIS (Netherlands)

    Fishkin, A.V.; Jansen, K.; Sevastyanov, S.V.; Sitters, R.A.; Leonardi, S.

    2005-01-01

    We present hardness and approximation results for the problem of scheduling n independent jobs on m identical parallel machines subject to a migration delay d so as to minimize the makespan. We give a sharp threshold on the value of d for which the complexity of the problem changes from polynomial

  3. Sequencing, lot sizing and scheduling in job shops: the common cycle approach

    NARCIS (Netherlands)

    Ouenniche, J.; Boctor, F.F.

    1998-01-01

    This paper deals with the multi-product, finite horizon, static demand, sequencing, lot sizing and scheduling problem in a job shop environment where the objective is to minimize the sum of setup and inventory holding costs while satisfying the demand with no backlogging. To solve this problem, we

  4. Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

    NARCIS (Netherlands)

    Sevastyanov, S. V.; Sitters, R. A.; Fishkin, A.V.

    2010-01-01

    We present hardness and approximation results for the problem of preemptive scheduling of n independent jobs on m identical parallel machines subject to a migration delay d with the objective to minimize the makespan. We give a sharp threshold on the value of d for which the complexity of the

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

  6. Flexible job-shop scheduling based on genetic algorithm and simulation validation

    Directory of Open Access Journals (Sweden)

    Zhou Erming

    2017-01-01

    Full Text Available This paper selects flexible job-shop scheduling problem as the research object, and Constructs mathematical model aimed at minimizing the maximum makespan. Taking the transmission reverse gear production line of a transmission corporation as an example, genetic algorithm is applied for flexible jobshop scheduling problem to get the specific optimal scheduling results with MATLAB. DELMIA/QUEST based on 3D discrete event simulation is applied to construct the physical model of the production workshop. On the basis of the optimal scheduling results, the logical link of the physical model for the production workshop is established, besides, importing the appropriate process parameters to make virtual simulation on the production workshop. Finally, through analyzing the simulated results, it shows that the scheduling results are effective and reasonable.

  7. Job Characteristics and Pressures and the Organizational Integration of Professionals

    Science.gov (United States)

    Hall, Douglas T.; Lawler, Edward E.

    1970-01-01

    Focuses on the relationship between job design and the integration of the professional with his organization; the concept of job pressures is used as an intervening variable in the study of his relationship. (Author)

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

  9. JOB SHOP SCHEDULING BIOBJETIVO MEDIANTE ENFRIAMIENTO SIMULADO Y ENFOQUE DE PARETO JOB-SHOP SCHEDULING: BIO-OBJECTIVE THROUGH SIMULATED COOLING AND PARETO PRINCIPLE

    Directory of Open Access Journals (Sweden)

    Juan Carlos Osorio

    2012-12-01

    Full Text Available El problema del scheduling es uno de los problemas más ampliamente tratados en la literatura; sin embargo, es un problema complejo NP hard. Cuando, además, se involucra más de un objetivo, este problema se convierte en uno de los más complejos en el campo de la investigación de operaciones. Se presenta entonces un modelo biobjetivo para el job shop scheduling que incluye el makespan y el tiempo de flujo medio. Para resolver el modelo se ha utilizado una propuesta que incluye el uso del meta-heurístico Recocido Simulado (SA y el enfoque de Pareto. Este modelo es evaluado en tres problemas presentados en la literatura de tamaños 6x6, 10x5 y 10x10. Los resultados del modelo se comparan con otros meta-heurísticos y se encuentra que este modelo presenta buenos resultados en los tres problemas evaluados.The scheduling problem is one of the most widely treated problems in literature; however, it is an NP hard complex problem. Also, when more than one objective is involved, this problem becomes one of the most complex ones in the field of operations research. A bio-objective model is then emerged for the Job-Shop Scheduling, including makespan and mean flow time. For solving the model a proposal which includes the use of Simulated Annealing (SA metaheuristic and Pareto Principle. This model is evaluated in three problems described in literature with the following sizes: 6x6, 10x5 and 10x10. Results of the model are compared to other metaheuristics and it has been found that this model shows good results in the three problems evaluated.

  10. Integrating Preventive Maintenance Scheduling As Probability Machine Failure And Batch Production Scheduling

    Directory of Open Access Journals (Sweden)

    Zahedi Zahedi

    2016-06-01

    Full Text Available This paper discusses integrated model of batch production scheduling and machine maintenance scheduling. Batch production scheduling uses minimize total actual flow time criteria and machine maintenance scheduling uses the probability of machine failure based on Weibull distribution. The model assumed no nonconforming parts in a planning horizon. The model shows an increase in the number of the batch (length of production run up to a certain limit will minimize the total actual flow time. Meanwhile, an increase in the length of production run will implicate an increase in the number of PM. An example was given to show how the model and algorithm work.

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

    Science.gov (United States)

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

    2017-05-01

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

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

  13. An Evaluation of Parallel Job Scheduling for ASCI Blue-Pacific

    International Nuclear Information System (INIS)

    Franke, H.; Jann, J.; Moreira, J.; Pattnaik, P.; Jette, M.

    1999-01-01

    In this paper we analyze the behavior of a gang-scheduling strategy that we are developing for the ASCI Blue-Pacific machines. Using actual job logs for one of the ASCI machines we generate a statistical model of the current workload with hyper Erlang distributions. We then vary the parameters of those distributions to generate various workloads, representative of different operating points of the machine. Through simulation we obtain performance parameters for three different scheduling strategies: (i) first-come first-serve, (ii) gang-scheduling, and (iii) backfilling. Our results show that backfilling, can be very effective for the common operating points in the 60-70% utilization range. However, for higher utilization rates, time-sharing techniques such as gang-scheduling offer much better performance

  14. Filling the Holes: Work Schedulers as Job Crafters of Employment Practice in Long-Term Health Care

    Science.gov (United States)

    Kossek, Ellen Ernst; Piszczek, Matthew M.; Mcalpine, Kristie L.; Hammer, Leslie B.; Burke, Lisa

    2016-01-01

    Although work schedulers serve an organizational role influencing decisions about balancing conflicting stakeholder interests over schedules and staffing, scheduling has primarily been described as an objective activity or individual job characteristic. The authors use the lens of job crafting to examine how schedulers in 26 health care facilities enact their roles as they “fill holes” to schedule workers. Qualitative analysis of interview data suggests that schedulers expand their formal scope and influence to meet their interpretations of how to manage stakeholders (employers, workers, and patients). The authors analyze variations in the extent of job crafting (cognitive, physical, relational) to broaden role repertoires. They find evidence that some schedulers engage in rule-bound interpretation to avoid role expansion. They also identify four types of schedulers: enforcers, patient-focused schedulers, employee-focused schedulers, and balancers. The article adds to the job-crafting literature by showing that job crafting is conducted not only to create meaningful work but also to manage conflicting demands and to mediate among the competing labor interests of workers, clients, and employers. PMID:27721517

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

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

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

  18. Project control integrating cost and schedule in construction

    CERN Document Server

    Del Pico, Wayne J

    2013-01-01

    The key to successful project control is the fusing of cost to schedule whereby the management of one helps to manage the other. Project Control: Integrating Cost and Schedule in Construction explores the reasons behind and the methodologies for proper planning, monitoring, and controlling both project costs and schedule. Filling a current void the topic of project control applied to the construction industry, it is essential reading for students and professionals alike.

  19. Parallel Branch-and-Bound Methods for the Job Shop Scheduling

    DEFF Research Database (Denmark)

    Clausen, Jens; Perregaard, Michael

    1998-01-01

    Job-shop scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been branch-and-bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions...... for the JSS problem, but with limited success. Even with recent methods, it is still not possible to solve problems substantially larger than 10 machines and 10 jobs. In the current study, we focus on parallel methods for solving JSS problems. We implement two different parallel branch-and-bound algorithms...

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

    Science.gov (United States)

    Kusuma, K. K.; Maruf, A.

    2016-02-01

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

  1. The Effects of Machine Load Sitnations on Performance of Job Shop and Group Scheduling

    OpenAIRE

    Torkul, O.

    2018-01-01

    Perfonnance of job shop and group scheduling ndermulti­natch work input environment was exarnined against two nachine load (light and high load) situations. n order to conduct the analysis, a deterministic computer ;im ulation program was written and used. A job shop {JS) model is applied to the shop floor area and :ompared with a simulation of a similar proposal except hat group technology (GT) model was used in the shop loor area instead. )etailed analysis of the results from applying diffe...

  2. The Effects of Machine Load Sitnations on Performance of Job Shop and Group Scheduling

    OpenAIRE

    O.TORKUL TORKUL

    1998-01-01

    Perfonnance of job shop and group scheduling ndermulti­natch work input environment was exarnined against two nachine load (light and high load) situations. n order to conduct the analysis, a deterministic computer ;im ulation program was written and used. A job shop {JS) model is applied to the shop floor area and :ompared with a simulation of a similar proposal except hat group technology (GT) model was used in the shop loor area instead. )etailed analysis of the results from applying diffe...

  3. Neural nets for job-shop scheduling, will they do the job?

    NARCIS (Netherlands)

    Rooda, J.E.; Willems, T.M.; Goodwin, G.C.; Evans, R.J.

    1993-01-01

    A neural net structure has been developed which is capable of solving deterministic jobshop scheduling problems, part of the large class of np-complete problems. The problem was translated in an integer linear-programming format which facilitated translation in an adequate neural net structure. Use

  4. Integration of Formal Job Hazard Analysis and ALARA Work Practice

    International Nuclear Information System (INIS)

    NELSEN, D.P.

    2002-01-01

    ALARA work practices have traditionally centered on reducing radiological exposure and controlling contamination. As such, ALARA policies and procedures are not well suited to a wide range of chemical and human health issues. Assessing relative risk, identifying appropriate engineering/administrative controls and selecting proper Personal Protective Equipment (PPE) for non nuclear work activities extends beyond the limitations of traditional ALARA programs. Forging a comprehensive safety management program in today's (2002) work environment requires a disciplined dialog between health and safety professionals (e.g. safety, engineering, environmental, quality assurance, industrial hygiene, ALARA, etc.) and personnel working in the field. Integrating organizational priorities, maintaining effective pre-planning of work and supporting a team-based approach to safety management represents today's hallmark of safety excellence. Relying on the mandates of any single safety program does not provide industrial hygiene with the tools necessary to implement an integrated safety program. The establishment of tools and processes capable of sustaining a comprehensive safety program represents a key responsibility of industrial hygiene. Fluor Hanford has built integrated safety management around three programmatic attributes: (1) Integration of radiological, chemical and ergonomic issues under a single program. (2) Continuous improvement in routine communications among work planning/scheduling, job execution and management. (3) Rapid response to changing work conditions, formalized work planning and integrated worker involvement

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

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

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

    Science.gov (United States)

    Yang, S; Wang, D

    2000-01-01

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

  8. A Simulated Annealing-Based Heuristic Algorithm for Job Shop Scheduling to Minimize Lateness

    Directory of Open Access Journals (Sweden)

    Rui Zhang

    2013-04-01

    Full Text Available A decomposition-based optimization algorithm is proposed for solving large job shop scheduling problems with the objective of minimizing the maximum lateness. First, we use the constraint propagation theory to derive the orientation of a portion of disjunctive arcs. Then we use a simulated annealing algorithm to find a decomposition policy which satisfies the maximum number of oriented disjunctive arcs. Subsequently, each subproblem (corresponding to a subset of operations as determined by the decomposition policy is successively solved with a simulated annealing algorithm, which leads to a feasible solution to the original job shop scheduling problem. Computational experiments are carried out for adapted benchmark problems, and the results show the proposed algorithm is effective and efficient in terms of solution quality and time performance.

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

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

  11. Job Satisfaction: A Possible Integration of Two Theories

    Science.gov (United States)

    Hazer, John T.

    1976-01-01

    The author proposes an integration of Herzberg's two-factor theory of job satisfaction (job satisfaction/dissatisfaction as two separate, parallel continua) and traditional theory (job satisfaction/dissatisfaction sharing the same continuum) and a rationale for deciding which motivation methods to use for employees with differeing levels of…

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

  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. Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times

    Directory of Open Access Journals (Sweden)

    Jan-Yee Kung

    2013-01-01

    Full Text Available Scheduling involving jobs with time-dependent processing times has recently attracted much research attention. However, multiagent scheduling with simultaneous considerations of jobs with time-dependent processing times and ready times is relatively unexplored. Inspired by this observation, we study a two-agent single-machine scheduling problem in which the jobs have both time-dependent processing times and ready times. We consider the model in which the actual processing time of a job of the first agent is a decreasing function of its scheduled position while the actual processing time of a job of the second agent is an increasing function of its scheduled position. In addition, each job has a different ready time. The objective is to minimize the total completion time of the jobs of the first agent with the restriction that no tardy job is allowed for the second agent. We propose a branch-and-bound and several genetic algorithms to obtain optimal and near-optimal solutions for the problem, respectively. We also conduct extensive computational results to test the proposed algorithms and examine the impacts of different problem parameters on their performance.

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

  16. Hybrid Discrete Differential Evolution Algorithm for Lot Splitting with Capacity Constraints in Flexible Job Scheduling

    Directory of Open Access Journals (Sweden)

    Xinli Xu

    2013-01-01

    Full Text Available A two-level batch chromosome coding scheme is proposed to solve the lot splitting problem with equipment capacity constraints in flexible job shop scheduling, which includes a lot splitting chromosome and a lot scheduling chromosome. To balance global search and local exploration of the differential evolution algorithm, a hybrid discrete differential evolution algorithm (HDDE is presented, in which the local strategy with dynamic random searching based on the critical path and a random mutation operator is developed. The performance of HDDE was experimented with 14 benchmark problems and the practical dye vat scheduling problem. The simulation results showed that the proposed algorithm has the strong global search capability and can effectively solve the practical lot splitting problems with equipment capacity constraints.

  17. Underground storage tank - Integrated Demonstration Technical Task Plan master schedule

    International Nuclear Information System (INIS)

    Johnson, C.M.

    1994-08-01

    This document provides an integrated programmatic schedule (i.e., Master Schedule) for the U.S. Department of Energy (DOE) Underground Storage Tank-Integrated Demonstration (UST-ID) Program. It includes top-level schedule and related information for the DOE Office of Technology Development (EM-50) UST-ID activities. The information is based upon the fiscal year (FY) 1994 technical task plans (TTPS) and has been prepared as a baseline information resource for program participants. The Master Schedule contains Level 0 and Level 1 program schedules for the UST-ID Program. This document is one of a number of programmatic documents developed to support and manage the UST-ID activities. It is composed of the following sections: Program Overview - provides a summary background of the UST-ID Program. This summary addresses the mission, scope, and organizational structure of the program; Activity Description - provides a programmatic description of UST-ID technology development activities and lists the key milestones for the UST-ID systems. Master Schedules - contains the Level 0 and Level 1 programmatic schedules for the UST-ID systems. References - lists the UST-ID programmatic documents used as a basis for preparing the Master Schedule. The appendixes contain additional details related to site-specific technology applications

  18. The Impact of the Implementation Cost of Replication in Data Grid Job Scheduling

    Directory of Open Access Journals (Sweden)

    Babar Nazir

    2018-05-01

    Full Text Available Data Grids deal with geographically-distributed large-scale data-intensive applications. Schemes scheduled for data grids attempt to not only improve data access time, but also aim to improve the ratio of data availability to a node, where the data requests are generated. Data replication techniques manage large data by storing a number of data files efficiently. In this paper, we propose centralized dynamic scheduling strategy-replica placement strategies (CDSS-RPS. CDSS-RPS schedule the data and task so that it minimizes the implementation cost and data transfer time. CDSS-RPS consists of two algorithms, namely (a centralized dynamic scheduling (CDS and (b replica placement strategy (RPS. CDS considers the computing capacity of a node and finds an appropriate location for the job. RPS attempts to improve file access time by using replication on the basis of number of accesses, storage capacity of a computing node, and response time of a requested file. Extensive simulations are carried out to demonstrate the effectiveness of the proposed strategy. Simulation results demonstrate that the replication and scheduling strategies improve the implementation cost and average access time significantly.

  19. Comparison of job stress and obesity in nurses with favorable and unfavorable work schedules.

    Science.gov (United States)

    Han, Kihye; Trinkoff, Alison M; Storr, Carla L; Geiger-Brown, Jeanne; Johnson, Karen L; Park, Sungae

    2012-08-01

    To compare obesity-related factors between female nurses with favorable work schedules (WSs) and unfavorable WSs. In a cross-sectional study, 1724 female nurses were stratified by WS (favorable vs unfavorable). For each schedule type, the odds of obesity were related to health behaviors, home demands, and job stress using logistic regression models. Among nurses with unfavorable WSs, healthy behaviors (exercise, sleep) were inversely associated with obesity, whereas for those with favorable WSs, obese nurses reported significantly more unhealthy behaviors (smoking, alcohol use; odds ratio [OR], 1.19; 95% confidence interval [CI], 1.02-1.38), more physical lifting of children/dependents (OR, 1.43; 95% CI, 1.06-1.93), having more nurse input into their jobs (OR, 1.21; 95% CI, 1.02-1.44), yet less boss support at work (OR, 0.83; 95% CI, 0.68-0.99). Considering impacts of WSs on obesity and potential obesity-related health outcomes, healthful scheduling should be provided to nurses.

  20. MIP Models and Hybrid Algorithms for Simultaneous Job Splitting and Scheduling on Unrelated Parallel Machines

    Science.gov (United States)

    Ozmutlu, H. Cenk

    2014-01-01

    We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs. We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA). Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented. We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes' random key numbers. This is the second contribution of the paper. The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously. The fourth contribution of this paper is implementation of the GAspLAMIP. This implementation let us verify the optimality of GAspLA for the studied combinations. The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms. PMID:24977204

  1. MIP models and hybrid algorithms for simultaneous job splitting and scheduling on unrelated parallel machines.

    Science.gov (United States)

    Eroglu, Duygu Yilmaz; Ozmutlu, H Cenk

    2014-01-01

    We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs. We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA). Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented. We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes' random key numbers. This is the second contribution of the paper. The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously. The fourth contribution of this paper is implementation of the GAspLAMIP. This implementation let us verify the optimality of GAspLA for the studied combinations. The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms.

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

    Science.gov (United States)

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

    2017-10-01

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

  3. ADAPTATION OF JOHNSON SEQUENCING ALGORITHM FOR JOB SCHEDULING TO MINIMISE THE AVERAGE WAITING TIME IN CLOUD COMPUTING ENVIRONMENT

    Directory of Open Access Journals (Sweden)

    SOUVIK PAL

    2016-09-01

    Full Text Available Cloud computing is an emerging paradigm of Internet-centric business computing where Cloud Service Providers (CSPs are providing services to the customer according to their needs. The key perception behind cloud computing is on-demand sharing of resources available in the resource pool provided by CSP, which implies new emerging business model. The resources are provisioned when jobs arrive. The job scheduling and minimization of waiting time are the challenging issue in cloud computing. When a large number of jobs are requested, they have to wait for getting allocated to the servers which in turn may increase the queue length and also waiting time. This paper includes system design for implementation which is concerned with Johnson Scheduling Algorithm that provides the optimal sequence. With that sequence, service times can be obtained. The waiting time and queue length can be reduced using queuing model with multi-server and finite capacity which improves the job scheduling model.

  4. Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs

    Science.gov (United States)

    Wang, Ji-Bo; Wang, Ming-Zheng; Ji, Ping

    2012-05-01

    In this article, we consider a single machine scheduling problem with a time-dependent learning effect and deteriorating jobs. By the effects of time-dependent learning and deterioration, we mean that the job processing time is defined by a function of its starting time and total normal processing time of jobs in front of it in the sequence. The objective is to determine an optimal schedule so as to minimize the total completion time. This problem remains open for the case of -1 < a < 0, where a denotes the learning index; we show that an optimal schedule of the problem is V-shaped with respect to job normal processing times. Three heuristic algorithms utilising the V-shaped property are proposed, and computational experiments show that the last heuristic algorithm performs effectively and efficiently in obtaining near-optimal solutions.

  5. Parallel-aware, dedicated job co-scheduling within/across symmetric multiprocessing nodes

    Science.gov (United States)

    Jones, Terry R.; Watson, Pythagoras C.; Tuel, William; Brenner, Larry; ,Caffrey, Patrick; Fier, Jeffrey

    2010-10-05

    In a parallel computing environment comprising a network of SMP nodes each having at least one processor, a parallel-aware co-scheduling method and system for improving the performance and scalability of a dedicated parallel job having synchronizing collective operations. The method and system uses a global co-scheduler and an operating system kernel dispatcher adapted to coordinate interfering system and daemon activities on a node and across nodes to promote intra-node and inter-node overlap of said interfering system and daemon activities as well as intra-node and inter-node overlap of said synchronizing collective operations. In this manner, the impact of random short-lived interruptions, such as timer-decrement processing and periodic daemon activity, on synchronizing collective operations is minimized on large processor-count SPMD bulk-synchronous programming styles.

  6. Ant colony optimisation for scheduling of flexible job shop with multi-resources requirements

    Directory of Open Access Journals (Sweden)

    Kalinowski Krzysztof

    2017-01-01

    Full Text Available The paper presents application of ant colony optimisation algorithm for scheduling multi-resources operations in flexible job shop type of production systems. Operations that require the participation of two or more resources are common in industrial practice, when planning are subject not only machines, but also other additional resources (personnel, tools, etc.. Resource requirements of operation are indicated indirectly by resource groups. The most important parameters of the resource model and resource groups are also described. A basic assumptions for ant colony algorithm used for scheduling in the considered model with multiresources requirements of operations is discussed. The main result of the research is the schema of metaheuristic that enables searching best-score solutions in manufacturing systems satisfying presented constraints.

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

  8. A Review On Job Shop Scheduling Using Non-Conventional Optimization Algorithm

    OpenAIRE

    K.Mallikarjuna; Venkatesh.G

    2014-01-01

    A great deal of research has been focused on solving job shop scheduling problem (∫J), over the last four decades, resulting in a wide variety of approaches. Recently much effort has been concentrated on hybrid methods to solve ∫J, as a single technique cannot solve this stubborn problem. As a result much effort has recently been concentrated on techniques that lead to combinatorial optimization methods and a meta-strategy which guides the search out of local optima. In this p...

  9. Optimal Scheduling for Retrieval Jobs in Double-Deep AS/RS by Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Kuo-Yang Wu

    2013-01-01

    Full Text Available We investigate the optimal scheduling of retrieval jobs for double-deep type Automated Storage and Retrieval Systems (AS/RS in the Flexible Manufacturing System (FMS used in modern industrial production. Three types of evolutionary algorithms, the Genetic Algorithm (GA, the Immune Genetic Algorithm (IGA, and the Particle Swarm Optimization (PSO algorithm, are implemented to obtain the optimal assignments. The objective is to minimize the working distance, that is, the shortest retrieval time travelled by the Storage and Retrieval (S/R machine. Simulation results and comparisons show the advantages and feasibility of the proposed methods.

  10. Tramp ship routing and scheduling with integrated bunker optimization

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    2014-01-01

    is referred to as bunker and bunker costs constitute a significant part of the daily operating costs. There can be great variations in bunker prices across bunker ports so it is important to carefully plan bunkering for each ship. As ships operate 24 hours a day, they must refuel during operations. Therefore...... and scheduling phase and present a mixed integer programming formulation for the integrated problem of optimally routing, scheduling and bunkering a tramp fleet. Aside from the integration of bunker, this model also extends standard tramp formulations by using load dependent costs, speed and bunker consumption...

  11. Integrated living schedule for nuclear plants

    International Nuclear Information System (INIS)

    Milhiser, R.J.

    1985-01-01

    This paper addresses the change process, including decision making and a credible prioritization methodology. It is intended to result in an integrated plan being jointly accepted and defensible by the utility and the Nuclear Regulatory Commission (NRC). The program described has several advantages: the methodology is consistent with and defensible to NRC criteria; safety and economic factors are placed on a common basis for balancing; the use of valuation factors permits the utility to introduce judgements concerning the importance of any particular benefit; alternative value judgments can easily be examined; explicit indications of the level of confidence in investment outcome is provided; and a definitive framework for establishing and reviewing decision criteria and application is provided

  12. Integration of Learning and Practice for Job Sharing Partnerships

    Science.gov (United States)

    Dixon-Krausse, Pamela Marie

    2007-01-01

    This paper explores the forces that support the proliferation of the flexible work arrangement called job sharing. Moreover, the paper will illuminate the need for integrating learning and practice as a way to develop and support job sharing partners, or "Partners in Practice" (PiPs). The author puts forth a model derived from learning in…

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

    Directory of Open Access Journals (Sweden)

    Qianwang Deng

    2017-01-01

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

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

    Science.gov (United States)

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

    2017-01-01

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

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

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

  17. Gain Scheduling of Observer-Based Controllers with Integral Action

    DEFF Research Database (Denmark)

    Trangbæk, Klaus; Stoustrup, Jakob; Bendtsen, Jan Dimon

    2006-01-01

     This paper presents a method for continuous gain scheduling of  observer-based controllers with integral action. Given two stabilising controllers for a given system, explicit state space formulae are presented, allowing to change gradually from one  controller to the other while preserving...

  18. Integrating rolling stock scheduling with train unit shunting

    DEFF Research Database (Denmark)

    Haahr, Jørgen Thorlund; Lusby, Richard Martin

    2017-01-01

    In this paper, we consider integrating two important railway optimization problems, in particular the Rolling Stock Scheduling Problem and the Train Unit Shunting Problem. We present two similar branch-and-cut based approaches to solve this integrated problem and, in addition, provide a comparison......, sequential approach ends in infeasibility. Furthermore, for the considered instances, solutions are typically found within a few minutes, indicating the applicability of the methodology to short-term planning....

  19. Integrating and scheduling an open set of static analyses

    DEFF Research Database (Denmark)

    Eichberg, Michael; Mezini, Mira; Kloppenburg, Sven

    2006-01-01

    to keep the set of analyses open. We propose an approach to integrating and scheduling an open set of static analyses which decouples the individual analyses and coordinates the analysis executions such that the overall time and space consumption is minimized. The approach has been implemented...... for the Eclipse IDE and has been used to integrate a wide range of analyses such as finding bug patterns, detecting violations of design guidelines, or type system extensions for Java....

  20. Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Helio Yochihiro Fuchigami

    2018-04-01

    Full Text Available The number of just-in-time jobs maximization in a permutation flow shop scheduling problem is considered. A mixed integer linear programming model to represent the problem as well as solution approaches based on enumeration and constructive heuristics were proposed and computationally implemented. Instances with up to 10 jobs and five machines are solved by the mathematical model in an acceptable running time (3.3 min on average while the enumeration method consumes, on average, 1.5 s. The 10 constructive heuristics proposed show they are practical especially for large-scale instances (up to 100 jobs and 20 machines, with very good-quality results and efficient running times. The best two heuristics obtain near-optimal solutions, with only 0.6% and 0.8% average relative deviations. They prove to be better than adaptations of the NEH heuristic (well-known for providing very good solutions for makespan minimization in flow shop for the considered problem.

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

    Science.gov (United States)

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

    2015-01-01

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

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

    Science.gov (United States)

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

    2016-02-01

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

  3. Job Burnout and its Association With Work Schedules and Job Satisfaction Among Iranian Nurses in a Public Hospital: A Questionnaire Survey

    Directory of Open Access Journals (Sweden)

    Asghari

    2016-08-01

    Full Text Available Background Job burnout, defined as a syndrome derived from prolonged exposure to stressors at work, is often observed in health care workers. Shift work and job satisfaction are considered two of the occupational risks for burnout in nurses. Nurses have stress and health complaints. In addition, nurses are likely to job burnout. Objectives The current study aimed to determine the prevalence of job burnout and its association with work schedules and job satisfaction among Iranian nurses in a public hospital. Methods This cross-sectional study was conducted in one of the largest Iranian public hospitals among 362 nurses (response rate: 80.44% in Tehran, Iran. The Maslach burnout inventory (MBI-22 and demographic factors questionnaire were used in the present study. The relationship between job burnout with work schedules and job satisfaction was investigated with multiple logistic regression analysis. Results The mean age and work experience of the participants were 36.14 ± 8.59 and 15.23 ±9.30 years, respectively. The result indicated a relatively high prevalence of burnout (particularly, personal accomplishment among the study population. In general, 64.4% of participants reported low personal accomplishment level. The nurses engaged in shift work reported higher levels of emotional exhaustion (odds ratio (OR = 1.02, 95% confidence interval (CI = 1.006 - 1.041, P-value = 0.008; there was no relationship between work schedules with depersonalization and personal accomplishment. The result showed significant relationship between job satisfaction and emotional exhaustion (OR = 0.945, 95% CI = 0.928 - 0.963, P-value < 0.001 and personal accomplishment (OR = 1.003, 95% CI = 1.014 - 1.058, P-value = 0.001. Conclusions The current study revealed that the Iranian nurses are exposed to a considerable risk of personal accomplishment. Also, job burnout is in association with shift working and low job satisfaction level. In this regard, working pressure

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

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

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

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

  8. REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING

    Directory of Open Access Journals (Sweden)

    N. Shivasankaran

    2013-04-01

    Full Text Available Scheduling problems are generally treated as NP andash; complete combinatorial optimization problems which is a multi-objective and multi constraint one. Repair shop Job sequencing and operator allocation is one such NP andash; complete problem. For such problems, an efficient technique is required that explores a wide range of solution space. This paper deals with Simulated Annealing Technique, a Meta - heuristic to solve the complex Car Sequencing and Operator Allocation problem in a car repair shop. The algorithm is tested with several constraint settings and the solution quality exceeds the results reported in the literature with high convergence speed and accuracy. This algorithm could be considered as quite effective while other heuristic routine fails.

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

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

  11. Baseline development, economic risk, and schedule risk: An integrated approach

    International Nuclear Information System (INIS)

    Tonkinson, J.A.

    1994-01-01

    The economic and schedule risks of Environmental Restoration (ER) projects are commonly analyzed toward the end of the baseline development process. Risk analysis is usually performed as the final element of the scheduling or estimating processes for the purpose of establishing cost and schedule contingency. However, there is an opportunity for earlier assessment of risks, during development of the technical scope and Work Breakdown Structure (WBS). Integrating the processes of risk management and baselining provides for early incorporation of feedback regarding schedule and cost risk into the proposed scope of work. Much of the information necessary to perform risk analysis becomes available during development of the technical baseline, as the scope of work and WBS are being defined. The analysis of risk can actually be initiated early on during development of the technical baseline and continue throughout development of the complete project baseline. Indeed, best business practices suggest that information crucial to the success of a project be analyzed and incorporated into project planning as soon as it is available and usable

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

  13. Integrated project scheduling and staff assignment with controllable processing times.

    Science.gov (United States)

    Fernandez-Viagas, Victor; Framinan, Jose M

    2014-01-01

    This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of each task depends on the number of employees assigned. This type of problems usually appears in service companies, where both tasks scheduling and staff assignment are closely related. An integer programming model for the problem is proposed, together with some extensions to cope with different situations. Additionally, the advantages of the controllable processing times approach are compared with the fixed processing times. Due to the complexity of the integrated model, a simple GRASP algorithm is implemented in order to obtain good, approximate solutions in short computation times.

  14. Integrated Project Scheduling and Staff Assignment with Controllable Processing Times

    Directory of Open Access Journals (Sweden)

    Victor Fernandez-Viagas

    2014-01-01

    Full Text Available This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of each task depends on the number of employees assigned. This type of problems usually appears in service companies, where both tasks scheduling and staff assignment are closely related. An integer programming model for the problem is proposed, together with some extensions to cope with different situations. Additionally, the advantages of the controllable processing times approach are compared with the fixed processing times. Due to the complexity of the integrated model, a simple GRASP algorithm is implemented in order to obtain good, approximate solutions in short computation times.

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

  16. Economic Benefit from Progressive Integration of Scheduling and Control for Continuous Chemical Processes

    Directory of Open Access Journals (Sweden)

    Logan D. R. Beal

    2017-12-01

    Full Text Available Performance of integrated production scheduling and advanced process control with disturbances is summarized and reviewed with four progressive stages of scheduling and control integration and responsiveness to disturbances: open-loop segregated scheduling and control, closed-loop segregated scheduling and control, open-loop scheduling with consideration of process dynamics, and closed-loop integrated scheduling and control responsive to process disturbances and market fluctuations. Progressive economic benefit from dynamic rescheduling and integrating scheduling and control is shown on a continuously stirred tank reactor (CSTR benchmark application in closed-loop simulations over 24 h. A fixed horizon integrated scheduling and control formulation for multi-product, continuous chemical processes is utilized, in which nonlinear model predictive control (NMPC and continuous-time scheduling are combined.

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

  18. Integrated Fractional Load and Packet Scheduling for OFDMA Systems

    DEFF Research Database (Denmark)

    Monghal, Guillaume Damien; Kumar, S.; Pedersen, Klaus I.

    2009-01-01

    This paper study the performance of an orthogonal frequency division multiple access (OFDMA) system under fractional load based in long term evolution (LTE) downlink. Fractional load is defined by a situation where only a fraction of the bandwidth is used for transmission due to lack of traffic....... This type of situation should result in a global increase of signal to interference and noise ratio (SINR) conditions in the network. We propose different methods integrating the transmission pattern selection to the packet scheduling functionality of the enode-B depending only on the channel quality...

  19. A PMBGA to Optimize the Selection of Rules for Job Shop Scheduling Based on the Giffler-Thompson Algorithm

    Directory of Open Access Journals (Sweden)

    Rui Zhang

    2012-01-01

    Full Text Available Most existing research on the job shop scheduling problem has been focused on the minimization of makespan (i.e., the completion time of the last job. However, in the fiercely competitive market nowadays, delivery punctuality is more important for maintaining a high service reputation. So in this paper, we aim at solving job shop scheduling problems with the total weighted tardiness objective. Several dispatching rules are adopted in the Giffler-Thompson algorithm for constructing active schedules. It is noticeable that the rule selections for scheduling consecutive operations are not mutually independent but actually interrelated. Under such circumstances, a probabilistic model-building genetic algorithm (PMBGA is proposed to optimize the sequence of selected rules. First, we use Bayesian networks to model the distribution characteristics of high-quality solutions in the population. Then, the new generation of individuals is produced by sampling the established Bayesian network. Finally, some elitist individuals are further improved by a special local search module based on parameter perturbation. The superiority of the proposed approach is verified by extensive computational experiments and comparisons.

  20. Work Scheduling by Use of Worker Model in Consideration of Learning by On-The-Job Training

    Science.gov (United States)

    Tateno, Toshitake; Shimizu, Keiko

    This paper deals with a method of scheduling manual work in consideration of learning by on-the-job training (OJT). In skilled work such as maintenance of trains and airplanes, workers must learn many tasks by OJT. While the work processing time of novice workers is longer than that of experts, the time will be reduced with repeated OJT. Therefore, OJT is important for maintaining the skill level and the long-term work efficiency of an organization. In order to devise a schedule considering OJT, the scheduler must incorporate a management function of workers to trace dynamically changing work experience. In this paper, after the relationship between scheduling problems and worker management problems is defined, a simulation method, in which a worker model and an agent-based mechanism are utilized, is proposed to derive the optimal OJT strategy toward high long-term performance. Finally, we present some case studies showing the effectiveness of OJT planning based on the simulation.

  1. A Mathematical Model for Scheduling a Batch Processing Machine with Multiple Incompatible Job Families, Non-identical Job dimensions, Non-identical Job sizes, Non-agreeable release times and due dates

    International Nuclear Information System (INIS)

    Ramasubramaniam, M; Mathirajan, M

    2013-01-01

    The paper addresses the problem scheduling a batch processing machine with multiple incompatible job families, non-identical job dimensions, non-identical job sizes and non-agreeable release dates to minimize makespan. The research problem is solved by proposing a mixed integer programming model that appropriately takes into account the parameters considered in the problem. The proposed is validated using a numerical example. The experiment conducted show that the model can pose significant difficulties in solving the large scale instances. The paper concludes by giving the scope for future work and some alternative approaches one can use for solving these class of problems.

  2. The moderating effect of control over work scheduling and overtime on the relationship between workload demands and perceived job risk.

    Science.gov (United States)

    Näswall, Katharina; Burt, Christopher D B; Pearce, Megan

    2015-01-01

    This study investigated the impact of workload demands on perceived job risk using the Job Demand-Control model as a research framework. The primary objective was to test the hypothesis that employee control over work scheduling and overtime would moderate the relationship between workload demands and perceived job risk. Ninety-six participants working in a variety of industries completed measures of workload demands, and of control over work scheduling and overtime, and a measure of perceived job risk. Workload demands predicted higher perceptions of job risk. However, the results also suggest that control over overtime moderated this relationship, where those with the combination of high workload demands and low control over overtime reported higher levels of perceived risk. The results indicate that the JDC model is applicable to safety research. The results suggest that employee control over workload demands is an important variable to consider in terms of managing workplace safety. The present study also points to important areas for future research to explore in order to further understand the connection between demands and safety.

  3. Multi-core job submission and grid resource scheduling for ATLAS AthenaMP

    CERN Document Server

    Crooks, D; The ATLAS collaboration; Harrington, R; Purdie, S; Severini, H; Skipsey, S; Tsulaia, V; Washbrook, A

    2012-01-01

    AthenaMP is the multi-core implementation of the ATLAS software framework and allows the efficient sharing of memory pages between multiple threads of execution. This has now been validated for production and delivers a significant reduction on overall memory footprint with negligible CPU overhead. Before AthenaMP can be routinely run on the LHC Computing Grid, it must be determined how the computing resources available to ATLAS can best exploit the notable improvements delivered by switching to this multi-process model. In particular, there is a need to identify and assess the potential impact of scheduling issues where single core and multi-core job queues have access to the same underlying resources. A study into the effectiveness and scalability of AthenaMP in a production environment will be presented. Submitting AthenaMP tasks to the Tier-0 and candidate Tier-2 sites will allow detailed measurement of worker node performance and also highlight the relative performance of local resource management system...

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

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

    Science.gov (United States)

    Hart, Emma; Sim, Kevin

    2016-01-01

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

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

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

  8. COMPARISON BETWEEN MIXED INTEGER PROGRAMMING WITH HEURISTIC METHOD FOR JOB SHOP SCHEDULING WITH SEPARABLE SEQUENCE-DEPENDENT SETUPS

    Directory of Open Access Journals (Sweden)

    I Gede Agus Widyadana

    2001-01-01

    Full Text Available The decisions to choose appropriate tools for solving industrial problems are not just tools that achieve optimal solution only but it should consider computation time too. One of industrial problems that still difficult to achieve both criteria is scheduling problem. This paper discuss comparison between mixed integer programming which result optimal solution and heuristic method to solve job shop scheduling problem with separable sequence-dependent setup. The problems are generated and the result shows that the heuristic methods still cannot satisfy optimal solution.

  9. Management information system for cost-schedule integration control for nuclear power projects

    International Nuclear Information System (INIS)

    Liu Wei; Wang Yongqing; Tian Li

    2001-01-01

    Based on the project management experience abroad and at home, a cost-schedule integration control model was developed to improve nuclear power project management. The model integrates cost data with the scheduling data by unity coding to efficiently implement cost-schedule integration control on line. The software system architecture and database is designed and implemented. The system functions include estimating and forecasting dynamically cash flow, scheduling and evaluating deviation from the cost-schedule plan, etc. The research and development of the system should improve the architecture of computer integrated management information systems for nuclear power projects in China

  10. Jobs

    DEFF Research Database (Denmark)

    Schubart, Rikke

    2013-01-01

    Review of the movie Jobs (Joshua Michael Stern, 2013), a drama about Steve Jobs, the founder of Apple.......Review of the movie Jobs (Joshua Michael Stern, 2013), a drama about Steve Jobs, the founder of Apple....

  11. An Extended Flexible Job Shop Scheduling Model for Flight Deck Scheduling with Priority, Parallel Operations, and Sequence Flexibility

    Directory of Open Access Journals (Sweden)

    Lianfei Yu

    2017-01-01

    Full Text Available Efficient scheduling for the supporting operations of aircrafts in flight deck is critical to the aircraft carrier, and even several seconds’ improvement may lead to totally converse outcome of a battle. In the paper, we ameliorate the supporting operations of carrier-based aircrafts and investigate three simultaneous operation relationships during the supporting process, including precedence constraints, parallel operations, and sequence flexibility. Furthermore, multifunctional aircrafts have to take off synergistically and participate in a combat cooperatively. However, their takeoff order must be restrictively prioritized during the scheduling period accorded by certain operational regulations. To efficiently prioritize the takeoff order while minimizing the total time budget on the whole takeoff duration, we propose a novel mixed integer liner programming formulation (MILP for the flight deck scheduling problem. Motivated by the hardness of MILP, we design an improved differential evolution algorithm combined with typical local search strategies to improve computational efficiency. We numerically compare the performance of our algorithm with the classical genetic algorithm and normal differential evolution algorithm and the results show that our algorithm obtains better scheduling schemes that can meet both the operational relations and the takeoff priority requirements.

  12. Scheduling of Power System Cells Integrating Stochastic Power Generation

    International Nuclear Information System (INIS)

    Costa, L.M.

    2008-12-01

    Energy supply and climate change are nowadays two of the most outstanding problems which societies have to cope with under a context of increasing energy needs. Public awareness of these problems is driving political willingness to take actions for tackling them in a swift and efficient manner. Such actions mainly focus in increasing energy efficiency, in decreasing dependence on fossil fuels, and in reducing greenhouse gas emissions. In this context, power systems are undergoing important changes in the way they are planned and managed. On the one hand, vertically integrated structures are being replaced by market structures in which power systems are un-bundled. On the other, power systems that once relied on large power generation facilities are witnessing the end of these facilities' life-cycle and, consequently, their decommissioning. The role of distributed energy resources such as wind and solar power generators is becoming increasingly important in this context. However, the large-scale integration of such type of generation presents many challenges due, for instance, to the uncertainty associated to the variability of their production. Nevertheless, advanced forecasting tools may be combined with more controllable elements such as energy storage devices, gas turbines, and controllable loads to form systems that aim to reduce the impacts that may be caused by these uncertainties. This thesis addresses the management under market conditions of these types of systems that act like independent societies and which are herewith named power system cells. From the available literature, a unified view of power system scheduling problems is also proposed as a first step for managing sets of power system cells in a multi-cell management framework. Then, methodologies for performing the optimal day-ahead scheduling of single power system cells are proposed, discussed and evaluated under both a deterministic and a stochastic framework that directly integrates the

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

  14. Accelerating customer integration into innovation processes using Pico-Jobs

    OpenAIRE

    Blohm, Ivo;Fähling, Jens;Leimeister, Jan Marco;Krcmar, Helmut;Fischer, Jan

    2014-01-01

    Crowdsourcing marketplaces emerged in the internet and enable the integration of customers in various tasks along the innovation process. Marketplaces such as Amazon?s Mechanical Turk install a member base for third parties, where they can offer small, highly structured paid tasks which can hardly be solved automatically with ICT which we call Pico Jobs. In this paper a new method for systematically utilizing the creative potential of the users of these marketplaces for new product developmen...

  15. Safe and healthy integration into semiskilled jobs: does gender matter?

    Science.gov (United States)

    Laberge, Marie; Vézina, Nicole; Saint-Charles, Johanne

    2012-01-01

    Women report fewer injuries than men when they are young, but report a higher proportion of professional diseases later in life (35 years +). Understanding early work conditions that lead to postponed health outcomes is necessary if we are to prevent women's injury as well as men's. Introduction to work and safe integration programs are often put forward to prevent injuries among youth. This paper aims to illustrate some differences in the job introduction / integration process for men and women and to discuss some gender-based Occupational Health and Safety (OHS) implications. Data come from two waves of interviews with 31 students enrolled in vocational training for a semiskilled trade. Results demonstrated differences between men and women: trades chosen, OHS complaints, supervising patterns, integration to work, etc. Women often choose customer service jobs, have less formal supervision and are often left to themselves when learning to do their job. Men declared more accidents while women reported more musculoskeletal symptoms. Findings from this research suggest young women's OHS issues should not be trivialized and that specific youth prevention programs for sectors where women are more present, such as customer service, should be developed.

  16. User interface issues in supporting human-computer integrated scheduling

    Science.gov (United States)

    Cooper, Lynne P.; Biefeld, Eric W.

    1991-01-01

    The topics are presented in view graph form and include the following: characteristics of Operations Mission Planner (OMP) schedule domain; OMP architecture; definition of a schedule; user interface dimensions; functional distribution; types of users; interpreting user interaction; dynamic overlays; reactive scheduling; and transitioning the interface.

  17. Production Scheduling in Complex Job Shops from an Industrie 4.0 Perspective: A Review and Challenges in the Semiconductor Industry

    OpenAIRE

    Waschneck, Bernd; Bauernhansl, Thomas; Altenmüller, Thomas; Kyek, Andreas

    2017-01-01

    On the one hand, Industrie 4.0 has recently emerged as the keyword for increasing productivity in the 21st century. On the other hand, production scheduling in a Complex Job Shop (CJS) environment, such as wafer fabrication facilities, has drawn interest of researchers dating back to the 1950s [65, 18]. Although both research areas overlap, there seems to be very little interchange of ideas. This review presents and assesses production scheduling techniques in complex job shops from an Indust...

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

  19. Fatigue Risk Management: The Impact of Anesthesiology Residents' Work Schedules on Job Performance and a Review of Potential Countermeasures.

    Science.gov (United States)

    Wong, Lily R; Flynn-Evans, Erin; Ruskin, Keith J

    2018-04-01

    Long duty periods and overnight call shifts impair physicians' performance on measures of vigilance, psychomotor functioning, alertness, and mood. Anesthesiology residents typically work between 64 and 70 hours per week and are often required to work 24 hours or overnight shifts, sometimes taking call every third night. Mitigating the effects of sleep loss, circadian misalignment, and sleep inertia requires an understanding of the relationship among work schedules, fatigue, and job performance. This article reviews the current Accreditation Council for Graduate Medical Education guidelines for resident duty hours, examines how anesthesiologists' work schedules can affect job performance, and discusses the ramifications of overnight and prolonged duty hours on patient safety and resident well-being. We then propose countermeasures that have been implemented to mitigate the effects of fatigue and describe how training programs or practice groups who must work overnight can adapt these strategies for use in a hospital setting. Countermeasures include the use of scheduling interventions, strategic naps, microbreaks, caffeine use during overnight and extended shifts, and the use of bright lights in the clinical setting when possible or personal blue light devices when the room lights must be turned off. Although this review focuses primarily on anesthesiology residents in training, many of the mitigation strategies described here can be used effectively by physicians in practice.

  20. Implementation of Compressed Work Schedules: Participation and Job Redesign as Critical Factors for Employee Acceptance.

    Science.gov (United States)

    Latack, Janina C.; Foster, Lawrence W.

    1985-01-01

    Analyzes the effects of an implementation of a three-day/thirty-eight hour (3/38) work schedule among information systems personnel (N=84). Data showed that 18 months after implementation, 3/38 employees still strongly favor the compressed schedule. Data also suggest substantial organizational payoffs including reductions in sick time, overtime,…

  1. Integrated scheduled waste management system in Kuala Lumpur ...

    African Journals Online (AJOL)

    GREGORY

    2011-12-16

    Dec 16, 2011 ... Over the past decade, Malaysia has enjoyed tremendous growth in its economy. This has brought about a population growth together with a great influx of foreign workforce to the cities. This resulted in an increase in the amount of scheduled waste generated. Furthermore, scheduled waste management ...

  2. Minimizing Project Cost by Integrating Subcontractor Selection Decisions with Scheduling

    Science.gov (United States)

    Biruk, Sławomir; Jaśkowski, Piotr; Czarnigowska, Agata

    2017-10-01

    Subcontracting has been a worldwide practice in the construction industry. It enables the construction enterprises to focus on their core competences and, at the same time, it makes complex project possible to be delivered. Since general contractors bear full responsibility for the works carried out by their subcontractors, it is their task and their risk to select a right subcontractor for a particular work. Although subcontractor management has been admitted to significantly affect the construction project’s performance, current practices and past research deal with subcontractor management and scheduling separately. The proposed model aims to support subcontracting decisions by integrating subcontractor selection with scheduling to enable the general contractor to select the optimal combination of subcontractors and own crews for all work packages of the project. The model allows for the interactions between the subcontractors and their impacts on the overall project performance in terms of cost and, indirectly, time and quality. The model is intended to be used at the general contractor’s bid preparation stage. The authors claim that the subcontracting decisions should be taken in a two-stage process. The first stage is a prequalification - provision of a short list of capable and reliable subcontractors; this stage is not the focus of the paper. The resulting pool of available resources is divided into two subsets: subcontractors, and general contractor’s in-house crews. Once it has been defined, the next stage is to assign them to the work packages that, bound by fixed precedence constraints, form the project’s network diagram. Each package is possible to be delivered by the general contractor’s crew or some of the potential subcontractors, at a specific time and cost. Particular crews and subcontractors can be contracted more than one package, but not at the same time. Other constraints include the predefined project completion date (the project is

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

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

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

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

    Energy Technology Data Exchange (ETDEWEB)

    Carlsson, Mats; Johansson, Mikael; Larson, Jeffrey

    2014-01-01

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

  7. Assessing and Increasing Staff Preference for Job Tasks Using Concurrent-Chains Schedules and Probabilistic Outcomes

    Science.gov (United States)

    Reed, Derek D.; DiGennaro Reed, Florence D.; Campisano, Natalie; Lacourse, Kristen; Azulay, Richard L.

    2012-01-01

    The assessment and improvement of staff members' subjective valuation of nonpreferred work tasks may be one way to increase the quality of staff members' work life. The Task Enjoyment Motivation Protocol (Green, Reid, Passante, & Canipe, 2008) provides a process for supervisors to identify the aversive qualities of nonpreferred job tasks.…

  8. A Hierarchical Algorithm for Integrated Scheduling and Control With Applications to Power Systems

    DEFF Research Database (Denmark)

    Sokoler, Leo Emil; Dinesen, Peter Juhler; Jørgensen, John Bagterp

    2016-01-01

    The contribution of this paper is a hierarchical algorithm for integrated scheduling and control via model predictive control of hybrid systems. The controlled system is a linear system composed of continuous control, state, and output variables. Binary variables occur as scheduling decisions in ...

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

  10. Integration of Tactical Departure Scheduling and Traffic Flow Management, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — In the ATM Select topic area of Integrated Arrival, Departure and Surface (IADS) planning, this proposal addresses Tactical Departure Scheduling (TDS), which is a...

  11. Revisiting the NEH algorithm- the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling

    Directory of Open Access Journals (Sweden)

    A. Baskar

    2016-04-01

    Full Text Available Permutation flow shop scheduling problems have been an interesting area of research for over six decades. Out of the several parameters, minimization of makespan has been studied much over the years. The problems are widely regarded as NP-Complete if the number of machines is more than three. As the computation time grows exponentially with respect to the problem size, heuristics and meta-heuristics have been proposed by many authors that give reasonably accurate and acceptable results. The NEH algorithm proposed in 1983 is still considered as one of the best simple, constructive heuristics for the minimization of makespan. This paper analyses the powerful job insertion technique used by NEH algorithm and proposes seven new variants, the complexity level remains same. 120 numbers of problem instances proposed by Taillard have been used for the purpose of validating the algorithms. Out of the seven, three produce better results than the original NEH algorithm.

  12. Coordinating space telescope operations in an integrated planning and scheduling architecture

    Science.gov (United States)

    Muscettola, Nicola; Smith, Stephen F.; Cesta, Amedeo; D'Aloisi, Daniela

    1992-01-01

    The Heuristic Scheduling Testbed System (HSTS), a software architecture for integrated planning and scheduling, is discussed. The architecture has been applied to the problem of generating observation schedules for the Hubble Space Telescope. This problem is representative of the class of problems that can be addressed: their complexity lies in the interaction of resource allocation and auxiliary task expansion. The architecture deals with this interaction by viewing planning and scheduling as two complementary aspects of the more general process of constructing behaviors of a dynamical system. The principal components of the software architecture are described, indicating how to model the structure and dynamics of a system, how to represent schedules at multiple levels of abstraction in the temporal database, and how the problem solving machinery operates. A scheduler for the detailed management of Hubble Space Telescope operations that has been developed within HSTS is described. Experimental performance results are given that indicate the utility and practicality of the approach.

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

  14. A Local and Global Search Combine Particle Swarm Optimization Algorithm for Job-Shop Scheduling to Minimize Makespan

    Directory of Open Access Journals (Sweden)

    Zhigang Lian

    2010-01-01

    Full Text Available The Job-shop scheduling problem (JSSP is a branch of production scheduling, which is among the hardest combinatorial optimization problems. Many different approaches have been applied to optimize JSSP, but for some JSSP even with moderate size cannot be solved to guarantee optimality. The original particle swarm optimization algorithm (OPSOA, generally, is used to solve continuous problems, and rarely to optimize discrete problems such as JSSP. In OPSOA, through research I find that it has a tendency to get stuck in a near optimal solution especially for middle and large size problems. The local and global search combine particle swarm optimization algorithm (LGSCPSOA is used to solve JSSP, where particle-updating mechanism benefits from the searching experience of one particle itself, the best of all particles in the swarm, and the best of particles in neighborhood population. The new coding method is used in LGSCPSOA to optimize JSSP, and it gets all sequences are feasible solutions. Three representative instances are made computational experiment, and simulation shows that the LGSCPSOA is efficacious for JSSP to minimize makespan.

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

  16. A job analysis of community health workers in the context of integrated nutrition and early child development.

    Science.gov (United States)

    Phuka, John; Maleta, Kenneth; Thomas, Mavuto; Gladstone, Melisa

    2014-01-01

    Stunting and poor child development are major public health concerns in Malawi. Integrated nutrition and early child development (ECD) interventions have shown potential to reduce stunting, but it is not known how these integrated approaches can be implemented in Malawi. In this paper, we aimed to evaluate the current jobs status of community health workers and their potential to implement integrated approaches. This was accomplished by a desk review of nutrition and ECD policy documents, as well as interviews with key informants, community health workers, and community members. We found that Malawi has comprehensive policies and well-outlined coordination structures for nutrition and ECD that advocate for integrated approaches. Strong multidisciplinary interaction exists at central levels but not at the community level. Integration of community health workers from different sectors is limited by workload, logistics, and a lack of synchronized work schedules. Favorable, sound policies and well-outlined coordination structures alone are not enough for the establishment of integrated nutrition and ECD activities. Balanced bureaucratic structures, improved task allocation, and synchronization of work schedules across all relevant sectors are needed for integrated intervention in Malawi. © 2014 New York Academy of Sciences.

  17. An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

    Energy Technology Data Exchange (ETDEWEB)

    Vydyanathan, Naga; Krishnamoorthy, Sriram; Sabin, Gerald M.; Catalyurek, Umit V.; Kurc, Tahsin; Sadayappan, Ponnuswamy; Saltz, Joel H.

    2009-08-01

    Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application-tasks with dependences. These applications exhibit both task- and data-parallelism, and combining these two (also called mixedparallelism), has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task- and data-parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the taskgraph, the runtime estimates and scalability characteristics of the tasks and the inter-task data communication volumes. A locality conscious scheduling strategy is used to improve inter-task data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications as well as synthetic graphs shows that our algorithm consistently generates schedules with lower makespan as compared to CPR and CPA, two previously proposed scheduling algorithms. Our algorithm also produces schedules that have lower makespan than pure taskand data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.

  18. Vehicle scheduling schemes for commercial and emergency logistics integration.

    Science.gov (United States)

    Li, Xiaohui; Tan, Qingmei

    2013-01-01

    In modern logistics operations, large-scale logistics companies, besides active participation in profit-seeking commercial business, also play an essential role during an emergency relief process by dispatching urgently-required materials to disaster-affected areas. Therefore, an issue has been widely addressed by logistics practitioners and caught researchers' more attention as to how the logistics companies achieve maximum commercial profit on condition that emergency tasks are effectively and performed satisfactorily. In this paper, two vehicle scheduling models are proposed to solve the problem. One is a prediction-related scheme, which predicts the amounts of disaster-relief materials and commercial business and then accepts the business that will generate maximum profits; the other is a priority-directed scheme, which, firstly groups commercial and emergency business according to priority grades and then schedules both types of business jointly and simultaneously by arriving at the maximum priority in total. Moreover, computer-based simulations are carried out to evaluate the performance of these two models by comparing them with two traditional disaster-relief tactics in China. The results testify the feasibility and effectiveness of the proposed models.

  19. FOREST HARVEST SCHEDULING PLAN INTEGRATED TO THE ROAD NETWORK

    Directory of Open Access Journals (Sweden)

    Pedro Henrique Belavenutti Martins da Silva

    2016-03-01

    Full Text Available In industrial forest plantations, the spatial distribution of management units for harvest scheduling influences the timber production cost and the non-renewable resources consumption, due to issues related to transport logistic. In this context, this research aimed to formulate Integer Linear Programming (ILP by means of the application of Floyd-Warshall network optimization algorithm to generate timber production routes, minimizing the production costs resulting from harvest activities and forest road maintenance. Then, scenarios were simulated considering different minimal harvest ages for Pinus spp. and Eucalyptus spp. stands. The planning horizon was five years with annual periodicity. The study area was 23,330 hectares of forests, located in Paraná state (southern Brazil. We compared the simulated scenarios according to the following parameter indicators: harvest income, building road network and the production unit cost. The decreasing of the minimal harvest age reduces the mean production of management units scheduled to be harvested, in other hand, it requires fewer roads to be built, and consequently increases the production unit cost. The solutions obtained by using ILP models presented an optimality gap lower than 0.1%.

  20. INTEGRATION OF SHIP HULL ASSEMBLY SEQUENCE PLANNING, SCHEDULING AND BUDGETING

    Directory of Open Access Journals (Sweden)

    Remigiusz Romuald Iwańkowicz

    2015-02-01

    Full Text Available The specificity of the yard work requires the particularly careful treatment of the issues of scheduling and budgeting in the production planning processes. The article presents the method of analysis of the assembly sequence taking into account the duration of individual activities and the demand for resources. A method of the critical path and resource budgeting were used. Modelling of the assembly was performed using the acyclic graphs. It has been shown that the assembly sequences can have very different feasible budget regions. The proposed model is applied to the assembly processes of large-scale welded structures, including the hulls of ships. The presented computational examples have a simulation character. They show the usefulness of the model and the possibility to use it in a variety of analyses.

  1. Applying fuzzy integral for evaluating intensity of knowledge work in jobs

    Directory of Open Access Journals (Sweden)

    Jalil Heidary Dahooie

    2013-10-01

    Full Text Available In this article, a framework is proposed to define and identify knowledge work intensity in jobs, quantitatively. For determining the Knowledge Work Intensity Score (KWIS of a job, it is supposed that the job comprises some tasks and KWIS of the job is determined based on knowledge intensity of these tasks. Functional Job Analysis (FJA method is applied to determine tasks of jobs and then Task’s Knowledge Intensity Score (TKIS is computed by using Fuzzy integral method. Besides, importance weight and time weight of tasks are determined by utilizing appropriate methods. Finally, KWIS is calculated by a formula composed of tasks’ TKISs and the weights. For evaluating applicability of the framework, it is applied to calculate KWISs of two jobs (Deputy of Finance and service, Laboratory technician.

  2. FAULT TOLERANCE IN JOB SCHEDULING THROUGH FAULT MANAGEMENT FRAMEWORK USING SOA IN GRID

    Directory of Open Access Journals (Sweden)

    V. Indhumathi

    2017-01-01

    Full Text Available The rapid development in computing resources has enhanced the recital of computers and abridged their costs. This accessibility of low cost prevailing computers joined with the fame of the Internet and high-speed networks has leaded the computing surroundings to be mapped from dispersed to grid environments. Grid is a kind of dispersed system which supports the allotment and harmonized exploit of geographically dispersed and multi-owner resources, autonomously from their physical form and site, in vibrant practical organizations that carve up the similar objective of decipher large-scale applications. Thus any type of failure can happen at any point of time and job running in grid environment might fail. Therefore fault tolerance is an imperative and demanding concern in grid computing as the steadiness of individual grid resources may not be guaranteed. In order to build computational grids more effectual and consistent fault tolerant system is required. In order to accomplish the user prospect in terms of recital and competence, the Grid system desires SOA Fault Management Framework for the sharing of tasks with fault tolerance. A Fault Management Framework endeavor to pick up the response time of user’s proposed applications by ensures maximal exploitation of obtainable resources. The main aim is to avert, if probable, the stipulation where some processors are congested by means of a set of tasks while others are flippantly loaded or even at leisure.

  3. Integration of look-ahead multicast and unicast scheduling for input-queued cell switches

    DEFF Research Database (Denmark)

    Yu, Hao; Ruepp, Sarah Renée; Berger, Michael Stübert

    2012-01-01

    This paper presents an integration of multicast and unicast traffic scheduling algorithms for input-queued cell switches. The multi-level round-robin multicast scheduling (ML-RRMS) algorithm with the look-ahead (LA) mechanism provides a highly scalable architecture and is able to reduce the head...... module that filters out the conflicting requests to ensure fairness. Simulation results show that comparing with the scheme using WBA for the multicast scheduling, the scheme proposed in this paper reduces the HOL blocking problem for multicast traffic and provides a significant improvement in terms...

  4. Scheduling jobs in the cloud using on-demand and reserved instances

    NARCIS (Netherlands)

    Shen, S.; Deng, K.; Iosup, A.; Epema, D.H.J.; Wolf, F.; Mohr, B.; Mey, an D.

    2013-01-01

    Deploying applications in leased cloud infrastructure is increasingly considered by a variety of business and service integrators. However, the challenge of selecting the leasing strategy — larger or faster instances? on-demand or reserved instances? etc.— and to configure the leasing strategy with

  5. Heuristic for production scheduling on job-shop plants considering preventive maintenance tasks

    Directory of Open Access Journals (Sweden)

    Ronald Díaz-Cazaña

    2014-01-01

    Full Text Available El análisis simultáneo de la programación de la producción y la s tareas de mantenimiento preventivo atrae especial atención en los investigadores debido a su gran complejidad y por ende la neces idad de encontrar métodos eficientes para resolver este tipo de problema combinatorio. Este artículo presenta un enfoque heurístico para resolver dicha problemática en plantas tipo job-shop . El método de solución incluye un modelo de programación lineal inspirado en el proble ma del Agente Vendedor, donde el tiempo de iniciación es consid erado como métrica de distancia. El método persigue obtener una secue ncia de las órdenes de producción y tareas de mantenimiento pre ventivo que reduzcan el tiempo ocioso y los retrasos simultáneamente, c umpliendo con el programa de mantenimiento. Luego de encontrar la solución óptima para cada máquina, un factor de corrección ( CF es determinado como la nueva medida de distancia. El factor CF considera la estructura inicial de solución, la utilización de las máquin as y las prioridades en los productos. De esta forma, la soluci ón final es alcanzada solucionando el modelo de programación lineal usando los valores de distancia actualizados. Finalmente, la heurístic a propuesta es aplicada en un caso de estudio real de la Industria Cubana. Los resultados experimentales indicaron una reducción significa tiva del tiempo ocioso para la compañía objeto de estudio.

  6. ATD-1 ATM Technology Demonstration-1 and Integrated Scheduling

    Science.gov (United States)

    Quon, Leighton

    2014-01-01

    Enabling efficient arrivals for the NextGen Air Traffic Management System and developing a set of integrated decision support tools to reduce the high cognitive workload so that controllers are able to simultaneously achieve safe, efficient, and expedient operations at high traffic demand levels.

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

  8. Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize proFIt by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a fixed route network and itinerary as liner ships. Marine fuel....... We devise a solution method based on column generation with a dynamic programming algorithm to generate columns. The method is heuristic mainly due to a discretization of the continuous bunker purchase variables. We show that the integrated planning approach can increase profits and that the decision...

  9. Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize pro_t by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a _xed route network and itinerary as liner ships. Marine fuel...... and bunker consumption. We devise a solution method based on column generation with a dynamic programming algorithm to generate columns. The method is heuristic mainly due to a discretization of the continuous bunker purchase variables. We show that the integrated planning approach can increase pro...

  10. An Extended Genetic Algorithm for Distributed Integration of Fuzzy Process Planning and Scheduling

    Directory of Open Access Journals (Sweden)

    Shuai Zhang

    2016-01-01

    Full Text Available The distributed integration of process planning and scheduling (DIPPS aims to simultaneously arrange the two most important manufacturing stages, process planning and scheduling, in a distributed manufacturing environment. Meanwhile, considering its advantage corresponding to actual situation, the triangle fuzzy number (TFN is adopted in DIPPS to represent the machine processing and transportation time. In order to solve this problem and obtain the optimal or near-optimal solution, an extended genetic algorithm (EGA with innovative three-class encoding method, improved crossover, and mutation strategies is proposed. Furthermore, a local enhancement strategy featuring machine replacement and order exchange is also added to strengthen the local search capability on the basic process of genetic algorithm. Through the verification of experiment, EGA achieves satisfactory results all in a very short period of time and demonstrates its powerful performance in dealing with the distributed integration of fuzzy process planning and scheduling (DIFPPS.

  11. Operational Excellence through Schedule Optimization and Production Simulation of Application Specific Integrated Circuits.

    Energy Technology Data Exchange (ETDEWEB)

    Flory, John Andrew [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Padilla, Denise D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Gauthier, John H. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Zwerneman, April Marie [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Miller, Steven P [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2016-05-01

    Upcoming weapon programs require an aggressive increase in Application Specific Integrated Circuit (ASIC) production at Sandia National Laboratories (SNL). SNL has developed unique modeling and optimization tools that have been instrumental in improving ASIC production productivity and efficiency, identifying optimal operational and tactical execution plans under resource constraints, and providing confidence in successful mission execution. With ten products and unprecedented levels of demand, a single set of shared resources, highly variable processes, and the need for external supplier task synchronization, scheduling is an integral part of successful manufacturing. The scheduler uses an iterative multi-objective genetic algorithm and a multi-dimensional performance evaluator. Schedule feasibility is assessed using a discrete event simulation (DES) that incorporates operational uncertainty, variability, and resource availability. The tools provide rapid scenario assessments and responses to variances in the operational environment, and have been used to inform major equipment investments and workforce planning decisions in multiple SNL facilities.

  12. Analyzing Integrated Cost-Schedule Risk for Complex Product Systems R&D Projects

    Directory of Open Access Journals (Sweden)

    Zhe Xu

    2014-01-01

    Full Text Available The vast majority of the research efforts in project risk management tend to assess cost risk and schedule risk independently. However, project cost and time are related in reality and the relationship between them should be analyzed directly. We propose an integrated cost and schedule risk assessment model for complex product systems R&D projects. Graphical evaluation review technique (GERT, Monte Carlo simulation, and probability distribution theory are utilized to establish the model. In addition, statistical analysis and regression analysis techniques are employed to analyze simulation outputs. Finally, a complex product systems R&D project as an example is modeled by the proposed approach and the simulation outputs are analyzed to illustrate the effectiveness of the risk assessment model. It seems that integrating cost and schedule risk assessment can provide more reliable risk estimation results.

  13. Integration of scheduling and discrete event simulation systems to improve production flow planning

    Science.gov (United States)

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

    2016-08-01

    The increased availability of data and computer-aided technologies such as MRPI/II, ERP and MES system, allowing producers to be more adaptive to market dynamics and to improve production scheduling. Integration of production scheduling and computer modelling, simulation and visualization systems can be useful in the analysis of production system constraints related to the efficiency of manufacturing systems. A integration methodology based on semi-automatic model generation method for eliminating problems associated with complexity of the model and labour-intensive and time-consuming process of simulation model creation is proposed. Data mapping and data transformation techniques for the proposed method have been applied. This approach has been illustrated through examples of practical implementation of the proposed method using KbRS scheduling system and Enterprise Dynamics simulation system.

  14. Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine

    Directory of Open Access Journals (Sweden)

    Jianbo Qian

    2013-01-01

    Full Text Available We consider single machine scheduling problems with learning/deterioration effects and time-dependent processing times, with due date assignment consideration, and our objective is to minimize the weighted number of tardy jobs. By reducing all versions of the problem to an assignment problem, we solve them in O(n4 time. For some important special cases, the time complexity can be improved to be O(n2 using dynamic programming techniques.

  15. Using System Architecture, Review Entry Criteria, and Standard Work Package Data to Enable Rapid Development of Integrated Master Schedules

    Science.gov (United States)

    2016-03-01

    critical path, EVM, project management, systems engineering, CVN, obsolescence , integrated master schedule , portfolio schedule 15. NUMBER OF PAGES...after the decision to swap deployments between the CVN-69 and CVN-75. C. COTS OBSOLESCENCE While CVN deadlines impose schedule constraints...Elements The context diagram shows how a CVN IT program SEP and IMS interact with COTS obsolescence , the CPA availability schedule , and other internal

  16. An MILP approach to shelf life integrated planning and scheduling in scalded sausage production

    DEFF Research Database (Denmark)

    Günther, H.O.; van Beek, P.; Grunow, Martin

    2006-01-01

    in which shelf life aspects are integrated into operational production planning and scheduling functions. Specifically we make use of so-called Mixed Integer Linear Programming (MILP) models. Our research is based on an industrial case study of yogurt production. Relying on the principle of block planning...

  17. Heat integration in multipurpose batch plants using a robust scheduling framework

    CSIR Research Space (South Africa)

    Seid, ER

    2014-07-01

    Full Text Available This case study was taken from the petro- chemical plant by Kallrath [46] and used as a benchmark problem in the scheduling environment for multipurpose batch plants. We adapted this case study to incorporate energy integration. The recipe representa- tion...

  18. Scheduling Network Traffic for Grid Purposes

    DEFF Research Database (Denmark)

    Gamst, Mette

    This thesis concerns scheduling of network traffic in grid context. Grid computing consists of a number of geographically distributed computers, which work together for solving large problems. The computers are connected through a network. When scheduling job execution in grid computing, data...... transmission has so far not been taken into account. This causes stability problems, because data transmission takes time and thus causes delays to the execution plan. This thesis proposes the integration of job scheduling and network routing. The scientific contribution is based on methods from operations...... research and consists of six papers. The first four considers data transmission in grid context. The last two solves the data transmission problem, where the number of paths per data connection is bounded from above. The thesis shows that it is possible to solve the integrated job scheduling and network...

  19. Job Satisfaction: A Possible Integration of Two Theories

    Science.gov (United States)

    Hazer, John T.

    1976-01-01

    A rationale for deciding which motivation methods to use for employees who have differing levels of satisfaction. Discusses pros and cons of two theories on job satisfaction--Herzberg's theory and the traditional theory--suggesting strongly a need to combine both ideas. (WL)

  20. Integrated Cost and Schedule using Monte Carlo Simulation of a CPM Model - 12419

    Energy Technology Data Exchange (ETDEWEB)

    Hulett, David T. [Hulett and Associates, LLC (United States); Nosbisch, Michael R. [Project Time and Cost, Inc. (United States)

    2012-07-01

    This discussion of the recommended practice (RP) 57R-09 of AACE International defines the integrated analysis of schedule and cost risk to estimate the appropriate level of cost and schedule contingency reserve on projects. The main contribution of this RP is to include the impact of schedule risk on cost risk and hence on the need for cost contingency reserves. Additional benefits include the prioritizing of the risks to cost, some of which are risks to schedule, so that risk mitigation may be conducted in a cost-effective way, scatter diagrams of time-cost pairs for developing joint targets of time and cost, and probabilistic cash flow which shows cash flow at different levels of certainty. Integrating cost and schedule risk into one analysis based on the project schedule loaded with costed resources from the cost estimate provides both: (1) more accurate cost estimates than if the schedule risk were ignored or incorporated only partially, and (2) illustrates the importance of schedule risk to cost risk when the durations of activities using labor-type (time-dependent) resources are risky. Many activities such as detailed engineering, construction or software development are mainly conducted by people who need to be paid even if their work takes longer than scheduled. Level-of-effort resources, such as the project management team, are extreme examples of time-dependent resources, since if the project duration exceeds its planned duration the cost of these resources will increase over their budgeted amount. The integrated cost-schedule risk analysis is based on: - A high quality CPM schedule with logic tight enough so that it will provide the correct dates and critical paths during simulation automatically without manual intervention. - A contingency-free estimate of project costs that is loaded on the activities of the schedule. - Resolves inconsistencies between cost estimate and schedule that often creep into those documents as project execution proceeds

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

  2. Occupations at Risk and Organizational Well-Being: An Empirical Test of a Job Insecurity Integrated Model.

    Science.gov (United States)

    Chirumbolo, Antonio; Urbini, Flavio; Callea, Antonino; Lo Presti, Alessandro; Talamo, Alessandra

    2017-01-01

    One of the more visible effects of the societal changes is the increased feelings of uncertainty in the workforce. In fact, job insecurity represents a crucial occupational risk factor and a major job stressor that has negative consequences on both organizational well-being and individual health. Many studies have focused on the consequences about the fear and the perception of losing the job as a whole (called quantitative job insecurity), while more recently research has begun to examine more extensively the worries and the perceptions of losing valued job features (called qualitative job insecurity). The vast majority of the studies, however, have investigated the effects of quantitative and qualitative job insecurity separately. In this paper, we proposed the Job Insecurity Integrated Model aimed to examine the effects of quantitative job insecurity and qualitative job insecurity on their short-term and long-term outcomes. This model was empirically tested in two independent studies, hypothesizing that qualitative job insecurity mediated the effects of quantitative job insecurity on different outcomes, such as work engagement and organizational identification (Study 1), and job satisfaction, commitment, psychological stress and turnover intention (Study 2). Study 1 was conducted on 329 employees in private firms, while Study 2 on 278 employees in both public sector and private firms. Results robustly showed that qualitative job insecurity totally mediated the effects of quantitative on all the considered outcomes. By showing that the effects of quantitative job insecurity on its outcomes passed through qualitative job insecurity, the Job Insecurity Integrated Model contributes to clarifying previous findings in job insecurity research and puts forward a framework that could profitably produce new investigations with important theoretical and practical implications.

  3. Occupations at Risk and Organizational Well-Being: An Empirical Test of a Job Insecurity Integrated Model

    Science.gov (United States)

    Chirumbolo, Antonio; Urbini, Flavio; Callea, Antonino; Lo Presti, Alessandro; Talamo, Alessandra

    2017-01-01

    One of the more visible effects of the societal changes is the increased feelings of uncertainty in the workforce. In fact, job insecurity represents a crucial occupational risk factor and a major job stressor that has negative consequences on both organizational well-being and individual health. Many studies have focused on the consequences about the fear and the perception of losing the job as a whole (called quantitative job insecurity), while more recently research has begun to examine more extensively the worries and the perceptions of losing valued job features (called qualitative job insecurity). The vast majority of the studies, however, have investigated the effects of quantitative and qualitative job insecurity separately. In this paper, we proposed the Job Insecurity Integrated Model aimed to examine the effects of quantitative job insecurity and qualitative job insecurity on their short-term and long-term outcomes. This model was empirically tested in two independent studies, hypothesizing that qualitative job insecurity mediated the effects of quantitative job insecurity on different outcomes, such as work engagement and organizational identification (Study 1), and job satisfaction, commitment, psychological stress and turnover intention (Study 2). Study 1 was conducted on 329 employees in private firms, while Study 2 on 278 employees in both public sector and private firms. Results robustly showed that qualitative job insecurity totally mediated the effects of quantitative on all the considered outcomes. By showing that the effects of quantitative job insecurity on its outcomes passed through qualitative job insecurity, the Job Insecurity Integrated Model contributes to clarifying previous findings in job insecurity research and puts forward a framework that could profitably produce new investigations with important theoretical and practical implications. PMID:29250013

  4. Occupations at Risk and Organizational Well-Being: An Empirical Test of a Job Insecurity Integrated Model

    Directory of Open Access Journals (Sweden)

    Antonio Chirumbolo

    2017-11-01

    Full Text Available One of the more visible effects of the societal changes is the increased feelings of uncertainty in the workforce. In fact, job insecurity represents a crucial occupational risk factor and a major job stressor that has negative consequences on both organizational well-being and individual health. Many studies have focused on the consequences about the fear and the perception of losing the job as a whole (called quantitative job insecurity, while more recently research has begun to examine more extensively the worries and the perceptions of losing valued job features (called qualitative job insecurity. The vast majority of the studies, however, have investigated the effects of quantitative and qualitative job insecurity separately. In this paper, we proposed the Job Insecurity Integrated Model aimed to examine the effects of quantitative job insecurity and qualitative job insecurity on their short-term and long-term outcomes. This model was empirically tested in two independent studies, hypothesizing that qualitative job insecurity mediated the effects of quantitative job insecurity on different outcomes, such as work engagement and organizational identification (Study 1, and job satisfaction, commitment, psychological stress and turnover intention (Study 2. Study 1 was conducted on 329 employees in private firms, while Study 2 on 278 employees in both public sector and private firms. Results robustly showed that qualitative job insecurity totally mediated the effects of quantitative on all the considered outcomes. By showing that the effects of quantitative job insecurity on its outcomes passed through qualitative job insecurity, the Job Insecurity Integrated Model contributes to clarifying previous findings in job insecurity research and puts forward a framework that could profitably produce new investigations with important theoretical and practical implications.

  5. Load Balancing Integrated Least Slack Time-Based Appliance Scheduling for Smart Home Energy Management

    Science.gov (United States)

    Silva, Bhagya Nathali; Khan, Murad; Han, Kijun

    2018-01-01

    The emergence of smart devices and smart appliances has highly favored the realization of the smart home concept. Modern smart home systems handle a wide range of user requirements. Energy management and energy conservation are in the spotlight when deploying sophisticated smart homes. However, the performance of energy management systems is highly influenced by user behaviors and adopted energy management approaches. Appliance scheduling is widely accepted as an effective mechanism to manage domestic energy consumption. Hence, we propose a smart home energy management system that reduces unnecessary energy consumption by integrating an automated switching off system with load balancing and appliance scheduling algorithm. The load balancing scheme acts according to defined constraints such that the cumulative energy consumption of the household is managed below the defined maximum threshold. The scheduling of appliances adheres to the least slack time (LST) algorithm while considering user comfort during scheduling. The performance of the proposed scheme has been evaluated against an existing energy management scheme through computer simulation. The simulation results have revealed a significant improvement gained through the proposed LST-based energy management scheme in terms of cost of energy, along with reduced domestic energy consumption facilitated by an automated switching off mechanism. PMID:29495346

  6. Load Balancing Integrated Least Slack Time-Based Appliance Scheduling for Smart Home Energy Management

    Directory of Open Access Journals (Sweden)

    Bhagya Nathali Silva

    2018-02-01

    Full Text Available The emergence of smart devices and smart appliances has highly favored the realization of the smart home concept. Modern smart home systems handle a wide range of user requirements. Energy management and energy conservation are in the spotlight when deploying sophisticated smart homes. However, the performance of energy management systems is highly influenced by user behaviors and adopted energy management approaches. Appliance scheduling is widely accepted as an effective mechanism to manage domestic energy consumption. Hence, we propose a smart home energy management system that reduces unnecessary energy consumption by integrating an automated switching off system with load balancing and appliance scheduling algorithm. The load balancing scheme acts according to defined constraints such that the cumulative energy consumption of the household is managed below the defined maximum threshold. The scheduling of appliances adheres to the least slack time (LST algorithm while considering user comfort during scheduling. The performance of the proposed scheme has been evaluated against an existing energy management scheme through computer simulation. The simulation results have revealed a significant improvement gained through the proposed LST-based energy management scheme in terms of cost of energy, along with reduced domestic energy consumption facilitated by an automated switching off mechanism.

  7. Load Balancing Integrated Least Slack Time-Based Appliance Scheduling for Smart Home Energy Management.

    Science.gov (United States)

    Silva, Bhagya Nathali; Khan, Murad; Han, Kijun

    2018-02-25

    The emergence of smart devices and smart appliances has highly favored the realization of the smart home concept. Modern smart home systems handle a wide range of user requirements. Energy management and energy conservation are in the spotlight when deploying sophisticated smart homes. However, the performance of energy management systems is highly influenced by user behaviors and adopted energy management approaches. Appliance scheduling is widely accepted as an effective mechanism to manage domestic energy consumption. Hence, we propose a smart home energy management system that reduces unnecessary energy consumption by integrating an automated switching off system with load balancing and appliance scheduling algorithm. The load balancing scheme acts according to defined constraints such that the cumulative energy consumption of the household is managed below the defined maximum threshold. The scheduling of appliances adheres to the least slack time (LST) algorithm while considering user comfort during scheduling. The performance of the proposed scheme has been evaluated against an existing energy management scheme through computer simulation. The simulation results have revealed a significant improvement gained through the proposed LST-based energy management scheme in terms of cost of energy, along with reduced domestic energy consumption facilitated by an automated switching off mechanism.

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

  9. Working atmosphere, job satisfaction and individual characteristics of community mental health professionals in integrated care.

    Science.gov (United States)

    Goetz, Katja; Kleine-Budde, Katja; Bramesfeld, Anke; Stegbauer, Constance

    2018-03-01

    Working requirements of community mental healthcare professionals in integrated care are complex. There is a lack of research concerning the relation of job satisfaction, working atmosphere and individual characteristics. For the current study, a survey evaluating job satisfaction and working atmosphere of mental healthcare professionals in integrated care was performed. About 321 community mental healthcare professionals were included in the survey; the response rate was 59.5%. The professional background of community mental healthcare professionals included nursing, social work and psychology. Community mental healthcare professionals reported the highest satisfaction with colleagues and the lowest satisfaction with income. Moreover, it could be shown that more responsibility, more recognition and more variety in job tasks lead to an increase of overall job satisfaction. Healthcare for mentally ill patients in the community setting is complex and requires well-structured care with appropriate responsibilities within the team. A co-operative relationship among colleagues as well as clearly defined responsibilities seem to be the key for the job satisfaction of community mental healthcare professionals in integrated care. © 2017 John Wiley & Sons Ltd.

  10. Perceived leader integrity and employee job satisfaction: A quantitative study of U.S. aerospace engineers

    Science.gov (United States)

    Harper, Kay E.

    The goal of this quantitative study was to determine if there is a significant relationship between perceived leader integrity and employee job satisfaction. The population selected to be analyzed was U.S. Aerospace engineers. Two existing valid and reliable survey instruments were used to collect data. One of the surveys was the Perceived Leader Integrity Scale developed by Craig and Gustafson. The second survey was the Minnesota Satisfaction Questionnaire created by Weiss, Dawis, England, and Lofquist. The public professional networking site LinkedIn was used to invite U.S. Aerospace engineers to participate. The survey results were monitored by Survey Monkey and the sample data was analyzed using SPSS software. 184 responses were collected and of those, 96 were incomplete. 91 usable survey responses were left to be analyzed. When the results were plotted on an x-y plot, the data line had a slight negative slope. The plotted data showed a very small negative relationship between perceived leader integrity and employee job satisfaction. This relationship could be interpreted to mean that as perceived leader integrity improved, employee job satisfaction decreased only slightly. One explanation for this result could be that employees focused on their negative feelings about their current job assignment when they did not have to be concerned about the level of integrity with which their leader acted. The findings of this study reinforce the importance of employee's perception of a critical leader quality - integrity. For future research, a longitudinal study utilizing another sampling method other than convenience sampling may better statistically capture the relationship between perceived leader integrity and employee job satisfaction for U.S. aerospace engineers.

  11. Multi-agent system for energy resource scheduling of integrated microgrids in a distributed system

    International Nuclear Information System (INIS)

    Logenthiran, T.; Srinivasan, Dipti; Khambadkone, Ashwin M.

    2011-01-01

    This paper proposes a multi-agent system for energy resource scheduling of an islanded power system with distributed resources, which consists of integrated microgrids and lumped loads. Distributed intelligent multi-agent technology is applied to make the power system more reliable, efficient and capable of exploiting and integrating alternative sources of energy. The algorithm behind the proposed energy resource scheduling has three stages. The first stage is to schedule each microgrid individually to satisfy its internal demand. The next stage involves finding the best possible bids for exporting power to the network and compete in a whole sale energy market. The final stage is to reschedule each microgrid individually to satisfy the total demand, which is the addition of internal demand and the demand from the results of the whole sale energy market simulation. The simulation results of a power system with distributed resources comprising three microgrids and five lumped loads show that the proposed multi-agent system allows efficient management of micro-sources with minimum operational cost. The case studies demonstrate that the system is successfully monitored, controlled and operated by means of the developed multi-agent system. (author)

  12. Mixed waste focus area integrated master schedule (current as of May 6, 1996)

    International Nuclear Information System (INIS)

    1996-01-01

    The mission of the Mixed Waste Characterization, Treatment, and Disposal Focus Area (MWFA) is to provide acceptable treatment systems, developed in partnership with users and with the participation of stakeholders, tribal governments, and regulators, that are capable of treating the Department of Energy's (DOE's) mixed wastes. In support of this mission, the MWTA produced the Mixed Waste Focus Area Integrated Technical Baseline Report, Phase I Volume 1, January 16, 1996, which identified a prioritized list of 30 national mixed waste technology deficiencies. The MWFA is targeting funding toward technology development projects that address the current list of deficiencies. A clear connection between the technology development projects and the EM-30 and EM-40 treatment systems that they support is essential for optimizing the MWFA efforts. The purpose of the Integrated Master Schedule (IMS) is to establish and document these connections and to ensure that all technology development activities performed by the MWFA are developed for timely use in those treatment systems. The IMS is a list of treatment systems from the Site Treatment Plans (STPs)/Consent Orders that have been assigned technology development needs with associated time-driven schedules, Technology deficiencies and associated technology development (TD) needs have been identified for each treatment system based on the physical, chemical, and radiological characteristics of the waste targeted for the treatment system. The schedule, the technology development activities, and the treatment system have been verified through the operations contact from the EM-30 organization at the site

  13. Multi-agent system for energy resource scheduling of integrated microgrids in a distributed system

    Energy Technology Data Exchange (ETDEWEB)

    Logenthiran, T.; Srinivasan, Dipti; Khambadkone, Ashwin M. [Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 117576 (Singapore)

    2011-01-15

    This paper proposes a multi-agent system for energy resource scheduling of an islanded power system with distributed resources, which consists of integrated microgrids and lumped loads. Distributed intelligent multi-agent technology is applied to make the power system more reliable, efficient and capable of exploiting and integrating alternative sources of energy. The algorithm behind the proposed energy resource scheduling has three stages. The first stage is to schedule each microgrid individually to satisfy its internal demand. The next stage involves finding the best possible bids for exporting power to the network and compete in a whole sale energy market. The final stage is to reschedule each microgrid individually to satisfy the total demand, which is the addition of internal demand and the demand from the results of the whole sale energy market simulation. The simulation results of a power system with distributed resources comprising three microgrids and five lumped loads show that the proposed multi-agent system allows efficient management of micro-sources with minimum operational cost. The case studies demonstrate that the system is successfully monitored, controlled and operated by means of the developed multi-agent system. (author)

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

  15. Delivering integrated care to the frail elderly: The impact on professionals’ objective burden and job satisfaction

    NARCIS (Netherlands)

    B. Janse (Benjamin); R. Huijsman (Robbert); R.D.M. de Kuyper (Ruben Dennis Maurice); I.N. Fabbricotti (Isabelle)

    2016-01-01

    textabstractBackground: The impact of integrated working on professionals’ objective burden and job satisfaction was examined. An evidence-based intervention targeting frail elderly patients was implemented in the Walcheren region of the Netherlands in 2010. The intervention involved the primary

  16. The Impact of Social Integration Interventions and Job Coaches in Work Settings.

    Science.gov (United States)

    Chadsey, Janis G.; Linneman, Dan; Rusch, Frank R.; Cimera, Robert E.

    1997-01-01

    A study investigated effects of two intervention strategies (contextual and coworker) on the social interactions and integration with peers of five workers with mental retardation. Neither intervention had a significant impact on the frequency of interactions; however, it appeared that the presence of a job coach suppressed interaction rates.…

  17. How job demands affect partners' experience of exhaustion : integrating work-family conflict and crossover theory

    NARCIS (Netherlands)

    Bakker, A.B.; Demerouti, E.; Dollard, M.F.

    2008-01-01

    This study among 168 couples of dual-earner parents uses insights from previous work-family conflict and crossover research to propose an integrative model delineating how job demands experienced by men and women carry over to the home domain. The authors hypothesized that for both men and women,

  18. Scheduling Model for Renewable Energy Sources Integration in an Insular Power System

    Directory of Open Access Journals (Sweden)

    Gerardo J. Osório

    2018-01-01

    Full Text Available Insular power systems represent an asset and an excellent starting point for the development and analysis of innovative tools and technologies. The integration of renewable energy resources that has taken place in several islands in the south of Europe, particularly in Portugal, has brought more uncertainty to production management. In this work, an innovative scheduling model is proposed, which considers the integration of wind and solar resources in an insular power system in Portugal, with a strong conventional generation basis. This study aims to show the benefits of increasing the integration of renewable energy resources in this insular power system, and the objectives are related to minimizing the time for which conventional generation is in operation, maximizing profits, reducing production costs, and consequently, reducing greenhouse gas emissions.

  19. Perceived Control and Psychological Contract Breach as Explanations of the Relationships Between Job Insecurity, Job Strain and Coping Reactions: Towards a Theoretical Integration.

    Science.gov (United States)

    Vander Elst, Tinne; De Cuyper, Nele; Baillien, Elfi; Niesen, Wendy; De Witte, Hans

    2016-04-01

    This study aims to further knowledge on the mechanisms through which job insecurity is related to negative outcomes. Based on appraisal theory, two explanations-perceived control and psychological contract breach-were theoretically integrated in a comprehensive model and simultaneously examined as mediators of the job insecurity-outcome relationship. Different categories of outcomes were considered, namely work-related (i.e. vigour and need for recovery) and general strain (i.e. mental and physical health complaints), as well as psychological (i.e. job satisfaction and organizational commitment) and behavioural coping reactions (i.e. self-rated performance and innovative work behaviour). The hypotheses were tested using data of a heterogeneous sample of 2413 Flemish employees by means of both single and multiple mediator structural equation modelling analyses (bootstrapping method). Particularly, psychological contract breach accounted for the relationship between job insecurity and strain. Both perceived control and psychological contract breach mediated the relationships between job insecurity and psychological coping reactions, although the indirect effects were larger for psychological contract breach. Finally, perceived control was more important than psychological contract breach in mediating the relationships between job insecurity and behavioural coping reactions. This study meets previous calls for a theoretical integration regarding mediators of the job insecurity-outcome relationship. Copyright © 2014 John Wiley & Sons, Ltd.

  20. Integration of Formal Job Hazard Analysis and ALARA Work Practice

    CERN Document Server

    Nelsen, D P

    2002-01-01

    ALARA work practices have traditionally centered on reducing radiological exposure and controlling contamination. As such, ALARA policies and procedures are not well suited to a wide range of chemical and human health issues. Assessing relative risk, identifying appropriate engineering/administrative controls and selecting proper Personal Protective Equipment (PPE) for non nuclear work activities extends beyond the limitations of traditional ALARA programs. Forging a comprehensive safety management program in today's (2002) work environment requires a disciplined dialog between health and safety professionals (e.g. safety, engineering, environmental, quality assurance, industrial hygiene, ALARA, etc.) and personnel working in the field. Integrating organizational priorities, maintaining effective pre-planning of work and supporting a team-based approach to safety management represents today's hallmark of safety excellence. Relying on the mandates of any single safety program does not provide industrial hygien...

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

  2. Maximizing work integration in job placement of individuals facing mental health problems: Supervisor experiences.

    Science.gov (United States)

    Skarpaas, Lisebet Skeie; Ramvi, Ellen; Løvereide, Lise; Aas, Randi Wågø

    2015-01-01

    Many people confronting mental health problems are excluded from participation in paid work. Supervisor engagement is essential for successful job placement. To elicit supervisor perspectives on the challenges involved in fostering integration to support individuals with mental health problems (trainees) in their job placement at ordinary companies. Explorative, qualitative designed study with a phenomenological approach, based on semi-structured interviews with 15 supervisors involved in job placements for a total of 105 trainees (mean 7, min-max. 1-30, SD 8). Data were analysed using qualitative content analysis. Superviors experience two interrelated dilemmas concerning knowledge of the trainee and degree of preferential treatment. Challenges to obtaining successful integration were; motivational: 1) Supervisors previous experience with trainees encourages future engagement, 2) Developing a realistic picture of the situation, and 3) Disclosure and knowledge of mental health problems, and continuity challenges: 4) Sustaining trainee cooperation throughout the placement process, 5) Building and maintaining a good relationship between supervisor and trainee, and 6) Ensuring continuous cooperation with the social security system and other stakeholders. Supervisors experience relational dilemmas regarding pre-judgment, privacy and equality. Job placement seem to be maximized when the stakeholders are motivated and recognize that cooperation must be a continuous process.

  3. Integrated Project Management: A Case Study in Integrating Cost, Schedule, Technical, and Risk Areas

    Science.gov (United States)

    Smith, Greg

    2004-01-01

    This viewgraph presentation describes a case study as a model for integrated project management. The ISS Program Office (ISSPO) developed replacement fluid filtration cartridges in house for the International Space Station (ISS). The presentation includes a step-by-step procedure and organizational charts for how the fluid filtration problem was approached.

  4. How job demands affect partners' experience of exhaustion: integrating work-family conflict and crossover theory.

    Science.gov (United States)

    Bakker, Arnold B; Demerouti, Evangelia; Dollard, Maureen F

    2008-07-01

    This study among 168 couples of dual-earner parents uses insights from previous work-family conflict and crossover research to propose an integrative model delineating how job demands experienced by men and women carry over to the home domain. The authors hypothesized that for both men and women, job demands foster their own work-family conflict (WFC), which in turn contributes to their partners' home demands, family-work conflict (FWC), and exhaustion. In addition, they hypothesized that social undermining mediates the relationship between individuals' WFC and their partners' home demands. The results of structural equation modeling analyses provided strong support for the proposed model. The hypothesis that gender would moderate the model relationships was rejected. These findings integrate previous findings on work-family conflict and crossover theories and suggest fluid boundaries between the work and home domains.

  5. Integrated care for mental health social inclusion through job placement: Implementing IPS in Spain

    OpenAIRE

    Koatz, Débora; Hilarión, Pilar; Bonet, Pere; Suñol, Rosa

    2016-01-01

    Introduction: Individual Placement and Support (IPS) is an integrated social, labor and mental health intervention with an important component of evidence for its effectiveness in helping people with severe mental disorders. Its objective is to obtain and maintain competitive jobs, increase social inclusion and quality of life, and while consuming fewer resources. In Europe, IPS model (which began 14 year ago) is currently implemented in four countries which share background with Dartmouth Co...

  6. A Computer-Based, Interactive Videodisc Job Aid and Expert System for Electron Beam Lithography Integration and Diagnostic Procedures.

    Science.gov (United States)

    Stevenson, Kimberly

    This master's thesis describes the development of an expert system and interactive videodisc computer-based instructional job aid used for assisting in the integration of electron beam lithography devices. Comparable to all comprehensive training, expert system and job aid development require a criterion-referenced systems approach treatment to…

  7. Delivering Integrated Care to the Frail Elderly: The Impact on Professionals’ Objective Burden and Job Satisfaction

    Directory of Open Access Journals (Sweden)

    Benjamin Janse

    2016-08-01

    Full Text Available Background: The impact of integrated working on professionals’ objective burden and job satisfaction was examined. An evidence-based intervention targeting frail elderly patients was implemented in the Walcheren region of the Netherlands in 2010. The intervention involved the primary care practice as a single entry point, and included proactive frailty screening, a comprehensive assessment of patient needs, case management, multidisciplinary teams, care plans and protocols, task delegation and task specialisation, a shared information system, a geriatric care network and integrated funding. Methods: A quasi-experimental design with a control group was used. Data regarding objective burden involved the professionals’ time investments over a 12-month period that were collected from patient medical records (n = 377 time registrations, transcripts of meetings and patient questionnaires. Data regarding job satisfaction were collected using questionnaires that were distributed to primary care and home-care professionals (n = 180 after the intervention’s implementation. Within- and between-groups comparisons and regression analyses were performed.  Results: Non-patient related time was significantly higher in the experimental group than in the control group, whereas patient-related time did not differ. Job satisfaction remained unaffected by the intervention. Conclusion and Discussion: Integrated working is likely to increase objective burden as it requires professionals to perform additional activities that are largely unrelated to actual patient care. Implications for research and practice are discussed. [Current Controlled Trials ISRCTN05748494].

  8. Shift schedule, work–family relationships, marital communication, job satisfaction and health among transport service shift workers

    Directory of Open Access Journals (Sweden)

    Irena Iskra-Golec

    2017-02-01

    Full Text Available Objectives: Existing research has documented that shiftwork consequences may depend on the shift system parameters. Fast rotating systems (1–3 shifts of the same kind in a row and day work have been found to be less disruptive biologically and socially than slower rotating systems and afternoon and night work. The aim of this study was to compare day workers and shift workers of different systems in terms of rotation speed and shifts worked with regard to work–family and family–work positive and negative spillover, marital communication style, job satisfaction and health. Material and Methods: Employees (N = 168 of the maintenance workshops of transportation service working different shift systems (day shift, weekly rotating 2 and 3‑shift system, and fast rotating 3-shift system participated in the study. They completed the Work– Family Spillover Questionnaire, Marital Communication Questionnaire, Minnesota Job Satisfaction Questionnaire and the Physical Health Questionnaire (a part of the Standard Shiftwork Index. Results: The workers of quicker rotating 3-shift systems reported significantly higher scores of family-to-work facilitation (F(3, 165 = 4.175, p = 0.007 and a higher level of constructive style of marital communication (Engagement F(3, 165 = 2.761, p = 0.044 than the workers of slower rotating 2-shift systems. There were no differences between the groups of workers with regard to health and job satisfaction. Conclusions: A higher level of work–family facilitation and a more constructive style of marital communication were found among the workers of faster rotating 3-shift system when compared to the workers of a slower rotating 2-shift system (afternoon, night. This may indicate that the fast rotating shift system in contrary to the slower rotating one is more friendly for the work and family domains and for the relationship between them. Int J Occup Med Environ Health 2017;30(1:121–131

  9. Integrated Campaign Probabilistic Cost, Schedule, Performance, and Value for Program Office Support

    Science.gov (United States)

    Cornelius, David; Sasamoto, Washito; Daugherty, Kevin; Deacon, Shaun

    2012-01-01

    This paper describes an integrated assessment tool developed at NASA Langley Research Center that incorporates probabilistic analysis of life cycle cost, schedule, launch performance, on-orbit performance, and value across a series of planned space-based missions, or campaign. Originally designed as an aid in planning the execution of missions to accomplish the National Research Council 2007 Earth Science Decadal Survey, it utilizes Monte Carlo simulation of a series of space missions for assessment of resource requirements and expected return on investment. Interactions between simulated missions are incorporated, such as competition for launch site manifest, to capture unexpected and non-linear system behaviors. A novel value model is utilized to provide an assessment of the probabilistic return on investment. A demonstration case is discussed to illustrate the tool utility.

  10. Integrated model for pricing, delivery time setting, and scheduling in make-to-order environments

    Science.gov (United States)

    Garmdare, Hamid Sattari; Lotfi, M. M.; Honarvar, Mahboobeh

    2018-03-01

    Usually, in make-to-order environments which work only in response to the customer's orders, manufacturers for maximizing the profits should offer the best price and delivery time for an order considering the existing capacity and the customer's sensitivity to both the factors. In this paper, an integrated approach for pricing, delivery time setting and scheduling of new arrival orders are proposed based on the existing capacity and accepted orders in system. In the problem, the acquired market demands dependent on the price and delivery time of both the manufacturer and its competitors. A mixed-integer non-linear programming model is presented for the problem. After converting to a pure non-linear model, it is validated through a case study. The efficiency of proposed model is confirmed by comparing it to both the literature and the current practice. Finally, sensitivity analysis for the key parameters is carried out.

  11. Integrated Scheduling of Production and Distribution with Release Dates and Capacitated Deliveries

    Directory of Open Access Journals (Sweden)

    Xueling Zhong

    2016-01-01

    Full Text Available This paper investigates an integrated scheduling of production and distribution model in a supply chain consisting of a single machine, a customer, and a sufficient number of homogeneous capacitated vehicles. In this model, the customer places a set of orders, each of which has a given release date. All orders are first processed nonpreemptively on the machine and then batch delivered to the customer. Two variations of the model with different objective functions are studied: one is to minimize the arrival time of the last order plus total distribution cost and the other is to minimize total arrival time of the orders plus total distribution cost. For the former one, we provide a polynomial-time exact algorithm. For the latter one, due to its NP-hard property, we provide a heuristic with a worst-case ratio bound of 2.

  12. Shift schedule, work-family relationships, marital communication, job satisfaction and health among transport service shift workers.

    Science.gov (United States)

    Iskra-Golec, Irena; Smith, Lawrence; Wilczek-Rużyczka, Ewa; Siemiginowska, Patrycja; Wątroba, Joanna

    2017-02-21

    Existing research has documented that shiftwork consequences may depend on the shift system parameters. Fast rotating systems (1-3 shifts of the same kind in a row) and day work have been found to be less disruptive biologically and socially than slower rotating systems and afternoon and night work. The aim of this study was to compare day workers and shift workers of different systems in terms of rotation speed and shifts worked with regard to work-family and family-work positive and negative spillover, marital communication style, job satisfaction and health. Employees (N = 168) of the maintenance workshops of transportation service working different shift systems (day shift, weekly rotating 2 and 3‑shift system, and fast rotating 3-shift system) participated in the study. They completed the Work- Family Spillover Questionnaire, Marital Communication Questionnaire, Minnesota Job Satisfaction Questionnaire and the Physical Health Questionnaire (a part of the Standard Shiftwork Index). The workers of quicker rotating 3-shift systems reported significantly higher scores of family-to-work facilitation (F(3, 165) = 4.175, p = 0.007) and a higher level of constructive style of marital communication (Engagement F(3, 165) = 2.761, p = 0.044) than the workers of slower rotating 2-shift systems. There were no differences between the groups of workers with regard to health and job satisfaction. A higher level of work-family facilitation and a more constructive style of marital communication were found among the workers of faster rotating 3-shift system when compared to the workers of a slower rotating 2-shift system (afternoon, night). This may indicate that the fast rotating shift system in contrary to the slower rotating one is more friendly for the work and family domains and for the relationship between them. Int J Occup Med Environ Health 2017;30(1):121-131. This work is available in Open Access model and licensed under a CC BY-NC 3.0 PL license.

  13. 25 CFR 26.22 - May a tribe integrate Job Placement and Training funds into its Public Law 102-477 Plan?

    Science.gov (United States)

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false May a tribe integrate Job Placement and Training funds... THE INTERIOR HUMAN SERVICES JOB PLACEMENT AND TRAINING PROGRAM General Applicability § 26.22 May a tribe integrate Job Placement and Training funds into its Public Law 102-477 Plan? Yes, Indian tribes...

  14. DESIGN OF A HYPERHEURISTIC FOR PRODUCTION SCHEDULING IN JOB SHOP ENVIRONMENTS DISEÑO DE UNA HIPERHEURISTICA PARA LA PROGRAMACION DE LA PRODUCCIÓN EN AMBIENTES JOB SHOP

    Directory of Open Access Journals (Sweden)

    Omar Danilo Castrillón

    2010-08-01

    Full Text Available The objective of the present work is to diminish the total process time (Makespan and to increase the machine process time, by diminishing the idle time in a job-shop environment. Through the design of a hyper-heuristic based on an ant colony and genetic algorithms. This work is developed in two phases: in the first phase, a hyper-heuristic identification and definition is carried out for sequencing processes in job shop environments. In the second phase, the system effectiveness in the traditional production programming is shown. In the investigation project, an enterprise from the metal mechanic sector was chosen, where by means of a combination of an ant colony and genetic algorithms, the optimal route for an order is scheduled, achieving the optimization or suboptimization of its respective total process time in an upper percentage of 95%.El objetivo del presente trabajo es disminuir el tiempo de proceso (Makespan e incrementar el tiempo de trabajo de las maquinas, diminuyendo el tiempo de ocio en ambientes de Job Shop, a través del diseño de una Hiper-heurística basada en colonia de hormigas y algoritmos genéticos. Este trabajo se desarrolla en dos etapas: en la primera se realiza la definición e identificación de una Hiper-heurística para la secuenciación de procesos en ambientes Job shop. En la segunda etapa, es mostrada la efectividad del sistema en la programación de la producción. En el proyecto de investigación, se seleccionó una empresa del sector metalmecánico, donde por medio de una combinación de colonia de hormigas y algoritmos genéticos, se programa la ruta óptima para un pedido, logrando la optimización o suboptimización de su respectivo tiempo total de proceso en un porcentaje superior al 95%.

  15. Integrated scheduling of renewable generation and electric vehicles parking lot in a smart microgrid

    International Nuclear Information System (INIS)

    Honarmand, Masoud; Zakariazadeh, Alireza; Jadid, Shahram

    2014-01-01

    Highlights: • Integrated operation of renewable generation and electric vehicles is presented. • The capability of electric vehicles in providing reserve has been analyzed. • A new electric vehicles charging/discharging management system is proposed. • The technical features of electric vehicle’s batteries are considered. - Abstract: Integration of Electric Vehicles (EVs) and Renewable Energy Sources (RESs) into the electric power system may bring up many technical issues. The power system may put at risk the security and reliability of operation due to intermittent nature of renewable generation and uncontrolled charging/discharging procedure of EVs. In this paper, an energy resources management model for a microgrid (MG) is proposed. The proposed method considers practical constraints, renewable power forecasting errors, spinning reserve requirements and EVs owner satisfaction. A case study with a typical MG including 200 EVs is used to illustrate the performance of the proposed method. The results show that the proposed energy resource scheduling method satisfies financial and technical goals of parking lot as well as the security and economic issues of MG. Moreover, EV owners could earn profit by discharging their vehicles’ batteries or providing the reserve capacity and finally have desired State Of Charge (SOC) in the departure time

  16. An unit cost adjusting heuristic algorithm for the integrated planning and scheduling of a two-stage supply chain

    Directory of Open Access Journals (Sweden)

    Jianhua Wang

    2014-10-01

    Full Text Available Purpose: The stable relationship of one-supplier-one-customer is replaced by a dynamic relationship of multi-supplier-multi-customer in current market gradually, and efficient scheduling techniques are important tools of the dynamic supply chain relationship establishing process. This paper studies the optimization of the integrated planning and scheduling problem of a two-stage supply chain with multiple manufacturers and multiple retailers to obtain a minimum supply chain operating cost, whose manufacturers have different production capacities, holding and producing cost rates, transportation costs to retailers.Design/methodology/approach: As a complex task allocation and scheduling problem, this paper sets up an INLP model for it and designs a Unit Cost Adjusting (UCA heuristic algorithm that adjust the suppliers’ supplying quantity according to their unit costs step by step to solve the model.Findings: Relying on the contrasting analysis between the UCA and the Lingo solvers for optimizing many numerical experiments, results show that the INLP model and the UCA algorithm can obtain its near optimal solution of the two-stage supply chain’s planning and scheduling problem within very short CPU time.Research limitations/implications: The proposed UCA heuristic can easily help managers to optimizing the two-stage supply chain scheduling problems which doesn’t include the delivery time and batch of orders. For two-stage supply chains are the most common form of actual commercial relationships, so to make some modification and study on the UCA heuristic should be able to optimize the integrated planning and scheduling problems of a supply chain with more reality constraints.Originality/value: This research proposes an innovative UCA heuristic for optimizing the integrated planning and scheduling problem of two-stage supply chains with the constraints of suppliers’ production capacity and the orders’ delivering time, and has a great

  17. Facilitating Integration of Electron Beam Lithography Devices with Interactive Videodisc, Computer-Based Simulation and Job Aids.

    Science.gov (United States)

    Von Der Linn, Robert Christopher

    A needs assessment of the Grumman E-Beam Systems Group identified the requirement for additional skill mastery for the engineers who assemble, integrate, and maintain devices used to manufacture integrated circuits. Further analysis of the tasks involved led to the decision to develop interactive videodisc, computer-based job aids to enable…

  18. Integrated Cost and Schedule Control Systems for Nuclear Power Plant Construction: Leveraging Strategic Advantages to Owners and EPC Firms

    Directory of Open Access Journals (Sweden)

    Youngsoo Jung

    2015-01-01

    Full Text Available As the owners expect that the cost and time for nuclear power plant construction would decrease with new entrants into the market, there will be severer competition in the nuclear industry. In order to achieve performance improvement and to attain competitive advantages under the globalized competition, practitioners and researchers in the nuclear industry have recently exerted efforts to develop an advanced and efficient management methodology for the nuclear mega-projects. Among several candidates, integrated cost and schedule control system is of great concern because it can effectively manage the three most important project performances including cost, time, and quality. In this context, the purpose of this paper is to develop a project numbering system (PNS of integrated cost and schedule control system for nuclear power plant construction. Distinct attributes of nuclear power plant construction were investigated first in order to identify influencing variables that characterize real-world implementation of advanced cost and schedule controls. A scenario was then developed and analysed to simulate a case-project. By using this case-project, proposed management requirements, management methods, measurement techniques, data structure, and data collection methods for integrated cost and schedule PNS were illustrated. Finally, findings and implications are outlined, and recommendations for further research are presented.

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

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

  1. Jobs, Jobs, Jobs!

    Science.gov (United States)

    Jacobson, Linda

    2011-01-01

    Teaching is not the safe career bet that it once was. The thinking used to be: New students will always be entering the public schools, and older teachers will always be retiring, so new teachers will always be needed. But teaching jobs aren't secure enough to stand up to the "Great Recession," as this drawn-out downturn has been called. Across…

  2. Limited access: gender, occupational composition, and flexible work scheduling.

    Science.gov (United States)

    Glauber, Rebecca

    2011-01-01

    The current study draws on national data to explore differences in access to flexible work scheduling by the gender composition of women's and men's occupations. Results show that those who work in integrated occupations are more likely to have access to flexible scheduling. Women and men do not take jobs with lower pay in return for greater access to flexibility. Instead, jobs with higher pay offer greater flexibility. Integrated occupations tend to offer the greatest access to flexible scheduling because of their structural locations. Part-time work is negatively associated with men's access to flexible scheduling but positively associated with women's access. Women have greater flexibility when they work for large establishments, whereas men have greater flexibility when they work for small establishments.

  3. BR-SIPP: PETROBRAS Integrated Scheduling System; BR-SIPP: Sistema Integrado de Progamacao de Producao da PETROBRAS

    Energy Technology Data Exchange (ETDEWEB)

    Pereira, Cristiane S.; Joly, Marcel; Hassimotto, Marcelo K.; Magalhaes, Marcus Vinicius O. [PETROBRAS S.A., Rio de Janeiro, RJ (Brazil)

    2008-07-01

    The lack of a computational aided technology to support short-term scheduling activity in the oil and petrochemical sector has been identified as one of the major obstacles to the harmonic integration of production objectives subsequent to the implementation of the advanced control systems and the consolidation of important benefits at the process unit level. Such technology refers to an analytical tool able to capture plant operational information consistent with the scheduling layer demands, modeling the production system economic performance, and providing mechanisms to consider commercial, operation and technological uncertainties. In this context, PETROBRAS has continuously dedicated effort to develop, implement and enhance its own refinery scheduling solution. Nowadays at its second version, the PETROBRAS Integrated Scheduling System (BR-SIPP - INPI grant 00067400) has become the focus of corporate care, given its critical role on the link between planning objectives and plant operations, according to the hierarchical decision strategy currently adopted by PETROBRAS. This paper presents an overview of the tool and illustrates some real-world applications and main realized benefits. (author)

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

  5. Peer-to-peer Cooperative Scheduling Architecture for National Grid Infrastructure

    Science.gov (United States)

    Matyska, Ludek; Ruda, Miroslav; Toth, Simon

    For some ten years, the Czech National Grid Infrastructure MetaCentrum uses a single central PBSPro installation to schedule jobs across the country. This centralized approach keeps a full track about all the clusters, providing support for jobs spanning several sites, implementation for the fair-share policy and better overall control of the grid environment. Despite a steady progress in the increased stability and resilience to intermittent very short network failures, growing number of sites and processors makes this architecture, with a single point of failure and scalability limits, obsolete. As a result, a new scheduling architecture is proposed, which relies on higher autonomy of clusters. It is based on a peer to peer network of semi-independent schedulers for each site or even cluster. Each scheduler accepts jobs for the whole infrastructure, cooperating with other schedulers on implementation of global policies like central job accounting, fair-share, or submission of jobs across several sites. The scheduling system is integrated with the Magrathea system to support scheduling of virtual clusters, including the setup of their internal network, again eventually spanning several sites. On the other hand, each scheduler is local to one of several clusters and is able to directly control and submit jobs to them even if the connection of other scheduling peers is lost. In parallel to the change of the overall architecture, the scheduling system itself is being replaced. Instead of PBSPro, chosen originally for its declared support of large scale distributed environment, the new scheduling architecture is based on the open-source Torque system. The implementation and support for the most desired properties in PBSPro and Torque are discussed and the necessary modifications to Torque to support the MetaCentrum scheduling architecture are presented, too.

  6. Using system architecture, review entry criteria, and standard work package data to enable rapid development of integrated master schedules

    OpenAIRE

    Porter, Burton W., Jr.

    2016-01-01

    Approved for public release; distribution is unlimited While engineers must participate in the construction of the Integrated Master Schedule, this thesis proposes a way to reduce that effort through automation. When standardized sub processes exist, automated task name construction with consistent action/object naming convention can be applied to multiple system artifacts. These repeating sub processes also allow the derivation of task sequence and dependencies. The Architecture-Based Uti...

  7. Approximating Preemptive Stochastic Scheduling

    OpenAIRE

    Megow Nicole; Vredeveld Tjark

    2009-01-01

    We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as their analysis apply also to the recently introduced more general model of stochastic online scheduling. The performance guarantee we give matches the best result known for the corresponding determinist...

  8. Integrated Optimization of Service-Oriented Train Plan and Schedule on Intercity Rail Network with Varying Demand

    Directory of Open Access Journals (Sweden)

    Wenliang Zhou

    2015-01-01

    Full Text Available For a better service level of a train operating plan, we propose an integrated optimization method of train planning and train scheduling, which generally are optimized, respectively. Based on the cost analysis of both passengers travelling and enterprises operation, and the constraint analysis of trains operation, we construct a multiobjective function and build an integrated optimization model with the aim of reducing both passenger travel costs and enterprise operating costs. Then, a solving algorithm is established based on the simulated annealing algorithm. Finally, using as an example the Changzhutan intercity rail network, as an example we analyze the optimized results and the influence of the model parameters on the results.

  9. How employees negotiate : job autonomy and negotiation self-efficacy related to integrative negotiation and negotiation results in employment relationships

    NARCIS (Netherlands)

    Oeij, P.

    2006-01-01

    To assess whether satisfaction with psychological contract breach does more depend on good negotiation skills or on a well-designed job, we first investigated the effect of negotiation self-efficacy and task autonomy on integrative negotiation with survey data from employees of a telecom company. We

  10. Optimal Scheduling of a Battery Energy Storage System with Electric Vehicles’ Auxiliary for a Distribution Network with Renewable Energy Integration

    Directory of Open Access Journals (Sweden)

    Yuqing Yang

    2015-09-01

    Full Text Available With global conventional energy depletion, as well as environmental pollution, utilizing renewable energy for power supply is the only way for human beings to survive. Currently, distributed generation incorporated into a distribution network has become the new trend, with the advantages of controllability, flexibility and tremendous potential. However, the fluctuation of distributed energy resources (DERs is still the main concern for accurate deployment. Thus, a battery energy storage system (BESS has to be involved to mitigate the bad effects of DERs’ integration. In this paper, optimal scheduling strategies for BESS operation have been proposed, to assist with consuming the renewable energy, reduce the active power loss, alleviate the voltage fluctuation and minimize the electricity cost. Besides, the electric vehicles (EVs considered as the auxiliary technique are also introduced to attenuate the DERs’ influence. Moreover, both day-ahead and real-time operation scheduling strategies were presented under the consideration with the constraints of BESS and the EVs’ operation, and the optimization was tackled by a fuzzy mathematical method and an improved particle swarm optimization (IPSO algorithm. Furthermore, the test system for the proposed strategies is a real distribution network with renewable energy integration. After simulation, the proposed scheduling strategies have been verified to be extremely effective for the enhancement of the distribution network characteristics.

  11. Integrating planning and scheduling in an oil refinery with a rolling horizon approach

    NARCIS (Netherlands)

    Zondervan, E.; Kaland, M.; van Elzakker, M.A.H.; Fransoo, J.C.; Meuldijk, J.; Klemes, J.J.; Varbanov, P.S.; Liew, P.Y.

    2014-01-01

    Decisions in an oil refinery are made at three levels: planning, scheduling and control. Existing facilities have to be operated close to their maximum capacity, while continuously responding to cost fluctuations. In many of the currently reported planning models each decision level has its own

  12. Mechanisms for scheduling games with selfish players

    NARCIS (Netherlands)

    Hoeksma, R.P.

    2015-01-01

    Many challenges in operations research involve optimization. In particular, scheduling treats the optimal planning of tasks. This thesis focuses on machine scheduling models, where a number of tasks, called jobs, need to be scheduled on one or more machines. The outcome is determined by which job is

  13. Speed Synchronization Control of Integrated Motor–Transmission Powertrain over CAN through Active Period-Scheduling Approach

    Directory of Open Access Journals (Sweden)

    Wanke Cao

    2017-11-01

    Full Text Available This paper deals with the speed synchronization control of integrated motor–transmission (IMT powertrain systems in pure electric vehicles (EVs over a controller area network (CAN subject to both network-induced delays and network congestion. A CAN has advantages over point-to-point communication; however, it imposes network-induced delays and network congestion into the control system, which can deteriorate the shifting quality and make system integration difficult. This paper presents a co-design scheme combining active period scheduling and discrete-time slip mode control (SMC to deal with both network-induced delays and network congestion of the CAN, which improves the speed synchronization control for high shifting quality and prevents network congestion for the system’s integration. The results of simulations and hardware-in-loop experiments show the effectiveness of the proposed scheme, which can ensure satisfactory speed synchronization performance while significantly reducing the network’s utilization.

  14. A systems integration approach to the optimum operation and scheduling of biocide usage and discharge for seawater cooling systems

    KAUST Repository

    Mahfouz, Abdullah Bin

    2012-01-01

    The objective of this work is to develop a systematic approach to the optimal design and integration of seawater cooling systems in industrial facilities along with the usage and discharge of biocides. Specifically, the paper will address the following tasks: 1 identification of the reaction pathways for the biocide from the mixing basin to the discharge points 2 kinetic modelling of the biocide and by-products throughout the process 3 a process integration framework to provide a holistic approach to optimising the design and operation of the seawater cooling systems, along with the dosage and discharge systems. A hierarchical procedure is developed to first identify design modifications for heat integration and energy efficiency. Then, a multi-period, multi-segment optimisation formulation is developed and solved to identify the optimal operation and scheduling of biocide usage and discharge. A case study is solved to illustrate the applicability of the devised approach.

  15. Integration of a full co-op job experience (and direct job-placement) with an applied physics curriculum

    Science.gov (United States)

    Russell, Daniel

    2002-03-01

    Kettering University, formerly GMI Engineering & Management Institute, is a fully co-operational private institution offering bachelor's degrees in engineering, applied science, and management. The Applied Physics degree program was established in 1995 and our current freshman class has 11 students. The program takes 5 years to complete, during which time students alternate between 11 weeks in the classroom and 11 weeks at a co-op job at one of over 600 companies at over 800 locations around the world. All students, including applied physics majors, are required to complete a minimum of five co-op terms in order to graduate. In addition, they are required to complete a senior thesis of benefit to their company, a project which usually takes about six months (two co-op terms). In this talk we will describe the co-op program as it currently exists at Kettering and summarize the co-op experiences of our current applied physics students and our recent graduates. We will discuss how our curriculum has been designed to take advantage of and support the co-op experience. In addition we will discuss some of the challenges our students and faculty have encountered in the process of finding co-op sponsors.

  16. A matheuristic for transfer synchronization through integrated timetabling and vehicle scheduling

    DEFF Research Database (Denmark)

    Fonseca, João Paiva; van der Hurk, Evelien; Roberti, Roberto

    2018-01-01

    Long transfer times often add unnecessary inconvenience to journeys in public transport systems. Synchronizing relevant arrival and departure times through small timetable modifications could reduce excess transfer times, but may also directly affect the operational costs, as the timetable defines...... the set of feasible vehicle schedules. Therefore better results in terms of passenger service, operational costs, or both, could be obtained by solving these problems simultaneously....

  17. Load Balancing Integrated Least Slack Time-Based Appliance Scheduling for Smart Home Energy Management

    OpenAIRE

    Bhagya Nathali Silva; Murad Khan; Kijun Han

    2018-01-01

    The emergence of smart devices and smart appliances has highly favored the realization of the smart home concept. Modern smart home systems handle a wide range of user requirements. Energy management and energy conservation are in the spotlight when deploying sophisticated smart homes. However, the performance of energy management systems is highly influenced by user behaviors and adopted energy management approaches. Appliance scheduling is widely accepted as an effective mechanism to manage...

  18. Integration of a Course Enrolment and Class Timetable Scheduling in a Student Information System

    OpenAIRE

    Vangel V. Ajanovski

    2013-01-01

    This paper is dealing with the most important issues of two of the most significant university administrativeprocesses – the process of term enrolment with course enrolment and the process of organization of classesand scheduling a conflict-free class timetable. In the first part of the paper an introduction to the problemis set and the impact and interrelation of the two processes is explained in detail. In the second part of thepaper, the focus is on the process of class timetable schedulin...

  19. A new self-scheduling strategy for integrated operation of wind and pumped-storage power plants in power markets

    International Nuclear Information System (INIS)

    Varkani, Ali Karimi; Daraeepour, Ali; Monsef, Hassan

    2011-01-01

    Highlights: → A strategy for integrated operation of wind and pumped-storage plants is proposed. → Participation of both plants in energy and ancillary service markets is modeled. → The uncertainty of wind production is modeled by a novel probabilistic function. → The proposed strategy is tested on a real case in the Spanish electricity market. -- Abstract: Competitive structure of power markets causes various challenges for wind resources to participate in these markets. Indeed, production uncertainty is the main cause of their low income. Thus, they are usually supported by system operators, which is in contrast with the competitive paradigm of power markets. In this paper, a new strategy for increasing the profits of wind resources is proposed. In the suggested strategy, a Generation Company (GenCo), who owns both wind and pumped-storage plants, self-schedules the integrated operation of them regarding the uncertainty of wind power generation. For presenting an integrated self-schedule and obtaining a real added value of the strategy, participation of the GenCo in energy and ancillary service markets is modeled. The self-scheduling strategy is based on stochastic programming techniques. Outputs of the problem include generation offers in day-ahead energy market and ancillary service markets, including spinning and regulation reserve markets. A Neural Network (NN) based technique is used for modeling the uncertainty of wind power production. The proposed strategy is tested on a real wind farm in mainland, Spain. Moreover, added value of the strategy is presented in different conditions of the market.

  20. Benefit Opportunities for Integrated Surface and Airspace Departure Scheduling: A Study of Operations at Charlotte-Douglas International Airport

    Science.gov (United States)

    Coppenbarger, Rich; Jung, Yoon; Kozon, Tom; Farrahi, Amir; Malik, Wakar; Lee, Hanbong; Chevalley, Eric; Kistler, Matt

    2016-01-01

    NASA is collaborating with the FAA and aviation industry to develop and demonstrate new capabilities that integrate arrival, departure, and surface air-traffic operations. The concept relies on trajectory-based departure scheduling and collaborative decision making to reduce delays and uncertainties in taxi and climb operations. The paper describes the concept and benefit mechanisms aimed at improving flight efficiency and predictability while maintaining or improving operational throughput. The potential impact of the technology is studied and discussed through a quantitative analysis of relevant shortfalls at the site identified for initial deployment and demonstration in 2017: Charlotte-Douglas International Airport. Results from trajectory analysis indicate substantial opportunity to reduce taxi delays for both departures and arrivals by metering departures at the gate in a manner that maximizes throughput while adhering to takeoff restrictions due mostly to airspace constraints. Substantial taxi-out delay reduction is shown for flights subject to departure restrictions stemming from traffic flow management initiatives. Opportunities to improve the predictability of taxi, takeoff, and climb operations are examined and their potential impact on airline scheduling decisions and air-traffic forecasting is discussed. In addition, the potential to improve throughput with departure scheduling that maximizes use of available runway and airspace capacity is analyzed.

  1. Integrating make-to-order and make-to-stock in job shop control

    NARCIS (Netherlands)

    Beemsterboer, Bart; Land, Martin; Teunter, Ruud; Bokhorst, Jos

    2017-01-01

    Demand fluctuations in make-to-order job shops lead to utilisation fluctuations and delivery delays, particularly in periods with high demand. Many job shop production companies therefore include some standardised products in their product mix and use a hybrid make-to-order/ make-to-stock production

  2. Integrated sizing and scheduling of wind/PV/diesel/battery isolated systems

    KAUST Repository

    Malheiro, André

    2015-05-22

    In this paper we address the optimal sizing and scheduling of isolated hybrid systems using an optimization framework. The hybrid system features wind and photovoltaic conversion systems, batteries and diesel backup generators to supply electricity demand. A Mixed-Integer Linear Programming formulation is used to model system behavior over a time horizon of one year, considering hourly changes in both the availability of renewable resources and energy demand. The optimal solution is achieved with respect to the minimization of the levelized cost of energy (LCOE) over a lifetime of 20 years. Results for a case study show that the most economical solution features all four postulated subsystems. © 2015 Elsevier Ltd.

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

  4. Integrated sizing and scheduling of wind/PV/diesel/battery isolated systems

    KAUST Repository

    Malheiro, André ; Castro, Pedro M.; Lima, Ricardo; Estanqueiro, Ana; Estanqueiro, Ana

    2015-01-01

    In this paper we address the optimal sizing and scheduling of isolated hybrid systems using an optimization framework. The hybrid system features wind and photovoltaic conversion systems, batteries and diesel backup generators to supply electricity demand. A Mixed-Integer Linear Programming formulation is used to model system behavior over a time horizon of one year, considering hourly changes in both the availability of renewable resources and energy demand. The optimal solution is achieved with respect to the minimization of the levelized cost of energy (LCOE) over a lifetime of 20 years. Results for a case study show that the most economical solution features all four postulated subsystems. © 2015 Elsevier Ltd.

  5. Split Scheduling with Uniform Setup Times

    NARCIS (Netherlands)

    Schalekamp, F.; Sitters, R.A.; van der Ster, S.L.; Stougie, L.; Verdugo, V.; van Zuylen, A.

    2015-01-01

    We study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the machine where the job part is processed. During setup, a machine cannot process or

  6. Split scheduling with uniform setup times.

    NARCIS (Netherlands)

    F. Schalekamp; R.A. Sitters (René); S.L. van der Ster; L. Stougie (Leen); V. Verdugo; A. van Zuylen

    2015-01-01

    htmlabstractWe study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the machine where the job part is processed. During setup, a

  7. A New Method Based on Simulation-Optimization Approach to Find Optimal Solution in Dynamic Job-shop Scheduling Problem with Breakdown and Rework

    Directory of Open Access Journals (Sweden)

    Farzad Amirkhani

    2017-03-01

    The proposed method is implemented on classical job-shop problems with objective of makespan and results are compared with mixed integer programming model. Moreover, the appropriate dispatching priorities are achieved for dynamic job-shop problem minimizing a multi-objective criteria. The results show that simulation-based optimization are highly capable to capture the main characteristics of the shop and produce optimal/near-optimal solutions with highly credibility degree.

  8. Age and reemployment success after job loss: An integrative model and meta-analysis.

    Science.gov (United States)

    Wanberg, Connie R; Kanfer, Ruth; Hamann, Darla J; Zhang, Zhen

    2016-04-01

    Despite widespread popular concern about what it means to be over 40 and unemployed, little attention has been paid in the literature to clarifying the role of age within the job seeking experience. Extending theory, we propose mechanisms by which chronological age affects job search and reemployment outcomes after job loss. Through a meta-analysis and examination of 2 supplemental datasets, we examine 5 questions: (a) How strong is the relationship between age and reemployment speed? (b) Does age disadvantage individuals with respect to other reemployment outcomes? (c) Is the relationship between age and reemployment outcomes mediated by job search activities? (d) Are these relationships generalizable? and (e) Are these relationships linear or curvilinear? Our findings provide evidence for a negative relationship between age and reemployment status and speed across job search decade, world region, and unemployment rate, with the strength of the negative relationship becoming stronger over age 50. Job search self-efficacy and job search intensity partially mediate the relationship between age and both reemployment status and speed. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

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

  10. Integrating Self-Determination and Job Demands-Resources Theory in Predicting Mental Health Provider Burnout.

    Science.gov (United States)

    Dreison, Kimberly C; White, Dominique A; Bauer, Sarah M; Salyers, Michelle P; McGuire, Alan B

    2018-01-01

    Limited progress has been made in reducing burnout in mental health professionals. Accordingly, we identified factors that might protect against burnout and could be productive focal areas for future interventions. Guided by self-determination theory, we examined whether supervisor autonomy support, self-efficacy, and staff cohesion predict provider burnout. 358 staff from 13 agencies completed surveys. Higher levels of supervisor autonomy support, self-efficacy, and staff cohesion were predictive of lower burnout, even after accounting for job demands. Although administrators may be limited in their ability to reduce job demands, our findings suggest that increasing core job resources may be a viable alternative.

  11. Effect of integrated plant nutrition and irrigation scheduling on yield and yield components of maize (zea mays l.)

    International Nuclear Information System (INIS)

    Randhawa, M.S.; Maqsood, M.; Wajid, S.A.; Haq, A.U.

    2012-01-01

    Effect of three irrigation schedules (4-6 irrigations) and seven integrated plant nutrition levels (control, 125-60-62 kg N-P/sub 2/O/sub 5/-K/sub 2/O ha/sup -1/, 125-60-62 kg N-P/sub 2/O/sub 5/--K/sub 2/O ha/sup -1/ + Farmyard manure at the rate 10 t ha/sup -1/, 125-60-62 kg N-P/sub 2/O/sub 5/-K/sub 2/O ha/sup -1/ + Farm yard manure at the rate 15 t ha-1, 250-120-125 kg N-P/sub 2/O/sub 5/--K/sub 2/O ha-1, 250-120-125 kg N-P/sub 2/O/sub 5/ -K/sub 2/O ha/sup -1/ + Farmyard manure at the rate 10 t ha-1 and 250-120-125 kg N-P/sub 2/O/sub 5/--K/sub 2/O ha/sup -1/ + Farmyard manure at the rate 15 t ha/sup -1/) on grain yield and its components in maize were studied during 2009 and 2010. Plant height, number of cobs plant-1, number of grain rows cob-1, number of grains cob-1, 1000-grain weight, grain weight cob-1, grain yield, stover yield and biological yield were significantly affected by irrigation schedules and integrated plant nutrition levels during both years. The crop applied with six irrigations and fertilized by integrated application of chemical fertilizers (250-120-125 kg N-P/sub 2/O/sub 5/--K/sub 2/O ha/sup -1/) and farmyard manure (15 t ha/sup -1/) produced the highest grain yield of 8.47 t ha/sup -1/ and 8.22 t ha/sup -1/ during 2009 and 2010, respectively. (author)

  12. Multiagent scheduling models and algorithms

    CERN Document Server

    Agnetis, Alessandro; Gawiejnowicz, Stanisław; Pacciarelli, Dario; Soukhal, Ameur

    2014-01-01

    This book presents multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. It discusses complexity results, approximation schemes, heuristics and exact algorithms.

  13. Optimal Scheduling of an Regional Integrated Energy System with Energy Storage Systems for Service Regulation

    Directory of Open Access Journals (Sweden)

    Hengrui Ma

    2018-01-01

    Full Text Available Ancillary services are critical to maintaining the safe and stable operation of power systems that contain a high penetration level of renewable energy resources. As a high-quality regulation resource, the regional integrated energy system (RIES with energy storage system (ESS can effectively adjust the non-negligible frequency offset caused by the renewable energy integration into the power system, and help solve the problem of power system frequency stability. In this paper, the optimization model aiming at regional integrated energy system as a participant in the regulation market based on pay-for-performance is established. Meanwhile YALMIP + CPLEX is used to simulate and analyze the total operating cost under different dispatch modes. This paper uses the actual operation model of the PJM regulation market to guide the optimal allocation of regulation resource in the regional integrated energy system, and provides a balance between the power trading revenue and regulation market revenue in order to achieve the maximum profit.

  14. How useful are preemptive schedules?

    NARCIS (Netherlands)

    Brucker, P.; Heitmann, S.; Hurink, J.L.

    2001-01-01

    Machine scheduling admits two options to process jobs. In a preemptive mode processing may be interrupted and resumed later even on a different machine. In a nonpreemptive mode interruptions are not allowed. Usually, the possibility to preempt jobs leads to better performance values. However, also

  15. Stochastic scheduling on unrelated machines

    NARCIS (Netherlands)

    Skutella, Martin; Sviridenko, Maxim; Uetz, Marc Jochen

    2013-01-01

    Two important characteristics encountered in many real-world scheduling problems are heterogeneous machines/processors and a certain degree of uncertainty about the actual sizes of jobs. The first characteristic entails machine dependent processing times of jobs and is captured by the classical

  16. Work schedules, childcare and well-being : Essays on the associations between modern-day job characteristics, childcare arrangements and the well-being of parents and children

    NARCIS (Netherlands)

    Verhoef, M.

    2017-01-01

    Arranging care for children can be challenging for working parents, especially when parents do not work a nine-to-five weekday schedule. With the recent increase in the proportion of parents who work during evenings, nights and weekends, so-called nonstandard hours, the timing of parental work has

  17. Perceived Causes of Job Stress among Special Educators in Selected Special and Integrated Schools in Nigeria

    Science.gov (United States)

    Adeniyi, S. O.; Fakolade, Olufemi Aremum; Tella, Adeyinka

    2010-01-01

    Background: Efficient and effective performance on any job depend largely on good psychological well being of the workers as well as other factors such as conducive environment, good interpersonal relationship, adequate communication among staff and between staff and management, work load, remuneration and other physical and psychological boosting…

  18. Flexible Work Schedules. ERIC Digest.

    Science.gov (United States)

    Kerka, Sandra

    Flexible work schedules are one response to changes in the composition of the work force, new life-styles, and changes in work attitudes. Types of alternative work schedules are part-time and temporary employment, job sharing, and flextime. Part-time workers are a diverse group--women, the very young, and older near-retirees. Although part-time…

  19. The power of reordering for online minimum makespan scheduling

    OpenAIRE

    Englert, Matthias; Özmen, Deniz; Westermann, Matthias

    2014-01-01

    In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machines. The objective is to minimize the makespan, which is the time it takes until all jobs are processed. In this paper, we consider online scheduling algorithms without preemption. However, we do not require that each arriving job has to be assigned immediately to one of the machines. A reordering buffer with limited...

  20. Decay-usage scheduling in multiprocessors

    NARCIS (Netherlands)

    Epema, D.H.J.

    1998-01-01

    Decay-usage scheduling is a priority-aging time-sharing scheduling policy capable of dealing with a workload of both interactive and batch jobs by decreasing the priority of a job when it acquires CPU time, and by increasing its priority when it does not use the (a) CPU. In this article we deal with

  1. Optimal Scheduling of Integrated Energy Systems with Combined Heat and Power Generation, Photovoltaic and Energy Storage Considering Battery Lifetime Loss

    Directory of Open Access Journals (Sweden)

    Yongli Wang

    2018-06-01

    Full Text Available Integrated energy systems (IESs are considered a trending solution for the energy crisis and environmental problems. However, the diversity of energy sources and the complexity of the IES have brought challenges to the economic operation of IESs. Aiming at achieving optimal scheduling of components, an IES operation optimization model including photovoltaic, combined heat and power generation system (CHP and battery energy storage is developed in this paper. The goal of the optimization model is to minimize the operation cost under the system constraints. For the optimization process, an optimization principle is conducted, which achieves maximized utilization of photovoltaic by adjusting the controllable units such as energy storage and gas turbine, as well as taking into account the battery lifetime loss. In addition, an integrated energy system project is taken as a research case to validate the effectiveness of the model via the improved differential evolution algorithm (IDEA. The comparison between IDEA and a traditional differential evolution algorithm shows that IDEA could find the optimal solution faster, owing to the double variation differential strategy. The simulation results in three different battery states which show that the battery lifetime loss is an inevitable factor in the optimization model, and the optimized operation cost in 2016 drastically decreased compared with actual operation data.

  2. UN ALGORITMO GENÉTICO HÍBRIDO Y UN ENFRIAMIENTO SIMULADO PARA SOLUCIONAR EL PROBLEMA DE PROGRAMACIÓN DE PEDIDOS JOB SHOP UM ALGORITMO GENÉTICO HÍBRIDO E UM ESFRIAMENTO SIMULADO PARA SOLUCIONAR O PROBLEMA DE PROGRAMAÇÃO DE PEDIDOS JOB SHOP A HYBRID GENETIC ALGORITHM AND A SIMULATED ANNEALING FOR SOLVING THE JOB SHOP SCHEDULING PROBLEM

    Directory of Open Access Journals (Sweden)

    José David Meisel

    2010-07-01

    mostraram que os algoritmos propostos arrojam bons resultados, com desvios ao redor dos melhores valores achados que não superam 5 % para os problemas mais complexos.Job Shop Scheduling Problem (JSP, classified as NP-Hard, has been a challenge for the scientific community because achieving an optimal solution to this problem is complicated as it grows in number of machines and jobs. Numerous techniques, including metaheuristics, have been used for its solution; however, the efficiency of the techniques, in terms of computational time, has not been very satisfactory. Because of this and for contributing to the solution of this problem, a simulated annealing (SA and an improved genetic algorithm (IGA have been proposed. The latter, by implementing a strategy of simulated annealing in the mutation phase, allows the algorithm to enhance and diversify the solutions at the same time, in order not to converge prematurely to a local optimum. The results showed that the proposed algorithms yield good results with deviations around the best values found not exceeding 5 % for more complex problems.

  3. An integrated modeling framework for real-time irrigation scheduling: the benefit of spectroscopy and weather forecasts

    Science.gov (United States)

    Brook, Anna; Polinova, Maria; Housh, Mashor

    2016-04-01

    and short-term weekly forecasts. In order to optimize the water resource use, the irrigation scheduling will be defined by use a simulation model of soil-plant and atmosphere system (e.g. SWAP model, Van Dam et al., 2008). The use of this tool is necessary to: i) take into account the soil spatial variability; ii) to predict the system behaviour under the forecasted climate; iii) define the optimized irrigation water volumes. Given this knowledge in the three domains of optimization under uncertainty, spectroscopy/remote sensing and climate forecasting, we will be presented as an integrated framework for deriving optimal irrigation decisions. References Nelson, Gerald C., et al. Climate change: Impact on agriculture and costs of adaptation. Vol. 21. Intl Food Policy Res Inst, 2009. Housh, Mashor, Avi Ostfeld, and Uri Shamir. "Seasonal multi-year optimal management of quantities and salinities in regional water supply systems." Environmental Modelling & Software 37 (2012): 55-67. Wang, Dingbao, and Ximing Cai. "Irrigation scheduling - Role of weather forecasting and farmers' behavior." Journal of Water Resources Planning and Management 135.5 (2009): 364-372. Van Dam, J. C., et al. SWAP version 3.2: Theory description and user manual. No. 1649. Wageningen, The Netherlands: Alterra, 2008.

  4. Job Sharing: An Employment Alternative for the Career Services Professional.

    Science.gov (United States)

    Johnson, Louise; Meerdink, Lois A.

    1985-01-01

    Describes and assesses job sharing as an employment alternative for career services professionals. Discusses the job-sharing format with regard to fringe benefits, scheduling, advantages, client reactions, potential problems, and specific factors that contribute to successful job sharing. (BH)

  5. FLOWSHOP SCHEDULING USING A NETWORK APPROACH ...

    African Journals Online (AJOL)

    eobe

    time when the last job completes on the last machine. The objective ... more jobs in a permutation flow shop scheduling problem ... processing time of a job on a machine is zero, it ..... hybrid flow shops with sequence dependent setup times ...

  6. CMS multicore scheduling strategy

    International Nuclear Information System (INIS)

    Yzquierdo, Antonio Pérez-Calero; Hernández, Jose; Holzman, Burt; Majewski, Krista; McCrea, Alison

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.

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

  8. Evolution of CMS Workload Management Towards Multicore Job Support

    Energy Technology Data Exchange (ETDEWEB)

    Perez-Calero Yzquierdo, A. [Madrid, CIEMAT; Hernández, J. M. [Madrid, CIEMAT; Khan, F. A. [Quaid-i-Azam U.; Letts, J. [UC, San Diego; Majewski, K. [Fermilab; Rodrigues, A. M. [Fermilab; McCrea, A. [UC, San Diego; Vaandering, E. [Fermilab

    2015-12-23

    The successful exploitation of multicore processor architectures is a key element of the LHC distributed computing system in the coming era of the LHC Run 2. High-pileup complex-collision events represent a challenge for the traditional sequential programming in terms of memory and processing time budget. The CMS data production and processing framework is introducing the parallel execution of the reconstruction and simulation algorithms to overcome these limitations. CMS plans to execute multicore jobs while still supporting singlecore processing for other tasks difficult to parallelize, such as user analysis. The CMS strategy for job management thus aims at integrating single and multicore job scheduling across the Grid. This is accomplished by employing multicore pilots with internal dynamic partitioning of the allocated resources, capable of running payloads of various core counts simultaneously. An extensive test programme has been conducted to enable multicore scheduling with the various local batch systems available at CMS sites, with the focus on the Tier-0 and Tier-1s, responsible during 2015 of the prompt data reconstruction. Scale tests have been run to analyse the performance of this scheduling strategy and ensure an efficient use of the distributed resources. This paper presents the evolution of the CMS job management and resource provisioning systems in order to support this hybrid scheduling model, as well as its deployment and performance tests, which will enable CMS to transition to a multicore production model for the second LHC run.

  9. An integrated dataset on organisational culture, job satisfaction and performance in the hospitality industry.

    Science.gov (United States)

    Dirisu, Joy; Worlu, Rowland; Osibanjo, Adewale; Salau, Odunayo; Borishade, Taiye; Meninwa, Sandra; Atolagbe, Tolulope

    2018-08-01

    The relevance of organisational culture on job satisfaction and performance particularly within the hospitality sector cannot be over-emphasized. The culture of an organization goes a long way in distinguishing it from other organizations because it shows its ability to either be successful or to fail. To however achieve excellence and high-level performance, it is important to note that for effective and efficient operation, an organization would need a formal approach of communication as well as for making decisions and completing the tasks to match the needs of the organization. The managerial implications drawn from the study is that organizations should take advantage of their culture and inculcate values that will enhance performance.

  10. Scheduling for decommissioning projects

    International Nuclear Information System (INIS)

    Podmajersky, O.E.

    1987-01-01

    This paper describes the Project Scheduling system being employed by the Decommissioning Operations Contractor at the Shippingport Station Decommissioning Project (SSDP). Results from the planning system show that the project continues to achieve its cost and schedule goals. An integrated cost and schedule control system (C/SCS) which uses the concept of earned value for measurement of performance was instituted in accordance with DOE orders. The schedule and cost variances generated by the C/SCS system are used to confirm management's assessment of project status. This paper describes the types of schedules and tools used on the SSDP project to plan and monitor the work, and identifies factors that are unique to a decommissioning project that make scheduling critical to the achievement of the project's goals. 1 fig

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

  12. Solving a mathematical model integrating unequal-area facilities layout and part scheduling in a cellular manufacturing system by a genetic algorithm.

    Science.gov (United States)

    Ebrahimi, Ahmad; Kia, Reza; Komijan, Alireza Rashidi

    2016-01-01

    In this article, a novel integrated mixed-integer nonlinear programming model is presented for designing a cellular manufacturing system (CMS) considering machine layout and part scheduling problems simultaneously as interrelated decisions. The integrated CMS model is formulated to incorporate several design features including part due date, material handling time, operation sequence, processing time, an intra-cell layout of unequal-area facilities, and part scheduling. The objective function is to minimize makespan, tardiness penalties, and material handling costs of inter-cell and intra-cell movements. Two numerical examples are solved by the Lingo software to illustrate the results obtained by the incorporated features. In order to assess the effects and importance of integration of machine layout and part scheduling in designing a CMS, two approaches, sequentially and concurrent are investigated and the improvement resulted from a concurrent approach is revealed. Also, due to the NP-hardness of the integrated model, an efficient genetic algorithm is designed. As a consequence, computational results of this study indicate that the best solutions found by GA are better than the solutions found by B&B in much less time for both sequential and concurrent approaches. Moreover, the comparisons between the objective function values (OFVs) obtained by sequential and concurrent approaches demonstrate that the OFV improvement is averagely around 17 % by GA and 14 % by B&B.

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

  14. Mistral Supercomputer Job History Analysis

    OpenAIRE

    Zasadziński, Michał; Muntés-Mulero, Victor; Solé, Marc; Ludwig, Thomas

    2018-01-01

    In this technical report, we show insights and results of operational data analysis from petascale supercomputer Mistral, which is ranked as 42nd most powerful in the world as of January 2018. Data sources include hardware monitoring data, job scheduler history, topology, and hardware information. We explore job state sequences, spatial distribution, and electric power patterns.

  15. Impact of a Sustained Job-Embedded Professional Development Program on Classroom Technology Integration

    Science.gov (United States)

    Grashel, Mark A.

    2014-01-01

    The purpose of this single case study was to examine a grant-funded program of professional development (PD) at a small rural high school in Ohio. Evidence has shown that the current model of technology professional development in-service sessions has had little impact on classroom technology integration. This PD program focused on 21st Century…

  16. Onboard Autonomous Scheduling Intelligence System, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — Scheduling the daily activities of the crew on a human space mission is currently a cumbersome job performed by a large team of operations experts on the ground....

  17. [Health coaching as a part of integration into the job market--evaluation of a qualification concept].

    Science.gov (United States)

    Heinmüller, M; Liel, K; Angerer, P; Gündel, H; Geldermann, B; Gottwald, M; Kimil, A; Limm, H

    2014-03-01

    The aim of this study is to develop, implement and evaluate an education programme enabling the pedagogic staff of employment promotion agencies to integrate health promotion approaches und activities in vocational training programmes. The evaluation of the education programme is based on Kirkpatrick's 4 levels training evaluation model. Besides the participants' verbal end of session feedback, a standardised questionnaire was used at the end of the education programme and after 3 months practical experience. Process evaluation included the implementation level of the methods learned. From a total of 71 participants, 56 completed the first and 31 the second questionnaire (return rate 79% and 44%, respectively). The participants' mean age was 42 years, 80% were female. Only 22% of them integrated health topics systematically into their daily work. A 3-day basic training followed by case conferences during practical work was developed to transfer knowledge and practical competence in person-to-person talks and group activities (so called FIT-counselling and FIT-group). For 96% of participants, their expectations regarding the education programme were met completely or predominantly. 91% indicated a rise in motivation to work as health coach. When rating the training material, 96% judged it helpful for implementation/transfer. Many participants marked the education programme as being too short and wished more time for the topic of "mental health" and exchange of experiences. The follow-up after 3 months on-the-job training revealed that 84 and 97%, respectively, found FIT-counselling and FIT-groups helpful for their daily work. In all employment promotion agencies FIT-counselling and FIT-groups were implemented. Our results affirm the need for and prove the acceptance of education programmes enabling the pedagogic staff of job-training programmes to deliver health coaching. Periodic case conferences take into account the participants' request for more exchange of

  18. Integrated batch production and maintenance scheduling for multiple items processed on a deteriorating machine to minimize total production and maintenance costs with due date constraint

    Directory of Open Access Journals (Sweden)

    Zahedi Zahedi

    2016-04-01

    Full Text Available This paper discusses an integrated model of batch production and maintenance scheduling on a deteriorating machine producing multiple items to be delivered at a common due date. The model describes the trade-off between total inventory cost and maintenance cost as the increase of production run length. The production run length is a time bucket between two consecutive preventive maintenance activities. The objective function of the model is to minimize total cost consisting of in process and completed part inventory costs, setup cost, preventive and corrective maintenance costs and rework cost. The problem is to determine the optimal production run length and to schedule the batches obtained from determining the production run length in order to minimize total cost.

  19. A Comparison of Training Experience, Training Satisfaction, and Job Search Experiences between Integrated Vascular Surgery Residency and Traditional Vascular Surgery Fellowship Graduates.

    Science.gov (United States)

    Colvard, Benjamin; Shames, Murray; Schanzer, Andres; Rectenwald, John; Chaer, Rabih; Lee, Jason T

    2015-10-01

    The first 2 integrated vascular residents in the United States graduated in 2012, and in 2013, 11 more entered the job market. The purpose of this study was to compare the job search experiences of the first cohort of integrated 0 + 5 graduates to their counterparts completing traditional 5 + 2 fellowship programs. An anonymous, Web-based, 15-question survey was sent to all 11 graduating integrated residents in 2013 and to the 25 corresponding 5 + 2 graduating fellows within the same institution. Questions focused on the following domains: training experience, job search timelines and outcomes, and overall satisfaction with each training paradigm. Survey response was nearly 81% for the 0 + 5 graduates and 64% for the 5 + 2 graduates. Overall, there was no significant difference between residents and fellows in the operative experience obtained as measured by the number of open and endovascular cases logged. Dedicated research time during the entire training period was similar between residents and fellows. Nearly all graduates were extremely satisfied with their training and had positive experiences during their job searches with respect to starting salaries, numbers of offers, and desired practice type. More 0 + 5 residents chose academic and mixed practices over private practices compared with 5 + 2 fellowship graduates. Although longer term data are needed to understand the impact of the addition of 0 + 5 graduating residents to the vascular surgery work force, preliminary survey results suggest that both training paradigms (0 + 5 and 5 + 2) provide positive training experiences that result in excellent job search experiences. Based on the current and future need for vascular surgeons in the work force, the continued growth and expansion of integrated 0 + 5 vascular surgery residency positions as an alternative to traditional fellowship training is thus far justified. Copyright © 2015 Elsevier Inc. All rights reserved.

  20. When is success not satisfying? Integrating regulatory focus and approach/avoidance motivation theories to explain the relation between core self-evaluation and job satisfaction.

    Science.gov (United States)

    Ferris, D Lance; Johnson, Russell E; Rosen, Christopher C; Djurdjevic, Emilija; Chang, Chu-Hsiang Daisy; Tan, James A

    2013-03-01

    Integrating implications from regulatory focus and approach/avoidance motivation theories, we present a framework wherein motivational orientations toward positive (approach motivation orientation) or negative (avoidance motivation orientation) stimuli interact with workplace success to mediate the relation of core self-evaluation (CSE) with job satisfaction. Using data collected from supervisor-subordinate dyads (Sample 1) and time-lagged data (Sample 2), we found that the results from two studies indicated that the interaction of workplace success and avoidance motivation orientation mediated relations of CSE with job satisfaction. Although approach motivation orientation did not interact with workplace success, it did mediate the CSE-job satisfaction relation on its own. Implications for the CSE and approach/avoidance literatures are discussed.

  1. Real-time integration of optimal generation scheduling with MPC for the energy management of a renewable hydrogen-based microgrid

    International Nuclear Information System (INIS)

    Petrollese, Mario; Valverde, Luis; Cocco, Daniele; Cau, Giorgio; Guerra, José

    2016-01-01

    Highlights: • Energy management strategy for a renewable hydrogen-based microgrid. • Integration of optimal generation scheduling with a model predictive control. • Experimental tests are carried out simulating typical summer and winter days. • Effective improvement in performance and reduction in microgrid operating cost are achieved. - Abstract: This paper presents a novel control strategy for the optimal management of microgrids with high penetration of renewable energy sources and different energy storage systems. The control strategy is based on the integration of optimal generation scheduling with a model predictive control in order to achieve both long and short-term optimal planning. In particular, long-term optimization of the various microgrid components is obtained by the adoption of an optimal generation scheduling, in which a statistical approach is used to take into account weather and load forecasting uncertainties. The real-time management of the microgrid is instead entrusted to a model predictive controller, which has the important feature of using the results obtained by the optimal generation scheduling. The proposed control strategy was tested in a laboratory-scale microgrid present at the University of Seville, which is composed of an electronic power source that emulates a photovoltaic system, a battery bank and a hydrogen production and storage system. Two different experimental tests that simulate a summer and a winter day were carried out over a 24-h period to verify the reliability and performance enhancement of the control system. Results show an effective improvement in performance in terms of reduction of the microgrid operating cost and greater involvement of the hydrogen storage system for the maintenance of a spinning reserve in batteries.

  2. SPANR planning and scheduling

    Science.gov (United States)

    Freund, Richard F.; Braun, Tracy D.; Kussow, Matthew; Godfrey, Michael; Koyama, Terry

    2001-07-01

    SPANR (Schedule, Plan, Assess Networked Resources) is (i) a pre-run, off-line planning and (ii) a runtime, just-in-time scheduling mechanism. It is designed to support primarily commercial applications in that it optimizes throughput rather than individual jobs (unless they have highest priority). Thus it is a tool for a commercial production manager to maximize total work. First the SPANR Planner is presented showing the ability to do predictive 'what-if' planning. It can answer such questions as, (i) what is the overall effect of acquiring new hardware or (ii) what would be the effect of a different scheduler. The ability of the SPANR Planner to formulate in advance tree-trimming strategies is useful in several commercial applications, such as electronic design or pharmaceutical simulations. The SPANR Planner is demonstrated using a variety of benchmarks. The SPANR Runtime Scheduler (RS) is briefly presented. The SPANR RS can provide benefit for several commercial applications, such as airframe design and financial applications. Finally a design is shown whereby SPANR can provide scheduling advice to most resource management systems.

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

  4. A USER-DEPENDENT PERFECT-SCHEDULING MULTIPLE ACCESS PROTOCOL FOR VOICE-DATA INTEGRATION IN WIRELESS NETWORKDS

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    A novel Multiple Access Control(MAC) protocol-User-dependent Perfect-scheduling Multiple Access(UPMA) protocol,which supports joint transmission of voice and data packets,is proposed.By this protocol,the bandwidth can be allocated dynamically to the uplink and downlink traffic with on-demand assignment and the transmission of Mobile Terminals(MTs) can be perfectly scheduled by means of polling.Meanwhile.a unique frame stucture is designed to guarantee Quality of Service(QoS) in voice traffic supporting.An effective colision resolution algorthm is also proposed to guarantee rapid channel access for activated MTs.Finally,performance of UPMA protocol is evaluated by simulation and compared with MPRMA protocol.Simulation results show that UPMA protocol has better performance.

  5. A USER-DEPENDENT PERFECT-SCHEDULING MULTIPLE ACCESS PROTOCOL FOR VOICE-DATA INTEGRATION IN WIRELESS NETWORKS

    Institute of Scientific and Technical Information of China (English)

    Zhou Yajian; Li Jiandong; Liu Kai

    2002-01-01

    A novel Multiple Access Control (MAC) protocol - User-dependent Perfect-scheduling Multiple Access (UPMA) protocol, which supports joint transmission of voice and data packets,is proposed. By this protocol, the bandwidth can be allocated dynamically to the uplink and downlink traffic with on-demand assignment and the transmission of Mobile Terminals (MTs)can be perfectly scheduled by means of polling. Meanwhile, a unique frame structure is designed to guarantee Quality of Service (QoS) in voice traffic supporting. An effective collision resolution algorithm is also proposed to guarantee rapid channel access for activated MTs. Finally, performance of UPMA protocol is evaluated by simulation and compared with MPRMA protocol.Simulation results show that UPMA protocol has better performance.

  6. Scheduling with target start times

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Velde, van de S.L.; Klein Haneveld, W.K.; Vrieze, O.J.; Kallenberg, L.C.M.

    1997-01-01

    We address the single-machine problem of scheduling n independent jobs subject to target start times. Target start times are essentially release times that may be violated at a certain cost. The goal is to minimize an objective function that is composed of total completion time and maximum

  7. Utilization of the BR-SIPP systems (Integrated Refinery Scheduling System) at the PETROBRAS Capuava refinery; Utilizacao do sistema BR-SIPP - Sistema Integrado de Programacao de Producao PETROBRAS na refinaria de Capuava

    Energy Technology Data Exchange (ETDEWEB)

    Joly, Marcel [PETROBRAS, Maua, SP (Brazil). Refinaria de Capuava (RECAP). Gerencia de Otimizacao]. E-mail: joly@petrobras.com.br; Hassimotto, Marcelo Kenji [PETROBRAS, Rio de Janeiro, RJ (Brazil). Gerencia de Solucoes de Negocios de Logistica e Planejamento]. E-mail: kenji@petrobras.com.br; Magalhaes, Marcus Vinicius de Oliveira [PETROBRAS, Rio de Janeiro, RJ (Brazil). Gerencia de Otimizacao]. E-mail: vinicius@petrobras.com.br

    2007-04-15

    The BR-SIPP is a production scheduling decision support tool for refineries. It is integrated into the Corporate Inventory, Movements and Quality Data Base and is based on events simulation technology for the elaboration and analysis of scheduling scenarios. Its utilization at the Capuava Refinery allows the production programming team to analyze and anticipate difficulties and opportunities, thereby being able to make viable a potential integration of management and people directly involved with the refinery scheduling information, such as planning, logistics and commercial areas. (author)

  8. A Multiobjective Robust Scheduling Optimization Mode for Multienergy Hybrid System Integrated by Wind Power, Solar Photovoltaic Power, and Pumped Storage Power

    Directory of Open Access Journals (Sweden)

    Lihui Zhang

    2017-01-01

    Full Text Available Wind power plant (WPP, photovoltaic generators (PV, cell-gas turbine (CGT, and pumped storage power station (PHSP are integrated into multienergy hybrid system (MEHS. Firstly, this paper presents MEHS structure and constructs a scheduling model with the objective functions of maximum economic benefit and minimum power output fluctuation. Secondly, in order to relieve the uncertainty influence of WPP and PV on system, robust stochastic theory is introduced to describe uncertainty and propose a multiobjective stochastic scheduling optimization mode by transforming constraint conditions with uncertain variables. Finally, a 9.6 MW WPP, a 6.5 MW PV, three CGT units, and an upper reservoir with 10 MW·h equivalent capacity are chosen as simulation system. The results show MEHS system can achieve the best operation result by using the multienergy hybrid generation characteristic. PHSP could shave peak and fill valley of load curve by optimizing pumping storage and inflowing generating behaviors based on the load supply and demand status and the available power of WPP and PV. Robust coefficients can relieve the uncertainty of WPP and PV and provide flexible scheduling decision tools for decision-makers with different risk attitudes by setting different robust coefficients, which could maximize economic benefits and minimize operation risks at the same time.

  9. Finding Worst-Case Flexible Schedules using Coevolution

    DEFF Research Database (Denmark)

    Jensen, Mikkel Thomas

    2001-01-01

    Finding flexible schedules is important to industry, since in many environments changes such as machine breakdowns or the appearance of new jobs can happen at short notice.......Finding flexible schedules is important to industry, since in many environments changes such as machine breakdowns or the appearance of new jobs can happen at short notice....

  10. Duality-based algorithms for scheduling on unrelated parallel machines

    NARCIS (Netherlands)

    van de Velde, S.L.; van de Velde, S.L.

    1993-01-01

    We consider the following parallel machine scheduling problem. Each of n independent jobs has to be scheduled on one of m unrelated parallel machines. The processing of job J[sub l] on machine Mi requires an uninterrupted period of positive length p[sub lj]. The objective is to find an assignment of

  11. Generic Formal Framework for Compositional Analysis of Hierarchical Scheduling Systems

    DEFF Research Database (Denmark)

    Boudjadar, Jalil; Hyun Kim, Jin; Thi Xuan Phan, Linh

    We present a compositional framework for the specification and analysis of hierarchical scheduling systems (HSS). Firstly we provide a generic formal model, which can be used to describe any type of scheduling system. The concept of Job automata is introduced in order to model job instantiation...

  12. Highly Accurate Prediction of Jobs Runtime Classes

    OpenAIRE

    Reiner-Benaim, Anat; Grabarnick, Anna; Shmueli, Edi

    2016-01-01

    Separating the short jobs from the long is a known technique to improve scheduling performance. In this paper we describe a method we developed for accurately predicting the runtimes classes of the jobs to enable this separation. Our method uses the fact that the runtimes can be represented as a mixture of overlapping Gaussian distributions, in order to train a CART classifier to provide the prediction. The threshold that separates the short jobs from the long jobs is determined during the ev...

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

  14. 20 CFR 628.420 - Job training plan.

    Science.gov (United States)

    2010-04-01

    ... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false Job training plan. 628.420 Section 628.420... THE JOB TRAINING PARTNERSHIP ACT Local Service Delivery System § 628.420 Job training plan. (a) The Governor shall issue instructions and schedules to assure that job training plans and plan modifications...

  15. An Integrated and Optimal Joint Scheduling of Energy Resources to Feed Electrical, Thermal and Potable Water Demands in Remote Area

    Directory of Open Access Journals (Sweden)

    R. Ghaffarpour

    2016-12-01

    Full Text Available The continuous spread of distributed energy resources (DERs such as combined heating and power (CHP, diesel generators, boilers and renewable energy sources provide an effective solution to energy related problems to serve the power and heat demands with minimum cost. Moreover, the DERs may play a significant role for supplying power and heat in rural areas, where grid electricity is not available. Also, some dry areas may face water scarcity and salinity problems. So, one important solution is the use of DERs to drive desalination units in order to solve water scarcity and salinity problems. In this study, the optimal scheduling of DERs and reverse osmosis (RO desalination unit that feed the required electric, thermal and potable water demands are determined. The present paper describes the operation constraints and cost function of components of the system in detail. Operation constraints of generation units as well as feasible region of operation CHP in dual dependency characteristic are taken into account. To confirm the performance of the proposed model the approach is tested on a realistic remote area over a 24-h period. The results show that the economical scheduling of DERs and desalination units can be obtained using proposed methodology by implementing the proposed formulation.

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

  17. Evaluation of a twelve-hour/day shift schedule

    International Nuclear Information System (INIS)

    Lewis, P.M.; Swaim, D.J.

    1986-01-01

    In April 1985, the operating crews at the Fast Flux Test Facility near Richland, Washington, changed their rotating shift schedule from an 8-hour to a 12-hour a day work schedule. The primary purpose of the change was to reduce the attrition of operators by increasing their job satisfaction. Eighty-four percent of the operators favored the change. A program was established to evaluate the effects on plant performance, operator alertness, attrition, sleep, health, job satisfaction, and off-the-job satisfaction. Preliminary results from that evaluation program indicate that the 12-hour shift schedule is a reasonable alternative to an 8-hour schedule at this facility

  18. The Costs of Today's Jobs: Job Characteristics and Organizational Supports as Antecedents of Negative Spillover

    Science.gov (United States)

    Grotto, Angela R.; Lyness, Karen S.

    2010-01-01

    This study examined job characteristics and organizational supports as antecedents of negative work-to-nonwork spillover for 1178 U.S. employees. Based on hierarchical regression analyses of 2002 National Study of the Changing Workforce data and O*NET data, job demands (requirements to work at home beyond scheduled hours, job complexity, time and…

  19. An FMS Dynamic Production Scheduling Algorithm Considering Cutting Tool Failure and Cutting Tool Life

    International Nuclear Information System (INIS)

    Setiawan, A; Wangsaputra, R; Halim, A H; Martawirya, Y Y

    2016-01-01

    This paper deals with Flexible Manufacturing System (FMS) production rescheduling due to unavailability of cutting tools caused either of cutting tool failure or life time limit. The FMS consists of parallel identical machines integrated with an automatic material handling system and it runs fully automatically. Each machine has a same cutting tool configuration that consists of different geometrical cutting tool types on each tool magazine. The job usually takes two stages. Each stage has sequential operations allocated to machines considering the cutting tool life. In the real situation, the cutting tool can fail before the cutting tool life is reached. The objective in this paper is to develop a dynamic scheduling algorithm when a cutting tool is broken during unmanned and a rescheduling needed. The algorithm consists of four steps. The first step is generating initial schedule, the second step is determination the cutting tool failure time, the third step is determination of system status at cutting tool failure time and the fourth step is the rescheduling for unfinished jobs. The approaches to solve the problem are complete-reactive scheduling and robust-proactive scheduling. The new schedules result differences starting time and completion time of each operations from the initial schedule. (paper)

  20. Nontraditional work schedules for pharmacists.

    Science.gov (United States)

    Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

    2008-11-15

    Nontraditional work schedules for pharmacists at three institutions are described. The demand for pharmacists and health care in general continues to increase, yet significant material changes are occurring in the pharmacy work force. These changing demographics, coupled with historical vacancy rates and turnover trends for pharmacy staff, require an increased emphasis on workplace changes that can improve staff recruitment and retention. At William S. Middleton Memorial Veterans Affairs Hospital in Madison, Wisconsin, creative pharmacist work schedules and roles are now mainstays to the recruitment and retention of staff. The major challenge that such scheduling presents is the 8 hours needed to prepare a six-week schedule. Baylor Medical Center at Grapevine in Dallas, Texas, has a total of 45 pharmacy employees, and slightly less than half of the 24.5 full-time-equivalent staff work full-time, with most preferring to work one, two, or three days per week. As long as the coverage needs of the facility are met, Envision Telepharmacy in Alpine, Texas, allows almost any scheduling arrangement preferred by individual pharmacists or the pharmacist group covering the facility. Staffing involves a great variety of shift lengths and intervals, with shifts ranging from 2 to 10 hours. Pharmacy leaders must be increasingly aware of opportunities to provide staff with unique scheduling and operational enhancements that can provide for a better work-life balance. Compressed workweeks, job-sharing, and team scheduling were the most common types of alternative work schedules implemented at three different institutions.

  1. Basis of Estimate Software Tool (BEST) - a practical solution to part of the cost and schedule integration puzzle

    International Nuclear Information System (INIS)

    Murphy, L.; Bain, P.

    1997-01-01

    The Basis of Estimate Software Tool (BEST) was developed at the Rocky Flats Environmental Technology Site (Rocky Flats) to bridge the gap that exists in conventional project control systems between scheduled activities, their allocated or assigned resources, and the set of assumptions (basis of estimate) that correlate resources and activities. Having a documented and auditable basis of estimate (BOE) is necessary for budget validation, work scope analysis, change control, and a number of related management control functions. The uniqueness of BEST is demonstrated by the manner in which it responds to the diverse needs of the heavily regulated environmental workplace - containing many features not found in conventional off-the-shelf software products. However, even companies dealing in relatively unregulated work places will find many attractive features in BEST. This product will be of particular interest to current Government contractors and contractors preparing proposals that may require subsequent validation. 2 figs

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

  3. FLOW-SHOP SCHEDULING WITH MULTIPLE OPERATIONS AND TIME LAGS

    NARCIS (Netherlands)

    RIEZEBOS, J; GAALMAN, GJC; GUPTA, JND

    A scheduling system is proposed and developed for a special type of flow shop. Ln this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j - 1 has

  4. Job Creation and Job Types

    DEFF Research Database (Denmark)

    Kuhn, Johan Moritz; Malchow-Møller, Nikolaj; Sørensen, Anders

    2016-01-01

    We extend earlier analyses of the job creation of start-ups versus established firms by considering the educational content of the jobs created and destroyed. We define education-specific measures of job creation and job destruction at the firm level, and we use these measures to construct a meas...

  5. Job Creation and Job Types

    DEFF Research Database (Denmark)

    Kuhn, Johan M.; Malchow-Møller, Nikolaj; Sørensen, Anders

    We extend earlier analyses of the job creation of start-ups vs. established firms by taking into consideration the educational content of the jobs created and destroyed. We define educationspecific measures of job creation and job destruction at the firm level, and we use these to construct a mea...

  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. Optimal Grid Scheduling Using Improved Artificial Bee Colony Algorithm

    OpenAIRE

    T. Vigneswari; M. A. Maluk Mohamed

    2015-01-01

    Job Scheduling plays an important role for efficient utilization of grid resources available across different domains and geographical zones. Scheduling of jobs is challenging and NPcomplete. Evolutionary / Swarm Intelligence algorithms have been extensively used to address the NP problem in grid scheduling. Artificial Bee Colony (ABC) has been proposed for optimization problems based on foraging behaviour of bees. This work proposes a modified ABC algorithm, Cluster Hete...

  8. A systems integration approach to the optimum operation and scheduling of biocide usage and discharge for seawater cooling systems

    KAUST Repository

    Mahfouz, Abdullah Bin; Atilhan, Selma; Batchelor, Bill; Linke, Patrick; Wahab, Ahmed Abdel; Halwagi, Mahmoud M. El

    2012-01-01

    The objective of this work is to develop a systematic approach to the optimal design and integration of seawater cooling systems in industrial facilities along with the usage and discharge of biocides. Specifically, the paper will address

  9. A microeconomic scheduler for parallel computers

    Science.gov (United States)

    Stoica, Ion; Abdel-Wahab, Hussein; Pothen, Alex

    1995-01-01

    We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to the classical objectives of increasing the system throughput and reducing the response time, we consider fairness in allocating system resources among the users, and providing the user with control over the relative performances of his jobs. We associate with every user a savings account in which he receives money at a constant rate. When a user wants to run a job, he creates an expense account for that job to which he transfers money from his savings account. The job uses the funds in its expense account to obtain the system resources it needs for execution. The share of the system resources allocated to the user is directly related to the rate at which the user receives money; the rate at which the user transfers money into a job expense account controls the job's performance. We prove that starvation is not possible in our model. Simulation results show that our scheduler improves both system and user performances in comparison with two different variable partitioning policies. It is also shown to be effective in guaranteeing fairness and providing control over the performance of jobs.

  10. Job Creation and Job Types

    DEFF Research Database (Denmark)

    Kuhn, Johan M.; Malchow-Møller, Nikolaj; Sørensen, Anders

    We extend earlier analyses of the job creation of start-ups vs. established firms by taking into consideration the educational content of the jobs created and destroyed. We define educationspecific measures of job creation and job destruction at the firm level, and we use these to construct...... a measure of “surplus job creation” defined as jobs created on top of any simultaneous destruction of similar jobs in incumbent firms in the same region and industry. Using Danish employer-employee data from 2002-7, which identify the start-ups and which cover almost the entire private sector......, these measures allow us to provide a more nuanced assessment of the role of entrepreneurial firms in the job-creation process than previous studies. Our findings show that while start-ups are responsible for the entire overall net job creation, incumbents account for more than a third of net job creation within...

  11. Multiple-Machine Scheduling with Learning Effects and Cooperative Games

    Directory of Open Access Journals (Sweden)

    Yiyuan Zhou

    2015-01-01

    Full Text Available Multiple-machine scheduling problems with position-based learning effects are studied in this paper. There is an initial schedule in this scheduling problem. The optimal schedule minimizes the sum of the weighted completion times; the difference between the initial total weighted completion time and the minimal total weighted completion time is the cost savings. A multiple-machine sequencing game is introduced to allocate the cost savings. The game is balanced if the normal processing times of jobs that are on the same machine are equal and an equal number of jobs are scheduled on each machine initially.

  12. Active Job Monitoring in Pilots

    Science.gov (United States)

    Kuehn, Eileen; Fischer, Max; Giffels, Manuel; Jung, Christopher; Petzold, Andreas

    2015-12-01

    Recent developments in high energy physics (HEP) including multi-core jobs and multi-core pilots require data centres to gain a deep understanding of the system to monitor, design, and upgrade computing clusters. Networking is a critical component. Especially the increased usage of data federations, for example in diskless computing centres or as a fallback solution, relies on WAN connectivity and availability. The specific demands of different experiments and communities, but also the need for identification of misbehaving batch jobs, requires an active monitoring. Existing monitoring tools are not capable of measuring fine-grained information at batch job level. This complicates network-aware scheduling and optimisations. In addition, pilots add another layer of abstraction. They behave like batch systems themselves by managing and executing payloads of jobs internally. The number of real jobs being executed is unknown, as the original batch system has no access to internal information about the scheduling process inside the pilots. Therefore, the comparability of jobs and pilots for predicting run-time behaviour or network performance cannot be ensured. Hence, identifying the actual payload is important. At the GridKa Tier 1 centre a specific tool is in use that allows the monitoring of network traffic information at batch job level. This contribution presents the current monitoring approach and discusses recent efforts and importance to identify pilots and their substructures inside the batch system. It will also show how to determine monitoring data of specific jobs from identified pilots. Finally, the approach is evaluated.

  13. Optimal Algorithms and a PTAS for Cost-Aware Scheduling

    NARCIS (Netherlands)

    L. Chen; N. Megow; R. Rischke; L. Stougie (Leen); J. Verschae

    2015-01-01

    htmlabstractWe consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the

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

  15. PENGEMBANGAN ALGORITMA PENJADUALAN PRODUKSI JOB SHOP UNTUK MEMINIMUMKAN TOTAL BIAYA EARLINESS DAN TARDINESS

    Directory of Open Access Journals (Sweden)

    Dian Retno Sari Dewi

    2005-12-01

    Full Text Available This paper develops job shop production scheduling using Non Delay algorithm through forward and backward-forward algorithm to minimize total earliness and tardiness costs. Backward approach has some disadvantages, such as, if the job is scheduled in backward, there is a possibility that the infeasible situation occurs, in which the job is scheduled at t<0. This paper used hypothetic data generated randomly. This job shop scheduling algorithm development was validated using LINDO software to check the effectiveness heuristic method, compared with the optimation method. The validation proves that the result of backward-forward scheduling method is better than the result of forward scheduling method.

  16. Integration of Building Information Modeling and Critical Path Method Schedules to Simulate the Impact of Temperature and Humidity at the Project Level

    Directory of Open Access Journals (Sweden)

    Yongwei Shan

    2014-07-01

    Full Text Available Steel construction activities are often undertaken in an environment with limited climate control. Both hot and cold temperatures can physically and psychologically affect construction workers, thus decreasing their productivity. Temperature and humidity are two factors that constantly exert forces on workers and influence their performance and efficiency. Previous studies have established a relationship between labor productivity and temperature and humidity. This research is built on the existing body of knowledge and develops a framework of integrating building information modeling (BIM with a lower level critical path method (CPM schedule to simulate the overall impact of temperature and humidity on a healthcare facility’s structural steel installation project in terms of total man hours required to build the project. This research effort utilized historical weather data of four cities across the U.S., with each city having workable seasons year-round and conducted a baseline assessment to test if various project starting dates and locations could significantly impact the project’s schedule performance. It was found that both varied project start dates and locations can significantly contribute to the difference in the man hours required to build the model project and that the project start date and location can have an interaction effect. This study contributes to the overall body of knowledge by providing a framework that can help practitioners better understand the overall impact of a productivity influencing factor at a project level, in order to facilitate better decision making.

  17. INTEGRATING THE TRANSACTIONAL ANALYSIS AS AN ASSESSMENT TECHNIQUE TO THETRIANGLE OF PERSONALITY, JOB SATISFACTION AND ORGANIZATIONAL COMMITMENT

    Directory of Open Access Journals (Sweden)

    Canan Muter Şengül

    2015-07-01

    Full Text Available A successful job environment is believed to be created when individual interestsare put aside forthe sake of obtaining mutual benefits. At this point, providing jobsatisfaction and organizational commitment is essential. The present research isconducted through thehypothesis that personality predicts these two factors andthen seeks to reveal this effect.Big Five Personality Model and TransactionalAnalysis are used for evaluatingthe personality factor.The analysis is conducted across the data collected from 304 employees. Theresultssuggest that there is a link between some dimensions of ego involvementand the dimensions of organizational commitment and that some dimensions arenegatively associated. It is argued that some ego involvement dimensions and jobsatisfaction dimensions are negatively related while someother hasa favorablerelationship. Likewise some job satisfaction dimensions have prediction effectover organizational commitment dimensions. When the moderation is tested,respecting the interaction between variables, itis concluded that job satisfactionhas a mediation effect over the relation between personality and organizationalcommitment.

  18. The local–global conjecture for scheduling with non-linear cost

    NARCIS (Netherlands)

    Bansal, N.; Dürr, C.; Thang, N.K.K.; Vásquez, Ó.C.

    2017-01-01

    We consider the classical scheduling problem on a single machine, on which we need to schedule sequentially n given jobs. Every job j has a processing time pj and a priority weight wj, and for a given schedule a completion time Cj. In this paper, we consider the problem of minimizing the objective

  19. Integrated Harvest and Distribution Scheduling with Time Windows of Perishable Agri-Products in One-Belt and One-Road Context

    Directory of Open Access Journals (Sweden)

    Yiping Jiang

    2018-05-01

    Full Text Available The unique characteristics of perishable agri-products are a short lifespan and rapid quality deterioration. This establishes the need to significantly reduce the time from harvest to distribution. These features require reducing the processing time from harvest to distribution to being as short as possible. In this study, we focus on an integrated perishable agri-products scheduling problem that combines harvest and distribution simultaneously, with the purpose of reducing processing time and quality decay. We propose this problem as a mixed integer nonlinear programming model (MINLP to optimize the harvest time and the vehicle routing to consumers, and this MINIP is formulated as a vehicle routing problem with time windows (VRPTW. We introduce a big M method to transform the nonlinear model into a linear model, then apply CPLEX to solve the transformed model. Numerical experiments and sensitive analysis are conducted to verify the efficiency of the proposed model and to provide managerial insights.

  20. Stochastic risk-averse coordinated scheduling of grid integrated energy storage units in transmission constrained wind-thermal systems within a conditional value-at-risk framework

    International Nuclear Information System (INIS)

    Hemmati, Reza; Saboori, Hedayat; Saboori, Saeid

    2016-01-01

    In recent decades, wind power resources have been integrated in the power systems increasingly. Besides confirmed benefits, utilization of large share of this volatile source in power generation portfolio has been faced system operators with new challenges in terms of uncertainty management. It is proved that energy storage systems are capable to handle projected uncertainty concerns. Risk-neutral methods have been proposed in the previous literature to schedule storage units considering wind resources uncertainty. Ignoring risk of the cost distributions with non-desirable properties may result in experiencing high costs in some unfavorable scenarios with high probability. In order to control the risk of the operator decisions, this paper proposes a new risk-constrained two-stage stochastic programming model to make optimal decisions on energy storage and thermal units in a transmission constrained hybrid wind-thermal power system. Risk-aversion procedure is explicitly formulated using the conditional value-at-risk measure, because of possessing distinguished features compared to the other risk measures. The proposed model is a mixed integer linear programming considering transmission network, thermal unit dynamics, and storage devices constraints. The simulations results demonstrate that taking the risk of the problem into account will affect scheduling decisions considerably depend on the level of the risk-aversion. - Highlights: • Risk of the operation decisions is handled by using risk-averse programming. • Conditional value-at-risk is used as risk measure. • Optimal risk level is obtained based on the cost/benefit analysis. • The proposed model is a two-stage stochastic mixed integer linear programming. • The unit commitment is integrated with ESSs and wind power penetration.

  1. Jobs API

    Data.gov (United States)

    General Services Administration — This Jobs API returns job openings across the federal government and includes all current openings posted on USAJobs.gov that are open to the public and located in...

  2. Vocational Education, On-the-Job Training, and Labour Market Integration of Young Workers in Urban West Africa

    Science.gov (United States)

    Nordman, Christophe J.; Pasquier-Doumer, Laure

    2014-01-01

    Young people in Africa encounter many difficulties in entering the labour market and in searching for decent and productive jobs. Research on the links between formal education and vocational training and their economic returns are especially crucial in understanding the inadequate demand for their labour. This article presents evidence based on…

  3. Job satisfaction

    OpenAIRE

    PODROUŽKOVÁ, Lucie

    2013-01-01

    Bachelor thesis deals with job satisfaction. It is often given to a context with the attitude to work which is very much connected to job satisfaction. Thesis summarises all the pieces of information about job satisfacion, factors that affect it negatively and positively, interconnection of work satisfaction and work motivation, work behaviour and performance of workers, relationship of a man and work and at last general job satisfaction and its individual aspects. In the thesis I shortly pay...

  4. Job Analysis

    OpenAIRE

    Bravená, Helena

    2009-01-01

    This bacherlor thesis deals with the importance of job analysis for personnel activities in the company. The aim of this work is to find the most suitable method of job analysis in a particular enterprise, and continues creating descriptions and specifications of each job.

  5. The Impact of Job Stress and Job Satisfaction on Workforce Productivity in an Iranian Petrochemical Industry.

    Science.gov (United States)

    Hoboubi, Naser; Choobineh, Alireza; Kamari Ghanavati, Fatemeh; Keshavarzi, Sareh; Akbar Hosseini, Ali

    2017-03-01

    Job stress and job satisfaction are important factors affecting workforce productivity. This study was carried out to investigate the job stress, job satisfaction, and workforce productivity levels, to examine the effects of job stress and job satisfaction on workforce productivity, and to identify factors associated with productivity decrement among employees of an Iranian petrochemical industry. In this study, 125 randomly selected employees of an Iranian petrochemical company participated. The data were collected using the demographic questionnaire, Osipow occupational stress questionnaire to investigate the level of job stress, Job Descriptive Index to examine job satisfaction, and Hersey and Goldsmith questionnaire to investigate productivity in the study population. The levels of employees' perceived job stress and job satisfaction were moderate-high and moderate, respectively. Also, their productivity was evaluated as moderate. Although the relationship between job stress and productivity indices was not statistically significant, the positive correlation between job satisfaction and productivity indices was statistically significant. The regression modeling demonstrated that productivity was significantly associated with shift schedule, the second and the third dimensions of job stress (role insufficiency and role ambiguity), and the second dimension of job satisfaction (supervision). Corrective measures are necessary to improve the shift work system. "Role insufficiency" and "role ambiguity" should be improved and supervisor support must be increased to reduce job stress and increase job satisfaction and productivity.

  6. Hierarchical representations of the five-factor model of personality in predicting job performance: integrating three organizing frameworks with two theoretical perspectives.

    Science.gov (United States)

    Judge, Timothy A; Rodell, Jessica B; Klinger, Ryan L; Simon, Lauren S; Crawford, Eean R

    2013-11-01

    Integrating 2 theoretical perspectives on predictor-criterion relationships, the present study developed and tested a hierarchical framework in which each five-factor model (FFM) personality trait comprises 2 DeYoung, Quilty, and Peterson (2007) facets, which in turn comprise 6 Costa and McCrae (1992) NEO facets. Both theoretical perspectives-the bandwidth-fidelity dilemma and construct correspondence-suggest that lower order traits would better predict facets of job performance (task performance and contextual performance). They differ, however, as to the relative merits of broad and narrow traits in predicting a broad criterion (overall job performance). We first meta-analyzed the relationship of the 30 NEO facets to overall job performance and its facets. Overall, 1,176 correlations from 410 independent samples (combined N = 406,029) were coded and meta-analyzed. We then formed the 10 DeYoung et al. facets from the NEO facets, and 5 broad traits from those facets. Overall, results provided support for the 6-2-1 framework in general and the importance of the NEO facets in particular. (c) 2013 APA, all rights reserved.

  7. Providing Better University Personnel through Job Sharing.

    Science.gov (United States)

    Hutton, Clifford E.; McFarlin, Joy Simon

    1982-01-01

    Universities could benefit by offering more flexible part-time job opportunities such as job-sharing, following an apparent national trend in accommodating social and economic needs. Institutions have many options in scheduling and allocating tasks. Possible benefits include improved employee attitude and productivity. (MSE)

  8. INTEGRATING THE TRANSACTIONAL ANALYSIS AS AN ASSESSMENT TECHNIQUE TO THETRIANGLE OF PERSONALITY, JOB SATISFACTION AND ORGANIZATIONAL COMMITMENT

    OpenAIRE

    Canan Muter Şengül

    2015-01-01

    A successful job environment is believed to be created when individual interestsare put aside forthe sake of obtaining mutual benefits. At this point, providing jobsatisfaction and organizational commitment is essential. The present research isconducted through thehypothesis that personality predicts these two factors andthen seeks to reveal this effect.Big Five Personality Model and TransactionalAnalysis are used for evaluatingthe personality factor.The...

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

  10. The Main Investigative Discipline Integrative Job Training: The need to achieve coherent educational influences and demands of the actors involved in the training process

    Directory of Open Access Journals (Sweden)

    Abel Rojas-Marrero

    2016-07-01

    Full Text Available In this article an assessment about the achievements of the influences and educational requirements consistent achieved through the implementation of the Main Investigative Discipline Integrative occupational training in the municipality of Santiago de Cuba is done. Its history, the mission of the University of Pedagogical Sciences regarding the training of their graduates. This is achieved from the design, implementation and evaluation of the Main Discipline Integrative Investigativa Job Training, that the apparent contradiction between the general training of any teacher is resolved, the particulars of every race and specific for each year study, based on the progressive domination of the modes of professional activity. It is based as a key idea: professional functions (skills which constitute the realization of the essence of the teaching profession, manifested in their professional performance.

  11. Grid Service for User-Centric Job

    Energy Technology Data Exchange (ETDEWEB)

    Lauret, Jerome

    2009-07-31

    The User Centric Monitoring (UCM) project was aimed at developing a toolkit that provides the Virtual Organization (VO) with tools to build systems that serve a rich set of intuitive job and application monitoring information to the VO’s scientists so that they can be more productive. The tools help collect and serve the status and error information through a Web interface. The proposed UCM toolkit is composed of a set of library functions, a database schema, and a Web portal that will collect and filter available job monitoring information from various resources and present it to users in a user-centric view rather than and administrative-centric point of view. The goal is to create a set of tools that can be used to augment grid job scheduling systems, meta-schedulers, applications, and script sets in order to provide the UCM information. The system provides various levels of an application programming interface that is useful through out the Grid environment and at the application level for logging messages, which are combined with the other user-centric monitoring information in a abstracted “data store”. A planned monitoring portal will also dynamically present the information to users in their web browser in a secure manor, which is also easily integrated into any JSR-compliant portal deployment that a VO might employ. The UCM is meant to be flexible and modular in the ways that it can be adopted to give the VO many choices to build a solution that works for them with special attention to the smaller VOs that do not have the resources to implement home-grown solutions.

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

  13. 28 CFR 345.83 - Job safety training.

    Science.gov (United States)

    2010-07-01

    ... 28 Judicial Administration 2 2010-07-01 2010-07-01 false Job safety training. 345.83 Section 345... INDUSTRIES (FPI) INMATE WORK PROGRAMS FPI Inmate Training and Scholarship Programs § 345.83 Job safety training. FPI provides inmates with regular job safety training which is developed and scheduled in...

  14. Gradient decent based multi-objective cultural differential evolution for short-term hydrothermal optimal scheduling of economic emission with integrating wind power and photovoltaic power

    International Nuclear Information System (INIS)

    Zhang, Huifeng; Yue, Dong; Xie, Xiangpeng; Dou, Chunxia; Sun, Feng

    2017-01-01

    With the integration of wind power and photovoltaic power, optimal operation of hydrothermal power system becomes great challenge due to its non-convex, stochastic and complex-coupled constrained characteristics. This paper extends short-term hydrothermal system optimal model into short-term hydrothermal optimal scheduling of economic emission while considering integrated intermittent energy resources (SHOSEE-IIER). For properly solving SHOSEE-IIER problem, a gradient decent based multi-objective cultural differential evolution (GD-MOCDE) is proposed to improve the optimal efficiency of SHOSEE-IIER combined with three designed knowledge structures, which mainly enhances search ability of differential evolution in the shortest way. With considering those complex-coupled and stochastic constraints, a heuristic constraint-handling measurement is utilized to tackle with them both in coarse and fine tuning way, and probability constraint-handling procedures are taken to properly handle those stochastic constraints combined with their probability density functions. Ultimately, those approaches are implemented on five test systems, which testify the optimization efficiency of proposed GD-MOCDE and constraint-handling efficiency for system load balance, water balance and stochastic constraint-handling measurements, those obtained results reveal that the proposed GD-MOCDE can properly solve the SHOSEE-IIER problem combined with those constraint-handling approaches. - Highlights: • Gradient decent method is proposed to improve mutation operator. • Hydrothermal system is extended to hybrid energy system. • The uncertainty constraint is converted into deterministic constraint. • The results show the viability and efficiency of proposed algorithm.

  15. Dynamic scheduling and analysis of real time systems with multiprocessors

    Directory of Open Access Journals (Sweden)

    M.D. Nashid Anjum

    2016-08-01

    Full Text Available This research work considers a scenario of cloud computing job-shop scheduling problems. We consider m realtime jobs with various lengths and n machines with different computational speeds and costs. Each job has a deadline to be met, and the profit of processing a packet of a job differs from other jobs. Moreover, considered deadlines are either hard or soft and a penalty is applied if a deadline is missed where the penalty is considered as an exponential function of time. The scheduling problem has been formulated as a mixed integer non-linear programming problem whose objective is to maximize net-profit. The formulated problem is computationally hard and not solvable in deterministic polynomial time. This research work proposes an algorithm named the Tube-tap algorithm as a solution to this scheduling optimization problem. Extensive simulation shows that the proposed algorithm outperforms existing solutions in terms of maximizing net-profit and preserving deadlines.

  16. Job prioritization in LHCb

    CERN Document Server

    Castellani, G

    2007-01-01

    LHCb is one of the four high-energy experiments running in the near future at the Large Hadron Collider (LHC) at CERN. LHCb will try to answer some fundamental questions about the asymmetry between matter and anti-matter. The experiment is expected to produce about 2PB of data per year. Those will be distributed to several laboratories all over Europe and then analyzed by the Physics community. To achieve this target LHCb fully uses the Grid to reprocess, replicate and analyze data. The access to the Grid happens through LHCb's own distributed production and analysis system, DIRAC (Distributed Infrastructure with Remote Agent Control). Dirac implements the ‘pull’ job scheduling paradigm, where all the jobs are stored in a central task queues and then pulled via generic grid jobs called Pilot Agents. The whole LHCb community (about 600 people) is divided in sets of physicists, developers, production and software managers that have different needs about their jobs on the Grid. While a Monte Carlo simulation...

  17. Job training planning and design for process plant operators

    Energy Technology Data Exchange (ETDEWEB)

    Wirstad, J.

    1983-01-01

    A method is presented by which process plant operators for nuclear power plants are trained in Sweden. It works by a top-down method of systems analysis which can be integrated into the analysis, specification, and design of the process automation system. The training methods can also be adapted to existing automation systems and operating schedules. The author's method is based on the principle that training programs should be based on job requirements, e.g. operator tasks in common, less frequent, and rare operating conditions. Procedures have been tested for the following steps: Job analysis, analysis of knowledge and experience required, analysis of operator training requirements, set-up and organisation of the training programme, achievement control, evaluation of the training programme.

  18. Job training planning and design for process plant operators

    International Nuclear Information System (INIS)

    Wirstad, J.

    1983-01-01

    A method is presented by which process plant operators for nuclear power plants are trained in Sweden. It works by a top-down method of systems analysis which can be integrated into the analysis, specification, and design of the process automation system. The training methods can also be adapted to existing automation systems and operating schedules. The author's method is based on the principle that training programs should be based on job requirements, e.g. operator tasks in common, less frequent, and rare operating conditions. Procedures have been tested for the following steps: Job analysis, analysis of knowledge and experience required, analysis of operator training requirements, set-up and organisation of the training programme, achievement control, evaluation of the training programme. (orig./HP) [de

  19. Apprenticeship Learning: Learning to Schedule from Human Experts

    Science.gov (United States)

    2016-06-09

    identified by the heuristic . A spectrum of problems (i.e. traveling salesman, job-shop scheduling, multi-vehicle routing) was represented , as task locations...caus- ing the codification of this knowledge to become labori- ous. We propose a new approach for capturing domain- expert heuristics through a...demonstrate that this approach accu- rately learns multi-faceted heuristics on both a synthetic data set incorporating job-shop scheduling and vehicle

  20. Online Scheduling in Distributed Message Converter Systems

    NARCIS (Netherlands)

    Risse, Thomas; Wombacher, Andreas; Surridge, Mike; Taylor, Steve; Aberer, Karl

    The optimal distribution of jobs among hosts in distributed environments is an important factor to achieve high performance. The optimal strategy depends on the application. In this paper we present a new online scheduling strategy for distributed EDI converter system. The strategy is based on the

  1. Network scheduling at Belene NPP construction site

    International Nuclear Information System (INIS)

    Matveev, A.

    2010-01-01

    Four types of schedules differing in the level of their detail are singled out to enhance the efficiency of Belene NPP Project implementation planning and monitoring: Level 1 Schedule–Summary Integrated Overall Time Schedule (SIOTS) is an appendix to EPC Contract. The main purpose of SIOTS is the large scale presentation of the current information on the Project implementation. Level 2 Schedule–Integrated Overall Time Schedule (IOTS)is the contract schedule for the Contractor (ASE JSC) and their subcontractors.The principal purpose of IOTS is the work progress planning and monitoring, the analysis of the effect of activities implementation upon the progress of the Project as a whole. IOTS is the reporting schedule at the Employer –Contractor level. Level 3 Schedules, Detail Time Schedules(DTS) are developed by those who actually perform the work and are agreed upon with Atomstroyexport JSC.The main purpose of DTS is the detail planning of Atomstroyexport subcontractor's activities. DTSare the reporting schedules at the level of Contractor-Subcontractor. Level 4 Schedules are the High Detail Time Schedules (HDTS), which are the day-to-day plans of work implementation and are developed, as a rule, for a week's time period.Each lower level time schedule details the activities of the higher level time schedule

  2. Time-constrained project scheduling with adjacent resources

    NARCIS (Netherlands)

    Hurink, Johann L.; Kok, A.L.; Paulus, J.J.; Schutten, Johannes M.J.

    We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with adjacent resources. For adjacent resources the resource units are ordered and the units assigned to a job have to be adjacent. On top of that, adjacent resources are not required by single jobs, but by

  3. Nonstrict vector simulation in multi-operation scheduling

    NARCIS (Netherlands)

    Sevastianov, S.V.

    1995-01-01

    We consider several multi??operation scheduling problems with m machines and n jobs??, including fl??ow shop??, open shop,?? assembly line,?? and a few special cases of job shop with the makespan criterion. It is demonstrated that the problems in question can be effi??ciently solved by approximation

  4. Time-constrained project scheduling with adjacent resources

    NARCIS (Netherlands)

    Hurink, Johann L.; Kok, A.L.; Paulus, J.J.; Schutten, Johannes M.J.

    2008-01-01

    We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and the units assigned to a job have to be adjacent. On top of that, adjacent resources are not required by single jobs, but by

  5. Working Less and Enjoying It More: Alternative Work Schedules.

    Science.gov (United States)

    Shanks, Katherine

    1984-01-01

    Explores three forms of alternative work schedules that research has shown improve job performance and decrease absenteeism: flextime (starting and stopping times vary within limits); permanent part-time employment (regular employment carried out during shorter working hours); and job sharing (two or more part-time employees share one full-time…

  6. Decentralization and mechanism design for online machine scheduling

    NARCIS (Netherlands)

    Arge, Lars; Heydenreich, Birgit; Müller, Rudolf; Freivalds, Rusins; Uetz, Marc Jochen

    We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of each job, namely its release date $r_j$, its processing time $p_j$ and its weight $w_j$ is only known to the job itself,

  7. From Preemptive to Non-preemptive Scheduling Using Rejections

    OpenAIRE

    Lucarelli , Giorgio; Srivastav , Abhinav; Trystram , Denis

    2016-01-01

    International audience; We study the classical problem of scheduling a set of independent jobs with release dates on a single machine. There exists a huge literature on the preemptive version of the problem, where the jobs can be interrupted at any moment. However, we focus here on the non-preemptive case, which is harder, but more relevant in practice. For instance, the jobs submitted to actual high performance platforms cannot be interrupted or migrated once they start their execution (due ...

  8. Integrating Implicit Leadership Theories, Leader-Member Exchange, Self-Efficacy, and Attachment Theory to Predict Job Performance.

    Science.gov (United States)

    Khorakian, Alireza; Sharifirad, Mohammad Sadegh

    2018-01-01

    The impact of implicit leadership theories on performance and the mechanism linking them have received insufficient theoretical and research attention. Drawing on Bandura's social cognitive theory, the present study contributes theory through examining the assertion that higher congruence between followers' implicit leadership theory and the characteristics of supervisors enhance job performance through higher quality of leader-member exchange and self-efficacy. Moreover, in the proposed model, attachment insecurity was considered as the antecedent of the congruence and leader-member exchange in addition to the moderator of the relationship between them. Capitalizing upon Structural Equation Modeling (SEM), this study tested the model in a field study using a sample of employees in knowledge-oriented firms in Iran. The results suggest that the congruence between followers' implicit leadership theory and the characteristics of supervisors does not directly impact performance and leader-member exchange and self-efficacy are the full mediators. The results also showed that attachment insecurity is the predictor of neither the congruence nor the leader-member exchange. Additionally, attachment insecurity moderates the relationship between these two variables in a way that when attachment insecurity is high, the congruence has more positive impact on leader-member exchange.

  9. Job crafting

    NARCIS (Netherlands)

    Demerouti, E.; Bakker, A.B.; Peeters, M.; Jonge, de J.; Taris, T.

    2014-01-01

    The increasing popularity of self-managing teams, re-engineering and other organizational innovations, coupled with the increased flexibility in work arrangements made possible by advances in information technology, has considerably expanded the complexity of professional jobs. Consequently, each

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

  11. Off-Line and Dynamic Production Scheduling – A Comparative Case Study

    OpenAIRE

    Bożek Andrzej; Wysocki Marian

    2016-01-01

    A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also ...

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

  13. A clinically integrated curriculum in Evidence-based Medicine for just-in-time learning through on-the-job training: The EU-EBM project

    Directory of Open Access Journals (Sweden)

    Horvath Andrea R

    2007-11-01

    Full Text Available Abstract Background Over the last years key stake holders in the healthcare sector have increasingly recognised evidence based medicine (EBM as a means to improving the quality of healthcare. However, there is considerable uncertainty about the best way to disseminate basic knowledge of EBM. As a result, huge variation in EBM educational provision, setting, duration, intensity, content, and teaching methodology exists across Europe and worldwide. Most courses for health care professionals are delivered outside the work context ('stand alone' and lack adaptation to the specific needs for EBM at the learners' workplace. Courses with modern 'adaptive' EBM teaching that employ principles of effective continuing education might fill that gap. We aimed to develop a course for post-graduate education which is clinically integrated and allows maximum flexibility for teachers and learners. Methods A group of experienced EBM teachers, clinical epidemiologists, clinicians and educationalists from institutions from eight European countries participated. We used an established methodology of curriculum development to design a clinically integrated EBM course with substantial components of e-learning. An independent European steering committee provided input into the process. Results We defined explicit learning objectives about knowledge, skills, attitudes and behaviour for the five steps of EBM. A handbook guides facilitator and learner through five modules with clinical and e-learning components. Focussed activities and targeted assignments round off the learning process, after which each module is formally assessed. Conclusion The course is learner-centred, problem-based, integrated with activities in the workplace and flexible. When successfully implemented, the course is designed to provide just-in-time learning through on-the-job-training, with the potential for teaching and learning to directly impact on practice.

  14. A clinically integrated curriculum in evidence-based medicine for just-in-time learning through on-the-job training: the EU-EBM project.

    Science.gov (United States)

    Coppus, Sjors F P J; Emparanza, Jose I; Hadley, Julie; Kulier, Regina; Weinbrenner, Susanne; Arvanitis, Theodoros N; Burls, Amanda; Cabello, Juan B; Decsi, Tamas; Horvath, Andrea R; Kaczor, Marcin; Zanrei, Gianni; Pierer, Karin; Stawiarz, Katarzyna; Kunz, Regina; Mol, Ben W J; Khan, Khalid S

    2007-11-27

    Over the last years key stake holders in the healthcare sector have increasingly recognised evidence based medicine (EBM) as a means to improving the quality of healthcare. However, there is considerable uncertainty about the best way to disseminate basic knowledge of EBM. As a result, huge variation in EBM educational provision, setting, duration, intensity, content, and teaching methodology exists across Europe and worldwide. Most courses for health care professionals are delivered outside the work context ('stand alone') and lack adaptation to the specific needs for EBM at the learners' workplace. Courses with modern 'adaptive' EBM teaching that employ principles of effective continuing education might fill that gap. We aimed to develop a course for post-graduate education which is clinically integrated and allows maximum flexibility for teachers and learners. A group of experienced EBM teachers, clinical epidemiologists, clinicians and educationalists from institutions from eight European countries participated. We used an established methodology of curriculum development to design a clinically integrated EBM course with substantial components of e-learning. An independent European steering committee provided input into the process. We defined explicit learning objectives about knowledge, skills, attitudes and behaviour for the five steps of EBM. A handbook guides facilitator and learner through five modules with clinical and e-learning components. Focussed activities and targeted assignments round off the learning process, after which each module is formally assessed. The course is learner-centred, problem-based, integrated with activities in the workplace and flexible. When successfully implemented, the course is designed to provide just-in-time learning through on-the-job-training, with the potential for teaching and learning to directly impact on practice.

  15. Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

    OpenAIRE

    Pérez González, Paz; Framiñán Torres, José Manuel

    2009-01-01

    In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may not be available at the beginning of the planning period, due to processing of previously scheduled jobs. We first formulate the problem, analyse the structure of solutions depending on a number of factors (such as machines, jobs, structure of the processing times, availabi...

  16. Job system generation in grid taking into account user preferences

    Directory of Open Access Journals (Sweden)

    D. M. Yemelyanov

    2016-01-01

    Full Text Available Distributed computing environments like Grid are characterized by heterogeneity, low cohesion and dynamic structure of computing nodes. This is why the task of resource scheduling in such environments is complex. Different approaches to job scheduling in grid exist. Some of them use economic principles. Economic approaches to scheduling have shown their efficiency. One of such approaches is cyclic scheduling scheme which is considered in this paper.Cyclic scheduling scheme takes into account the preferences of computing environment users by means of an optimization criterion, which is included in the resource request. Besides, the scheme works cyclically by scheduling a certain job batch at each scheduling step. This is why there is a preliminary scheduling step which is job batch generation.The purpose of this study was to estimate the infl uence of job batch structure by the user criterion on the degree of its satisfaction. In other words we had to find the best way to form the batch with relation to the user optimization criterion. For example if it is more efficient to form the batch with jobs with the same criterion value or with different criterion values. Also we wanted to find the combination of criterion values which would give the most efficient scheduling results.To achieve this purpose an experiment in a simulation environment was conducted. The experiment consisted of scheduling of job batches with different values of the user criterion, other parameters of the resource request and the characteristics of the computing environment being the same. Three job batch generation strategies were considered. In the first strategy the batch consisted of jobs with the same criterion value. In the second strategy the batch consisted of jobs with all the considered criteria equally likely. The third strategy was similar to the second one, but only two certain criteria were considered. The third strategy was considered in order to find the most

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

  18. Non-clairvoyant weighted flow time scheduling with rejection penalty

    DEFF Research Database (Denmark)

    Chan, Ho-Leung; Chan, Sze-Hang; Lam, Tak-Wah

    2012-01-01

    is defined as the weighted flow time of the job plus the penalty if it is rejected before completion. Previous work on minimizing the total user cost focused on the clairvoyant single-processor setting [BBC+03,CLL11] and has produced O(1)-competitive online algorithm for jobs with arbitrary weights...... algorithm has to decide job rejection and determine the order and speed of job execution. It is interesting to study the tradeoff between the above-mentioned user cost and energy. This paper gives two O(1)-competitive non-clairvoyant algorithms for minimizing the user cost plus energy on a single processor......This paper initiates the study of online scheduling with rejection penalty in the non-clairvoyant setting, i.e., the size (processing time) of a job is not assumed to be known at its release time. In the rejection penalty model, jobs can be rejected with a penalty, and the user cost of a job...

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

  20. Dewey Decimal Classification Online Project: Evaluation of a Library Schedule and Index Integrated into the Subject Searching Capabilities of an Online Catalog. Final Report.

    Science.gov (United States)

    Markey, Karen; Demeyer, Anh N.

    In this research project, subject terms from the Dewey Decimal Classification (DDC) Schedules and Relative Index were incorporated into an online catalog as searcher's tools for subject access, browsing, and display. Four features of the DDC were employed to help searchers browse for and match their own subject terms with the online catalog's…

  1. Job Satisfaction

    African Journals Online (AJOL)

    Administrator

    Job Satisfaction: Rural Versus Urban Primary Health Care Workers'. Perception in ... doing it well, and being suitably rewarded for one's efforts. Several ... community recognition of their work and improved staff relationship. ..... study found important differences about attractors to ... their work, work-life balance, bureaucracy.

  2. Job autonomy and job satisfaction: new evidence

    OpenAIRE

    Taylor, J; Bradley, S; Nguyen, A N

    2003-01-01

    This paper investigates the impact of perceived job autonomy on job satisfaction. We use the fifth sweep of the National Educational Longitudinal Study (1988-2000), which contains personally reported job satisfaction data for a sample of individuals eight years after the end of compulsory education. After controlling for a wide range of personal and job-related variables, perceived job autonomy is found to be a highly significant determinant of five separate domains of job satisfaction (pay, ...

  3. Future aircraft networks and schedules

    Science.gov (United States)

    Shu, Yan

    2011-07-01

    Because of the importance of air transportation scheduling, the emergence of small aircraft and the vision of future fuel-efficient aircraft, this thesis has focused on the study of aircraft scheduling and network design involving multiple types of aircraft and flight services. It develops models and solution algorithms for the schedule design problem and analyzes the computational results. First, based on the current development of small aircraft and on-demand flight services, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. This thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch under the model. In the first step, both a frequency assignment model for scheduled flights that incorporates a passenger path choice model and a frequency assignment model for on-demand flights that incorporates a passenger mode choice model are created. In the second step, a rough fleet assignment model that determines a set of flight legs, each of which is assigned an aircraft type and a rough departure time is constructed. In the third step, a timetable model that determines an exact departure time for each flight leg is developed. Based on the models proposed in the three steps, this thesis creates schedule design instances that involve almost all the major airports and markets in the United States. The instances of the frequency assignment model created in this thesis are large-scale non-convex mixed-integer programming problems, and this dissertation develops an overall network structure and proposes iterative algorithms for solving these instances. The instances of both the rough fleet assignment model and the timetable model created in this thesis are large-scale mixed-integer programming problems, and this dissertation develops subproblem schemes for solving these instances. Based on these solution algorithms, this dissertation also presents

  4. Integrating make-to-order and make-to-stock in job shop control (Reprint of International Journal of Production Economics 185, pp 1-10)

    NARCIS (Netherlands)

    Beemsterboer, Bart; Land, Martin; Teunter, Ruud; Bokhorst, Jos

    2017-01-01

    Demand fluctuations in make-to-order job shops lead to utilisation fluctuations and delivery delays, particularly in periods with high demand. Many job shop production companies therefore include some standardised products in their product mix and use a hybrid make-to-order/make-to-stock production

  5. Job Hazard Analysis

    National Research Council Canada - National Science Library

    1998-01-01

    .... Establishing proper job procedures is one of the benefits of conducting a job hazard analysis carefully studying and recording each step of a job, identifying existing or potential job hazards...

  6. Developing optimal nurses work schedule using integer programming

    Science.gov (United States)

    Shahidin, Ainon Mardhiyah; Said, Mohd Syazwan Md; Said, Noor Hizwan Mohamad; Sazali, Noor Izatie Amaliena

    2017-08-01

    Time management is the art of arranging, organizing and scheduling one's time for the purpose of generating more effective work and productivity. Scheduling is the process of deciding how to commit resources between varieties of possible tasks. Thus, it is crucial for every organization to have a good work schedule for their staffs. The job of Ward nurses at hospitals runs for 24 hours every day. Therefore, nurses will be working using shift scheduling. This study is aimed to solve the nurse scheduling problem at an emergency ward of a private hospital. A 7-day work schedule for 7 consecutive weeks satisfying all the constraints set by the hospital will be developed using Integer Programming. The work schedule for the nurses obtained gives an optimal solution where all the constraints are being satisfied successfully.

  7. Scheduling nurses’ shifts at PGI Cikini Hospital

    Science.gov (United States)

    Nainggolan, J. C. T.; Kusumastuti, R. D.

    2018-03-01

    Hospitals play an essential role in the community by providing medical services to the public. In order to provide high quality medical services, hospitals must manage their resources (including nurses) effectively and efficiently. Scheduling of nurses’ work shifts, in particular, is crucial, and must be conducted carefully to ensure availability and fairness. This research discusses the job scheduling system for nurses in PGI Cikini Hospital, Jakarta with Goal Programming approach. The research objectives are to identify nurse scheduling criteria and find the best schedule that can meet the criteria. The model has hospital regulations (including government regulations) as hard constraints, and nurses’ preferences as soft constraints. We gather primary data (hospital regulations and nurses’ preferences) through interviews with three Head Nurses and distributing questionnaires to fifty nurses. The results show that on the best schedule, all hard constraints can be satisfied. However, only two out of four soft constraints are satisfied. Compared to current scheduling practice, the resulting schedule ensures the availability of nurses as it satisfies all hospital’s regulations and it has a higher level of fairness as it can accommodate some of the nurses’ preferences.

  8. Analyzing data flows of WLCG jobs at batch job level

    Science.gov (United States)

    Kuehn, Eileen; Fischer, Max; Giffels, Manuel; Jung, Christopher; Petzold, Andreas

    2015-05-01

    With the introduction of federated data access to the workflows of WLCG, it is becoming increasingly important for data centers to understand specific data flows regarding storage element accesses, firewall configurations, as well as the scheduling of batch jobs themselves. As existing batch system monitoring and related system monitoring tools do not support measurements at batch job level, a new tool has been developed and put into operation at the GridKa Tier 1 center for monitoring continuous data streams and characteristics of WLCG jobs and pilots. Long term measurements and data collection are in progress. These measurements already have been proven to be useful analyzing misbehaviors and various issues. Therefore we aim for an automated, realtime approach for anomaly detection. As a requirement, prototypes for standard workflows have to be examined. Based on measurements of several months, different features of HEP jobs are evaluated regarding their effectiveness for data mining approaches to identify these common workflows. The paper will introduce the actual measurement approach and statistics as well as the general concept and first results classifying different HEP job workflows derived from the measurements at GridKa.

  9. Steve Jobs

    OpenAIRE

    Christensen, Julie Sophie; Nielsen, Jonas; Mørk, Maj Keum Ji Helweg; Mammen, Diana; Kristiansen, Mikkel Vestergaard; Welch, Nadia Guldbæk

    2013-01-01

    Apple is perhaps today one of the most successful technological brands on the market. This company has introduced various products to the consumers, which in a relatively short time has managed to establish a world wide trend based on a functional and aesthetic design. In this project, the primary interest lies in how Apple has achieved this kind of success revolved around the late founder Steve Jobs, who undoubtedly appears as one of the central figures in creating the status that Apple has ...

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

  11. Job satisfaction among a multigenerational nursing workforce.

    Science.gov (United States)

    Wilson, Barbara; Squires, Mae; Widger, Kimberley; Cranley, Lisa; Tourangeau, Ann

    2008-09-01

    To explore generational differences in job satisfaction. Effective retention strategies are required to mitigate the international nursing shortage. Job satisfaction, a strong and consistent predictor of retention, may differ across generations. Understanding job satisfaction generational differences may lead to increasing clarity about generation-specific retention approaches. The Ontario Nurse Survey collected data from 6541 Registered Nurses. Participants were categorized as Baby Boomer, Generation X or Generation Y based on birth year. Multivariate analysis of variance explored generational differences for overall and specific satisfaction components. In overall job satisfaction and five specific satisfaction components, Baby Boomers were significantly more satisfied than Generations X and Y. It is imperative to improve job satisfaction for younger generations of nurses. Strategies to improve job satisfaction for younger generations of nurses may include creating a shared governance framework where nurses are empowered to make decisions. Implementing shared governance, through nurse-led unit-based councils, may lead to greater job satisfaction, particularly for younger nurses. Opportunities to self schedule or job share may be other potential approaches to increase job satisfaction, especially for younger generations of nurses. Another potential strategy would be to aggressively provide and support education and career-development opportunities.

  12. An integrative review of the influence of job strain and coping on nurses' work performance: Understanding the gaps in oncology nursing research

    Directory of Open Access Journals (Sweden)

    Dhuha Youssef Wazqar

    2017-10-01

    Full Text Available Nursing is known to be a stressful profession that can lead to physical and psychological health issues and behavioural problems. In oncology, workload among nurses is believed to be increasing in conjunction with rapidly increasing numbers of patients with cancer and staff shortages worldwide, therefore it is essential to sustain a quality oncology nurse workforce. Numerous studies have presented evidence on job strain, effects of coping strategies, and nurses' work performance within healthcare settings, but few have focused on oncology settings and none of these on nurses working in Saudi Arabia. The purpose of this review was to summarize empirical and theoretical evidence concerning job-related stressors in nurses, particularly oncology nurses, and the interrelationships among job strain, coping strategies, and work performance in this population. Search strategies identified studies published on studies in peer-reviewed journals from 2004 to 2016. Twenty-five nursing studies were found examining the relationships among the concepts of interest. Common job-related stressors among oncology nurses were high job demands, dealing with death/dying, lack of job control, and interpersonal conflicts at work. Job strain was found to be significantly linked to coping strategies, and negatively associated with work performance among nurses in general. There is no existing empirical evidence to support the relationship between coping strategies and work performance among oncology nurses. The present evidence is limited, and a considerable amount of research is required in the future to expand the oncology nursing literature. Research is needed to investigate job-related stressors and their effects on oncology nurses. Keywords: Coping, Job strain, Nurses, Review, Work performance

  13. Age-Differential Effects of Job Characteristics on Job Attraction: A Policy-Capturing Study.

    Science.gov (United States)

    Zacher, Hannes; Dirkers, Bodil T; Korek, Sabine; Hughes, Brenda

    2017-01-01

    Based on an integration of job design and lifespan developmental theories, Truxillo et al. (2012) proposed that job characteristics interact with employee age in predicting important work outcomes. Using an experimental policy-capturing design, we investigated age-differential effects of four core job characteristics (i.e., job autonomy, task variety, task significance, and feedback from the job) on job attraction (i.e., individuals' rating of job attractiveness). Eighty-two employees between 19 and 65 years ( M age = 41, SD = 14) indicated their job attraction for each of 40 hypothetical job descriptions in which the four job characteristics were systematically manipulated (in total, participants provided 3,280 ratings). Results of multilevel analyses showed that the positive effects of task variety, task significance, and feedback from the job were stronger for younger compared to older employees, whereas we did not find significant age-differential effects of job autonomy on job attraction. These findings are only partially consistent with propositions of Truxillo et al.'s (2012) lifespan perspective on job design.

  14. Sport Tournament Automated Scheduling System

    Directory of Open Access Journals (Sweden)

    Raof R. A. A

    2018-01-01

    Full Text Available 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 calculating the scores of each tournament. The problem of scheduling the matches of a round robin and knock-out phase in a sport league are given focus. The problem is defined formally and the computational complexity is being noted. A solution algorithm is presented using a two-step approach. The first step is the creation of a tournament pattern and is based on known graph-theoretic method. The second one is an assignment problem and it is solved using a constraint based depth-first branch and bound procedure that assigns actual teams to numbers in the pattern. As a result, the scheduling process and knock down phase become easy for the tournament organizer and at the same time increasing the level of reliability.

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

  16. Immunization Schedules for Adults

    Science.gov (United States)

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedule for Adults (19 Years of Age and ... diseases that can be prevented by vaccines . 2018 Immunization Schedule Recommended Vaccinations for Adults by Age and ...

  17. Instant Childhood Immunization Schedule

    Science.gov (United States)

    ... Recommendations Why Immunize? Vaccines: The Basics Instant Childhood Immunization Schedule Recommend on Facebook Tweet Share Compartir Get ... date. See Disclaimer for additional details. Based on Immunization Schedule for Children 0 through 6 Years of ...

  18. Job Search Education. Meeting the Challenge of Unemployment.

    Science.gov (United States)

    Kimeldorf, Martin; Tornow, Janice A.

    1984-01-01

    Provides background on the job club process and how it can be used for integrated training of special needs and regular education students in need of job search assistance. Includes field test project information. (JOW)

  19. Integration of Openstack cloud resources in BES III computing cluster

    Science.gov (United States)

    Li, Haibo; Cheng, Yaodong; Huang, Qiulan; Cheng, Zhenjing; Shi, Jingyan

    2017-10-01

    Cloud computing provides a new technical means for data processing of high energy physics experiment. However, the resource of each queue is fixed and the usage of the resource is static in traditional job management system. In order to make it simple and transparent for physicist to use, we developed a virtual cluster system (vpmanager) to integrate IHEPCloud and different batch systems such as Torque and HTCondor. Vpmanager provides dynamic virtual machines scheduling according to the job queue. The BES III use case results show that resource efficiency is greatly improved.

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

  1. Integrating perspectives of cognitive dissonance and coping theories into an understanding of the causal sequence between emotional labour, emotional dissonance and job burnout

    OpenAIRE

    Wijeratne, Aaron

    2017-01-01

    Customer service-based employees act as an interface between the consumer and the organisation using managed emotional display which is known as emotional labour. While much research into emotional labour has been conducted over the last three decades, disagreement persists regarding the consequences of emotional labour on employee well-being, ranging from job satisfaction to job burnout. Conflicting empirical findings suggests there is much to be understood regarding the impact of emotional ...

  2. Web Publishing Schedule

    Science.gov (United States)

    Section 207(f)(2) of the E-Gov Act requires federal agencies to develop an inventory and establish a schedule of information to be published on their Web sites, make those schedules available for public comment. To post the schedules on the web site.

  3. Outage scheduling and implementation

    International Nuclear Information System (INIS)

    Allison, J.E.; Segall, P.; Smith, R.R.

    1986-01-01

    Successful preparation and implementation of an outage schedule and completion of scheduled and emergent work within an identified critical path time frame is a result of careful coordination by Operations, Work Control, Maintenance, Engineering, Planning and Administration and others. At the Fast Flux Test Facility (FFTF) careful planning has been responsible for meeting all scheduled outage critical paths

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

  5. Die funksie van Elihu (Job 32-37 in die boek Job

    Directory of Open Access Journals (Sweden)

    H. Viviers

    1995-09-01

    Full Text Available The function of Elihu (Job 32-37 in the book of Job. The Elihu speeches (Job 32-37 in the design of the book of Job are usually evaluated either totally redundant or literary fitting and functional. Why were they integrated in the book of Job, without adding anything new or profound? A literary-pragmatic analysis was done on these speeches to detennine their function in Job. The text was analysed narratologically and poetically. This was complemented with insights from reception-criticism ("implied author", "implied reader" and pragmatics (politeness strategies in order to also. read "between the lines". The exigency for the integration of the Elihu speeches in the book of Job seems to be the ironic exposure of the doctrine of retribution.

  6. Scheduling lessons learned from the Autonomous Power System

    Science.gov (United States)

    Ringer, Mark J.

    1992-01-01

    The Autonomous Power System (APS) project at NASA LeRC is designed to demonstrate the applications of integrated intelligent diagnosis, control, and scheduling techniques to space power distribution systems. The project consists of three elements: the Autonomous Power Expert System (APEX) for Fault Diagnosis, Isolation, and Recovery (FDIR); the Autonomous Intelligent Power Scheduler (AIPS) to efficiently assign activities start times and resources; and power hardware (Brassboard) to emulate a space-based power system. The AIPS scheduler was tested within the APS system. This scheduler is able to efficiently assign available power to the requesting activities and share this information with other software agents within the APS system in order to implement the generated schedule. The AIPS scheduler is also able to cooperatively recover from fault situations by rescheduling the affected loads on the Brassboard in conjunction with the APEX FDIR system. AIPS served as a learning tool and an initial scheduling testbed for the integration of FDIR and automated scheduling systems. Many lessons were learned from the AIPS scheduler and are now being integrated into a new scheduler called SCRAP (Scheduler for Continuous Resource Allocation and Planning). This paper will service three purposes: an overview of the AIPS implementation, lessons learned from the AIPS scheduler, and a brief section on how these lessons are being applied to the new SCRAP scheduler.

  7. Multi-core processing and scheduling performance in CMS

    International Nuclear Information System (INIS)

    Hernández, J M; Evans, D; Foulkes, S

    2012-01-01

    Commodity hardware is going many-core. We might soon not be able to satisfy the job memory needs per core in the current single-core processing model in High Energy Physics. In addition, an ever increasing number of independent and incoherent jobs running on the same physical hardware not sharing resources might significantly affect processing performance. It will be essential to effectively utilize the multi-core architecture. CMS has incorporated support for multi-core processing in the event processing framework and the workload management system. Multi-core processing jobs share common data in memory, such us the code libraries, detector geometry and conditions data, resulting in a much lower memory usage than standard single-core independent jobs. Exploiting this new processing model requires a new model in computing resource allocation, departing from the standard single-core allocation for a job. The experiment job management system needs to have control over a larger quantum of resource since multi-core aware jobs require the scheduling of multiples cores simultaneously. CMS is exploring the approach of using whole nodes as unit in the workload management system where all cores of a node are allocated to a multi-core job. Whole-node scheduling allows for optimization of the data/workflow management (e.g. I/O caching, local merging) but efficient utilization of all scheduled cores is challenging. Dedicated whole-node queues have been setup at all Tier-1 centers for exploring multi-core processing workflows in CMS. We present the evaluation of the performance scheduling and executing multi-core workflows in whole-node queues compared to the standard single-core processing workflows.

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

  9. A customizable, scalable scheduling and reporting system.

    Science.gov (United States)

    Wood, Jody L; Whitman, Beverly J; Mackley, Lisa A; Armstrong, Robert; Shotto, Robert T

    2014-06-01

    Scheduling is essential for running a facility smoothly and for summarizing activities in use reports. The Penn State Hershey Clinical Simulation Center has developed a scheduling interface that uses off-the-shelf components, with customizations that adapt to each institution's data collection and reporting needs. The system is designed using programs within the Microsoft Office 2010 suite. Outlook provides the scheduling component, while the reporting is performed using Access or Excel. An account with a calendar is created for the main schedule, with separate resource accounts created for each room within the center. The Outlook appointment form's 2 default tabs are used, in addition to a customized third tab. The data are then copied from the calendar into either a database table or a spreadsheet, where the reports are generated.Incorporating this system into an institution-wide structure allows integration of personnel lists and potentially enables all users to check the schedule from their desktop. Outlook also has a Web-based application for viewing the basic schedule from outside the institution, although customized data cannot be accessed. The scheduling and reporting functions have been used for a year at the Penn State Hershey Clinical Simulation Center. The schedule has increased workflow efficiency, improved the quality of recorded information, and provided more accurate reporting. The Penn State Hershey Clinical Simulation Center's scheduling and reporting system can be adapted easily to most simulation centers and can expand and change to meet future growth with little or no expense to the center.

  10. Car painting process scheduling with harmony search algorithm

    Science.gov (United States)

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

    2018-02-01

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

  11. Disallowing Same-program Co-schedules to Improve Efficiency in Quad-core Servers

    OpenAIRE

    de Blanche, Andreas; Lundqvist, Thomas

    2017-01-01

    Programs running on different cores in a multicore server are often forced to share resources like off-chip memory, caches, I/O devices, etc. This resource sharing often leads to degraded performance, a slowdown, for the programs that share the resources. A job scheduler can improve performance by co-scheduling programs that use different resources on the same server. The most common approach to solve this co-scheduling problem has been to make job-schedulers resource aware, finding ways to c...

  12. Self efficacy, perceptions of social context, job satisfaction and their relationship with absence from work. An integrated model founded on social cognitive theory.

    Science.gov (United States)

    Di Tecco, Cristina; Borgogni, Laura

    2014-05-28

    Absenteeism is a major concern for organizations and companies since it has negative repercussions on productivity and represents a huge cost due to sick pay and expensive temporary replacement of employees who are obliged to take long-term absences. The current study aimed at focussing on absenteeism and its causes through the investigation of a conceptual model founded on social cognitive theory where self-efficacy and Perceptions of Social Context (PoSC, i.e., perceptions of immediate supervisor, colleagues and top management) concur to predict absence from work through the mediating role of job satisfaction. A group of 361 sales assistants and administrative staff employed by the Italian branch of a retail clothing multinational were administered a self-report questionnaire for measuring self-efficacy, PoSC and job satisfaction. We then matched the self-report answers with objective absence measures. Structural equation modelling lent support to the presumed relationships between variables. We found that: 1) self-efficacy was positively related to the three PoSC; 2) PoSC had a positive relationship with job satisfaction; 3) job satisfaction was negatively related to absence from work; 4) job satisfaction mediated the relationship between PoSC and absence from work. Overall, our contribution offers a theoretical basis for further investigations on the role of individual characteristics and perceptions of social context in absenteeism studies via both observational and intervention studies and cost-effectiveness analysis.

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

  14. Integrating Photovoltaic Systems into Low-Income Housing Developments: A Case Study on the Creation of a New Residential Financing Model and Low-Income Resident Job Training Program, September 2011 (Brochure)

    Energy Technology Data Exchange (ETDEWEB)

    Dean, J.; Smith-Dreier, C.; Mekonnen, G.; Hawthorne, W.

    2011-09-01

    This case study covers the process of successfully integrating photovoltaic (PV) systems into a low-income housing development in northeast Denver, Colorado, focusing specifically on a new financing model and job training. The Northeast Denver Housing Center (NDHC), working in cooperation with Del Norte Neighborhood Development Corporation, Groundwork Denver, and the National Renewable Energy Laboratory (NREL), was able to finance the PV system installations by blending private equity funding with utility rebates, federal tax credits, and public sector funding. A grant provided by the Governor's Energy Office allowed for the creation of the new financing model. In addition, the program incorporated an innovative low-income job training program and an energy conservation incentive program.

  15. Influence of titration schedule and maintenance dose on the tolerability of adjunctive eslicarbazepine acetate: An integrated analysis of three randomized placebo-controlled trials.

    Science.gov (United States)

    Krauss, Gregory; Biton, Victor; Harvey, Jay H; Elger, Christian; Trinka, Eugen; Soares da Silva, Patrício; Gama, Helena; Cheng, Hailong; Grinnell, Todd; Blum, David

    2018-01-01

    To examine the influence of titration schedule and maintenance dose on the incidence and type of treatment-emergent adverse events (TEAEs) associated with adjunctive eslicarbazepine acetate (ESL). Data from three randomized, double-blind, placebo-controlled trials were analyzed. Patients with refractory partial-onset seizures were randomized to maintenance doses of ESL 400, 800, or 1200mg QD (dosing was initiated at 400 or 800mg QD) or placebo. The incidence of TEAEs was analyzed during the double-blind period (2-week titration phase; 12-week maintenance phase), according to the randomized maintenance dose and the titration schedule. 1447 patients were included in the analysis. During the first week of treatment, 62% of patients taking ESL 800mg QD had ≥1 TEAE, vs 35% of those taking 400mg QD and 32% of the placebo group; dizziness, somnolence, nausea, and headache were numerically more frequent in patients taking ESL 800mg than those taking ESL 400mg QD. During the double-blind period, the incidences of common TEAEs were lower in patients who initiated ESL at 400mg vs 800mg QD. For the 800 and 1200mg QD maintenance doses, rates of TEAEs leading to discontinuation were lower in patients who began treatment with 400mg than in those who began taking ESL 800mg QD. Initiation of ESL at 800mg QD is feasible. However, initiating treatment with ESL 400mg QD for 1 or 2 weeks is recommended, being associated with a lower incidence of TEAEs, and related discontinuations. For some patients, treatment may be initiated at 800mg QD, if the need for more immediate seizure reduction outweighs concerns about increased risk of adverse reactions during initiation. Copyright © 2017 The Authors. Published by Elsevier B.V. All rights reserved.

  16. Job sharing as an employment alternative in group medical practice.

    Science.gov (United States)

    Vanek, E P; Vanek, J A

    2001-01-01

    Although physicians discuss quality-of-life and employment issues with their patients, they often fail to consider flexible scheduling and reduced employment options to lessen their own job stress. We examined one of these options by surveying two community-based, private practice groups with a combined 13-year experience with job sharing. We found that a majority of respondents rated job sharing as successful, and most wanted it to continue. Job sharers derived considerable personal benefit from the arrangement and had significantly more positive attitudes toward work than full-time physicians. Job sharing appeared to have little impact on practice parameters. Dependability, flexibility and willingness to cooperate were the most important attributes in choosing a job-sharing partner. Job sharing is an employment alternative worth exploring to retain physicians in medical group practice.

  17. Job-related resources and the pressures of working life.

    Science.gov (United States)

    Schieman, Scott

    2013-03-01

    Data from a 2011 representative sample of Canadian workers are used to test the resource versus the stress of higher status hypotheses. Drawing on the Job Demands-Resources model (JD-R), the resource hypothesis predicts that job-related resources reduce job pressure. The stress of higher status hypothesis predicts that job-related resources increase job pressure. Findings tend to favor the resource hypothesis for job autonomy and schedule control, while supporting the stress of higher status for job authority and challenging work. These findings help elaborate on the "resource" concept in the JD-R model and identify unique ways that such resources might contribute to the pressures of working life. Copyright © 2012 Elsevier Inc. All rights reserved.

  18. Overcoming job stress

    Science.gov (United States)

    ... medlineplus.gov/ency/patientinstructions/000884.htm Overcoming job stress To use the sharing features on this page, ... stay healthy and feel better. Causes of Job Stress Although the cause of job stress is different ...

  19. Physicians' Job Satisfaction.

    African Journals Online (AJOL)

    AmL

    doctors and retention of the existing doctors, in addition to the ... an employee's well-being Examples of job resources are job ..... increase physician job satisfaction for ensuring the .... both pay and benefits physicians at private hospitals.

  20. Second Job Entrepreneurs.

    Science.gov (United States)

    Gruenert, Jeffrey C.

    1999-01-01

    Data from the Current Population Survey reveal characteristics of second-job entrepreneurs, occupations in which these workers hold their second jobs, and the occupational and earnings relationships between their second and primary jobs. (Author)

  1. Job burnout.

    Science.gov (United States)

    Maslach, C; Schaufeli, W B; Leiter, M P

    2001-01-01

    Burnout is a prolonged response to chronic emotional and interpersonal stressors on the job, and is defined by the three dimensions of exhaustion, cynicism, and inefficacy. The past 25 years of research has established the complexity of the construct, and places the individual stress experience within a larger organizational context of people's relation to their work. Recently, the work on burnout has expanded internationally and has led to new conceptual models. The focus on engagement, the positive antithesis of burnout, promises to yield new perspectives on interventions to alleviate burnout. The social focus of burnout, the solid research basis concerning the syndrome, and its specific ties to the work domain make a distinct and valuable contribution to people's health and well-being.

  2. Job and Work Design

    OpenAIRE

    Van den Broeck, Anja; Parker, Sharon K.

    2017-01-01

    Job design or work design refers to the content, structure, and organization of tasks and activities. It is mostly studied in terms of job characteristics, such as autonomy, workload, role problems, and feedback. Throughout history, job design has moved away from a sole focus on efficiency and productivity to more motivational job designs, including the social approach toward work, Herzberg’s two-factor model, Hackman and Oldham’s job characteristics model, the job demand control model of Kar...

  3. Single machine scheduling with slack due dates assignment

    Science.gov (United States)

    Liu, Weiguo; Hu, Xiangpei; Wang, Xuyin

    2017-04-01

    This paper considers a single machine scheduling problem in which each job is assigned an individual due date based on a common flow allowance (i.e. all jobs have slack due date). The goal is to find a sequence for jobs, together with a due date assignment, that minimizes a non-regular criterion comprising the total weighted absolute lateness value and common flow allowance cost, where the weight is a position-dependent weight. In order to solve this problem, an ? time algorithm is proposed. Some extensions of the problem are also shown.

  4. The Nexus of Ethical Leadership, Job Performance, and Turnover Intention: The Mediating Role of Job Satisfaction

    Directory of Open Access Journals (Sweden)

    Imran Shafique

    2018-03-01

    Full Text Available This study aims to examine the impact of ethical leadership on employees' job satisfaction, job performance, and turnover intention. A conceptual framework is developed which integrates job satisfaction as a mediating mechanism in explaining the nexus among ethical leadership, employee job performance, and turnover intention. The proposed model is tested by using the data collected from a sample (n = 196 of tourist companies in Pakistan. The results reveal that ethical leadership has a positive effect on employees' job satisfaction, job performance and negative effect on employees' turnover intentions. Further, job satisfaction mediates the effect of ethical leadership on employees' job performance and turnover intentions. The findings recommend that the demonstration of ethical leadership behaviours by managers at the workplace increases the likelihood of employees' job satisfaction and performance, while reducing their intention to leave the job. This study elucidates that, in Pakistani tourism sector, ethical leadership plays a key role in achieving performance goals. Future research could analyse the said nexus in different sectors and across different cultures while considering other measures of individual performance. The originality of this study is theorizing as well as empirically testing the intervening mechanism of job satisfaction in probing the linkages among ethical leadership, job performance, and turnover intention in Pakistani workplace context.

  5. Optimal Rules for Single Machine Scheduling with Stochastic Breakdowns

    Directory of Open Access Journals (Sweden)

    Jinwei Gu

    2014-01-01

    Full Text Available This paper studies the problem of scheduling a set of jobs on a single machine subject to stochastic breakdowns, where jobs have to be restarted if preemptions occur because of breakdowns. The breakdown process of the machine is independent of the jobs processed on the machine. The processing times required to complete the jobs are constants if no breakdown occurs. The machine uptimes are independently and identically distributed (i.i.d. and are subject to a uniform distribution. It is proved that the Longest Processing Time first (LPT rule minimizes the expected makespan. For the large-scale problem, it is also showed that the Shortest Processing Time first (SPT rule is optimal to minimize the expected total completion times of all jobs.

  6. Data analysis with the DIANA meta-scheduling approach

    International Nuclear Information System (INIS)

    Anjum, A; McClatchey, R; Willers, I

    2008-01-01

    The concepts, design and evaluation of the Data Intensive and Network Aware (DIANA) meta-scheduling approach for solving the challenges of data analysis being faced by CERN experiments are discussed in this paper. Our results suggest that data analysis can be made robust by employing fault tolerant and decentralized meta-scheduling algorithms supported in our DIANA meta-scheduler. The DIANA meta-scheduler supports data intensive bulk scheduling, is network aware and follows a policy centric meta-scheduling. In this paper, we demonstrate that a decentralized and dynamic meta-scheduling approach is an effective strategy to cope with increasing numbers of users, jobs and datasets. We present 'quality of service' related statistics for physics analysis through the application of a policy centric fair-share scheduling model. The DIANA meta-schedulers create a peer-to-peer hierarchy of schedulers to accomplish resource management that changes with evolving loads and is dynamic and adapts to the volatile nature of the resources

  7. Scheduling multimedia services in cloud computing environment

    Science.gov (United States)

    Liu, Yunchang; Li, Chunlin; Luo, Youlong; Shao, Yanling; Zhang, Jing

    2018-02-01

    Currently, security is a critical factor for multimedia services running in the cloud computing environment. As an effective mechanism, trust can improve security level and mitigate attacks within cloud computing environments. Unfortunately, existing scheduling strategy for multimedia service in the cloud computing environment do not integrate trust mechanism when making scheduling decisions. In this paper, we propose a scheduling scheme for multimedia services in multi clouds. At first, a novel scheduling architecture is presented. Then, We build a trust model including both subjective trust and objective trust to evaluate the trust degree of multimedia service providers. By employing Bayesian theory, the subjective trust degree between multimedia service providers and users is obtained. According to the attributes of QoS, the objective trust degree of multimedia service providers is calculated. Finally, a scheduling algorithm integrating trust of entities is proposed by considering the deadline, cost and trust requirements of multimedia services. The scheduling algorithm heuristically hunts for reasonable resource allocations and satisfies the requirement of trust and meets deadlines for the multimedia services. Detailed simulated experiments demonstrate the effectiveness and feasibility of the proposed trust scheduling scheme.

  8. Integrating knowledge management in the context of evidence based learning: two concept models for facilitating the assessment and acquisition of job knowledge

    NARCIS (Netherlands)

    Mol, S.T.; Kismihók, G.; Ansari, F.; Dornhöfer, M.; Fathi, M.

    2013-01-01

    Within the field of Human Resource Management (HRM), the role of individual knowledge has received limited research attention despite offering the promise of superior job performance and improved managerial decision-making. In part, this lack of research may be attributed to the difficulty and

  9. Integrating Multi-Domain Distributed Energy Systems with Electric Vehicle PQ Flexibility: Optimal Design and Operation Scheduling for Sustainable Low-Voltage Distribution Grids

    DEFF Research Database (Denmark)

    Morvaj, Boran; Knezovic, Katarina; Evins, Ralph

    2016-01-01

    on the grid operation, in addition to coordinated charging, is analysed. Results showed that when the system can be optimally designed, emissions decrease by 64% and additionally 32% with proactive EV integration, whereas EV reactive power control enables integration of larger EV amounts and provides...... in the stable operation. The model was applied to a real low-voltage Danish distribution grid where measurement data is available on hourly basis in order to determine EV flexibility impacts on carbon emissions, as well as the benefits of optimal DES design. The influence of EV reactive power control...

  10. Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance

    OpenAIRE

    Rustogi, Kabir; Strusevich, Vitaly A.

    2015-01-01

    We study single machine scheduling problems with linear time-dependent deterioration effects and maintenance activities. Maintenance periods (MPs) are included into the schedule, so that the machine, that gets worse during the processing, can be restored to a better state. We deal with a job-independent version of the deterioration effects, that is, all jobs share a common deterioration rate. However, we introduce a novel extension to such models and allow the deterioration rates to change af...

  11. Planning and execution of jobs in nuclear power plants according to IWRS II. Pt. 1

    International Nuclear Information System (INIS)

    Hilmer, R.; Hauck, W.

    1986-01-01

    This paper deals with various efforts taken for a reduction of the radiation exposure of nuclear power plant staff. Health physics considerations range from the design of plants to include components requiring less time for maintenance and repair, to plant operation and optimization of job processes with special consideration of requirements made by radiation protection and maintenance. The paper presents in detail legal provisions and their translation into job process organization, job assignment and job schedulling. (HAG) [de

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

  13. Scheduling Additional Train Unit Services on Rail Transit Lines

    OpenAIRE

    Zhibin Jiang; Yuyan Tan; Özgür Yalçınkaya

    2014-01-01

    This paper deals with the problem of scheduling additional train unit (TU) services in a double parallel rail transit line, and a mixed integer programming (MIP) model is formulated for integration strategies of new trains connected by TUs with the objective of obtaining higher frequencies in some special sections and special time periods due to mass passenger volumes. We took timetable scheduling and TUs scheduling as an integrated optimization model with two objectives: minimizing travel ti...

  14. A distributed scheduling algorithm for heterogeneous real-time systems

    Science.gov (United States)

    Zeineldine, Osman; El-Toweissy, Mohamed; Mukkamala, Ravi

    1991-01-01

    Much of the previous work on load balancing and scheduling in distributed environments was concerned with homogeneous systems and homogeneous loads. Several of the results indicated that random policies are as effective as other more complex load allocation policies. The effects of heterogeneity on scheduling algorithms for hard real time systems is examined. A distributed scheduler specifically to handle heterogeneities in both nodes and node traffic is proposed. The performance of the algorithm is measured in terms of the percentage of jobs discarded. While a random task allocation is very sensitive to heterogeneities, the algorithm is shown to be robust to such non-uniformities in system components and load.

  15. The skill-divide in job quality: a cross-national analysis of 28 countries.

    Science.gov (United States)

    Stier, Haya

    2015-01-01

    This study focuses on the skill divide in job quality and the role of social institutions in structuring the relation of workers' qualifications to the attributes of their jobs. Four measures of job quality are examined: job security, job achievement, job content and work schedule flexibility. The study is based on the 2005 ISSP module on work orientations and encompasses 28 countries. Obtained through multilevel modeling, the findings show that low-skilled workers are disadvantaged in all aspects of job quality. However, skill inequality in the quality of employment depends on countries' characteristics, with declining inequality in countries at higher levels of technological development and to some extent also in times of technological growth. At times of high unemployment, skill disparities in job security widen while on other measures of job quality they decline. Under high market regulation, the low skilled enjoy better job security but on other measures, skill inequalities increase. Copyright © 2014 Elsevier Inc. All rights reserved.

  16. On-the-job-training, job search and job mobility

    OpenAIRE

    Josef Zweimüller; Rudolf Winter-Ebmer

    2003-01-01

    This paper analyzes the impact of formal training on worker mobility. Using data from the Swiss Labor Force Survey, we find that both general and specific training significantly affects on-the-job search activities. The effect of training on actual job mobility differs between searchers and non-searchers. In line with human capital theory, we find that specific (general) training has a negative (positive) impact on job mobility for previous non-searchers. For individuals who have been looking...

  17. Alternative Work Schedules: Definitions

    Science.gov (United States)

    Journal of the College and University Personnel Association, 1977

    1977-01-01

    The term "alternative work schedules" encompasses any variation of the requirement that all permanent employees in an organization or one shift of employees adhere to the same five-day, seven-to-eight-hour schedule. This article defines staggered hours, flexible working hours (flexitour and gliding time), compressed work week, the task system, and…

  18. Range Scheduling Aid (RSA)

    Science.gov (United States)

    Logan, J. R.; Pulvermacher, M. K.

    1991-01-01

    Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.

  19. A transportation-scheduling system for managing silvicultural projects

    Science.gov (United States)

    Jorge F. Valenzuela; H. Hakan Balci; Timothy McDonald

    2005-01-01

    A silvicultural project encompasses tasks such as sitelevel planning, regeneration, harvestin, and stand-tending treatments. an essential problem in managing silvicultural projects is to efficiently schedule the operations while considering project task due dates and costs of moving scarce resources to specific job locations. Transportation costs represent a...

  20. An optimal algorithm for preemptive on-line scheduling

    NARCIS (Netherlands)

    Chen, B.; Vliet, van A.; Woeginger, G.J.

    1995-01-01

    We investigate the problem of on-line scheduling jobs on m identical parallel machines where preemption is allowed. The goal is to minimize the makespan. We derive an approximation algorithm with worst-case guarantee mm/(mm - (m - 1)m) for every m 2, which increasingly tends to e/(e - 1) ˜ 1.58 as m

  1. Scheduling strategies for cycle scavenging in multicluster grid systems

    NARCIS (Netherlands)

    Sonmez, O.O.; Grundeken, B.; Mohamed, H.H.; Iosup, A.; Epema, D.H.J.

    2009-01-01

    The use of today's multicluster grids exhibits periods of submission bursts with periods of normal use and even of idleness. To avoid resource contention, many users employ observational scheduling, that is, they postpone the submission of relatively low-priority jobs until a cluster becomes

  2. 75 FR 28071 - Records Schedules; Availability and Request for Comments

    Science.gov (United States)

    2010-05-19

    ... authorized for disposal or reduce the retention period of records already authorized for disposal. NARA... this accumulation, agency records managers prepare schedules proposing retention periods for records... information concerning evaluations of enlisted personnel. Included are job ratings as well as information...

  3. Design optimum frac jobs using virtual intelligence techniques

    Science.gov (United States)

    Mohaghegh, Shahab; Popa, Andrei; Ameri, Sam

    2000-10-01

    Designing optimal frac jobs is a complex and time-consuming process. It usually involves the use of a two- or three-dimensional computer model. For the computer models to perform as intended, a wealth of input data is required. The input data includes wellbore configuration and reservoir characteristics such as porosity, permeability, stress and thickness profiles of the pay layers as well as the overburden layers. Among other essential information required for the design process is fracturing fluid type and volume, proppant type and volume, injection rate, proppant concentration and frac job schedule. Some of the parameters such as fluid and proppant types have discrete possible choices. Other parameters such as fluid and proppant volume, on the other hand, assume values from within a range of minimum and maximum values. A potential frac design for a particular pay zone is a combination of all of these parameters. Finding the optimum combination is not a trivial process. It usually requires an experienced engineer and a considerable amount of time to tune the parameters in order to achieve desirable outcome. This paper introduces a new methodology that integrates two virtual intelligence techniques, namely, artificial neural networks and genetic algorithms to automate and simplify the optimum frac job design process. This methodology requires little input from the engineer beyond the reservoir characterizations and wellbore configuration. The software tool that has been developed based on this methodology uses the reservoir characteristics and an optimization criteria indicated by the engineer, for example a certain propped frac length, and provides the detail of the optimum frac design that will result in the specified criteria. An ensemble of neural networks is trained to mimic the two- or three-dimensional frac simulator. Once successfully trained, these networks are capable of providing instantaneous results in response to any set of input parameters. These

  4. Design optimum frac jobs using virtual intelligence techniques

    Energy Technology Data Exchange (ETDEWEB)

    Shahab Mohaghegh; Andrei Popa; Sam Ameri [West Virginia University, Morgantown, WV (United States). Petroleum and Natural Gas Engineering

    2000-10-01

    Designing optimal frac jobs is a complex and time-consuming process. It usually involves the use of a two- or three-dimensional computer model. For the computer models to perform as intended, a wealth of input data is required. The input data includes wellbore configuration and reservoir characteristics such as porosity, permeability, stress and thickness profiles of the pay layers as well as the overburden layers. Among other essential information required for the design process is fracturing fluid type and volume, proppant type and volume, injection rate, proppant concentration and frac job schedule. Some of the parameters such as fluid and proppant types have discrete possible choices. Other parameters such as fluid and proppant volume, on the other hand, assume values from within a range of minimum and maximum values. A potential frac design for a particular pay zone is a combination of all of these parameters. Finding the optimum combination is not a trivial process. It usually requires an experienced engineer and a considerable amount of time to tune the parameters in order to achieve desirable outcome. This paper introduces a new methodology that integrates two virtual intelligence techniques, namely, artificial neural networks and genetic algorithms to automate and simplify the optimum frac job design process. This methodology requires little input from the engineer beyond the reservoir characterizations and wellbore configuration. The software tool that has been developed based on this methodology uses the reservoir characteristics and an optimization criteria indicated by the engineer, for example a certain propped frac length, and provides the detail of the optimum frac design that will result in the specified criteria. An ensemble of neural networks is trained to mimic the two- or three-dimensional frac simulator. Once successfully trained, these networks are capable of providing instantaneous results in response to any set of input parameters. These

  5. How do employees prioritise when they schedule their own shifts?

    DEFF Research Database (Denmark)

    Nabe-Nielsen, Kirsten; Lund, Henrik; Hansen, Åse Marie

    2013-01-01

    to their family life, having consecutive time off, leisure-time activities, rest between shifts, sleep, regularity of their everyday life, health and that the work schedule balanced. Thus, employees consider both their own and the workplace's needs when they have the opportunity to schedule their own shifts. Age......We investigated how employees prioritised when they scheduled their own shifts and whether priorities depended on age, gender, educational level, cohabitation and health status. We used cross-sectional questionnaire data from the follow-up survey of an intervention study investigating the effect...... of self-scheduling (n = 317). Intervention group participants were asked about their priorities when scheduling their own shifts succeeded by 17 items covering family/private life, economy, job content, health and sleep. At least half of the participants reported that they were giving high priority...

  6. Automated Planning and Scheduling for Space Mission Operations

    Science.gov (United States)

    Chien, Steve; Jonsson, Ari; Knight, Russell

    2005-01-01

    Research Trends: a) Finite-capacity scheduling under more complex constraints and increased problem dimensionality (subcontracting, overtime, lot splitting, inventory, etc.) b) Integrated planning and scheduling. c) Mixed-initiative frameworks. d) Management of uncertainty (proactive and reactive). e) Autonomous agent architectures and distributed production management. e) Integration of machine learning capabilities. f) Wider scope of applications: 1) analysis of supplier/buyer protocols & tradeoffs; 2) integration of strategic & tactical decision-making; and 3) enterprise integration.

  7. Work-related factors, job satisfaction and intent to leave the current job among United States nurses.

    Science.gov (United States)

    Han, Kihye; Trinkoff, Alison M; Gurses, Ayse P

    2015-11-01

    To examine the relationships of work-related factors (e.g., autonomy, work schedule, supervisory and peer support) to nurses' job satisfaction and intent to leave their current position. Low job satisfaction and high turnover of nurses are major problems for health care. To improve nurse retention, work-related factors associated with job satisfaction and intent to leave should be investigated. A cross-sectional secondary data analysis. Data were obtained in 2004 from Wave 3 of the Nurses' Worklife and Health Study. A random sample of 5000 actively licenced nurses in Illinois and North Carolina (two U.S. states) were sent the survey in wave 1, of which 1641 actively working bedside nurses participated in wave 3. We examined associations of various work-related factors with job satisfaction and intent to leave the current position. Nurses who were dissatisfied with their job reported significantly higher psychological demands and lower autonomy than nurses who were satisfied. Nurses were significantly less satisfied with their jobs when they worked longer hours with inadequate breaks or sick days. Lack of support from peers and supervisors was also related to significantly lower odds of job satisfaction. For intention to leave, nurses who said they planned to leave their current job reported significantly lower autonomy and less support from their peers than nurses who intended to stay. A variety of modifiable work-related factors were significantly related to job satisfaction and intention to leave the current job among nurses. Future research should focus on developing interventions that could mitigate these factors (e.g., by improving work schedules, increasing autonomy and/or nurse support). The impact of such interventions on job satisfaction and intention to leave the current position could then be evaluated. To increase nurse retention, improved schedules, autonomy and supportive work environments should be promoted. © 2015 John Wiley & Sons Ltd.

  8. Project orie:nta.teci pla.:n:ni:ng, scheduling a.:nci controlling technique

    African Journals Online (AJOL)

    Review Technique. By October 1958 it ... (CPM) to schedule and control a very large project. and during the ... objectives are identified and the total job is broken down into ..... jobs in a single shop or shops in the plant, to scheduf- ing plants ...

  9. Job-Sharing Rises as Professors Seek Flexible Schedules.

    Science.gov (United States)

    Schneider, Alison

    2000-01-01

    Many academics, whether married couples or professional partners, are teaming up to share tenure-track positions, and, although the evidence is largely anecdotal, their numbers seem to be increasing especially in the smaller institutions. The biggest drawback may be earning only half a salary; the benefits include more time for research or family.…

  10. Job rotation and internal marketing for increased job satisfaction and organisational commitment in hospital nursing staff.

    Science.gov (United States)

    Chen, Su-Yueh; Wu, Wen-Chuan; Chang, Ching-Sheng; Lin, Chia-Tzu

    2015-04-01

    To develop or enhance the job satisfaction and organisational commitment of nurses by implementing job rotation and internal marketing practices. No studies in the nursing management literature have addressed the integrated relationships among job rotation, internal marketing, job satisfaction and organisational commitment. This cross-sectional study included 266 registered nurses (response rate 81.8%) in two southern Taiwan hospitals. Software used for data analysis were SPSS 14.0 and AMOS 14.0 (structural equation modelling). Job rotation and internal marketing positively affect the job satisfaction and organisational commitment of nurses, and their job satisfaction positively affects their organisational commitment. Job rotation and internal marketing are effective strategies for improving nursing workforce utilisation in health-care organisations because they help to achieve the ultimate goals of increasing the job satisfaction of nurses and encouraging them to continue working in the field. This in turn limits the vicious cycle of high turnover and low morale in organisations, which wastes valuable human resources. Job rotation and internal marketing help nursing personnel acquire knowledge, skills and insights while simultaneously improving their job satisfaction and organisational commitment. © 2013 John Wiley & Sons Ltd.

  11. Relationship Of Core Job Characteristics To Job Satisfaction And ...

    African Journals Online (AJOL)

    In order to clarify the conceptual and empirical distinction between job satisfaction and job involvement constructs, this study investigates the relationship between construction workers core job characteristics, job satisfaction and job involvement. It also investigates the mediating role of job satisfaction between core job ...

  12. Job sharing: a viable option for the clinical nurse specialist.

    Science.gov (United States)

    Haibeck, S V; Howard, J L

    1991-01-01

    NUMEROUS WORK TIME options have been developed to attract, retain and meet the various needs of nurses. Job sharing, a work option little known to nurses, can be a successful alternative for balancing professional and personal lifestyle. The business literature supports job sharing and other innovative work options as successful mechanisms in retaining quality employees in their respective professions. After exploring the literature in this area, a proposal for job sharing the oncology clinical nurse specialist (CNS) position was presented to the Personnel Director and Vice President of Nursing at our institution. The proposal addressed the advantages and disadvantages of the concept. These included: (1) scheduling flexibility, (2) reduced absenteeism and turnover, (3) increased productivity, (4) handling fringe benefits, and (5) job satisfaction. The proposal was accepted, and the job sharing position has been successfully implemented for more than 2 years now. This paper describes issues relevant to designing and implementing job sharing in a CNS position.

  13. NASA Schedule Management Handbook

    Science.gov (United States)

    2011-01-01

    The purpose of schedule management is to provide the framework for time-phasing, resource planning, coordination, and communicating the necessary tasks within a work effort. The intent is to improve schedule management by providing recommended concepts, processes, and techniques used within the Agency and private industry. The intended function of this handbook is two-fold: first, to provide guidance for meeting the scheduling requirements contained in NPR 7120.5, NASA Space Flight Program and Project Management Requirements, NPR 7120.7, NASA Information Technology and Institutional Infrastructure Program and Project Requirements, NPR 7120.8, NASA Research and Technology Program and Project Management Requirements, and NPD 1000.5, Policy for NASA Acquisition. The second function is to describe the schedule management approach and the recommended best practices for carrying out this project control function. With regards to the above project management requirements documents, it should be noted that those space flight projects previously established and approved under the guidance of prior versions of NPR 7120.5 will continue to comply with those requirements until project completion has been achieved. This handbook will be updated as needed, to enhance efficient and effective schedule management across the Agency. It is acknowledged that most, if not all, external organizations participating in NASA programs/projects will have their own internal schedule management documents. Issues that arise from conflicting schedule guidance will be resolved on a case by case basis as contracts and partnering relationships are established. It is also acknowledged and understood that all projects are not the same and may require different levels of schedule visibility, scrutiny and control. Project type, value, and complexity are factors that typically dictate which schedule management practices should be employed.

  14. Data Model Approach And Markov Chain Based Analysis Of Multi-Level Queue Scheduling

    Directory of Open Access Journals (Sweden)

    Diwakar Shukla

    2010-01-01

    Full Text Available There are many CPU scheduling algorithms inliterature like FIFO, Round Robin, Shortest-Job-First and so on.The Multilevel-Queue-Scheduling is superior to these due to itsbetter management of a variety of processes. In this paper, aMarkov chain model is used for a general setup of Multilevelqueue-scheduling and the scheduler is assumed to performrandom movement on queue over the quantum of time.Performance of scheduling is examined through a rowdependent data model. It is found that with increasing value of αand d, the chance of system going over the waiting state reduces.At some of the interesting combinations of α and d, it diminishesto zero, thereby, provides us some clue regarding better choice ofqueues over others for high priority jobs. It is found that ifqueue priorities are added in the scheduling intelligently thenbetter performance could be obtained. Data model helpschoosing appropriate preferences.

  15. Job Satisfaction and Job Performance at the Work Place

    OpenAIRE

    Vanden Berghe, Jae Hyung

    2011-01-01

    The topic of the thesis is job satisfaction and job performance at the work place. The aim is to define the determinants for job satisfaction and to investigate the relationship between job satisfaction and job performance and the influence of job satisfaction on job performance. First we look into the Theory of Reasoned Action and the Theory of Planned Behaviour to account for the relationship between attitudes and behaviour. Job satisfaction is then explained as a function of job feature...

  16. Schedule-Aware Workflow Management Systems

    Science.gov (United States)

    Mans, Ronny S.; Russell, Nick C.; van der Aalst, Wil M. P.; Moleman, Arnold J.; Bakker, Piet J. M.

    Contemporary workflow management systems offer work-items to users through specific work-lists. Users select the work-items they will perform without having a specific schedule in mind. However, in many environments work needs to be scheduled and performed at particular times. For example, in hospitals many work-items are linked to appointments, e.g., a doctor cannot perform surgery without reserving an operating theater and making sure that the patient is present. One of the problems when applying workflow technology in such domains is the lack of calendar-based scheduling support. In this paper, we present an approach that supports the seamless integration of unscheduled (flow) and scheduled (schedule) tasks. Using CPN Tools we have developed a specification and simulation model for schedule-aware workflow management systems. Based on this a system has been realized that uses YAWL, Microsoft Exchange Server 2007, Outlook, and a dedicated scheduling service. The approach is illustrated using a real-life case study at the AMC hospital in the Netherlands. In addition, we elaborate on the experiences obtained when developing and implementing a system of this scale using formal techniques.

  17. Flexible work schedules, older workers, and retirement.

    Science.gov (United States)

    Siegenthaler, J K; Brenner, A M

    2000-01-01

    Older workers in the United States indicate that they would prefer flexible work arrangements rather than abrupt retirement, yet management has done very little to make this possible. A review of two bodies of literature from the late 1980s is presented: social science writings including sociological, gerontological, and economic literature, and business and management literature. There is a clash between the way jobs are traditionally scheduled and the needs of growing numbers of older workers. Workers continue to be subject to obstacles to phased retirement due to the structuring of health care and pension benefits, downsizing, organizational inflexibility, and "corporate culture." Thus, general views among social scientists regarding the desirability of flexible schedules toward retirement will not produce real changes unless management becomes committed to such changes and they are securely embedded in company policies.

  18. Physician Fee Schedule Search

    Data.gov (United States)

    U.S. Department of Health & Human Services — This website is designed to provide information on services covered by the Medicare Physician Fee Schedule (MPFS). It provides more than 10,000 physician services,...

  19. Clinical Laboratory Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Outpatient clinical laboratory services are paid based on a fee schedule in accordance with Section 1833(h) of the Social Security Act. The clinical laboratory fee...

  20. CERN confirms LHC schedule

    CERN Document Server

    2003-01-01

    The CERN Council held its 125th session on 20 June. Highlights of the meeting included confirmation that the LHC is on schedule for a 2007 start-up, and the announcement of a new organizational structure in 2004.