Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 54

Scheduling Related Abstracts

54 Centralized Peak Consumption Smoothing Revisited for Habitat Energy Scheduling

Authors: M. Benbouzid, Q. Bresson, A. Duclos, K. Longo, Q. Morel


Currently, electricity suppliers must predict the consumption of their customers in order to deduce the power they need to produce. It is, then, important in a first step to optimize household consumption to obtain more constant curves by limiting peaks in energy consumption. Here centralized real time scheduling is proposed to manage the equipment's starting in parallel. The aim is not to exceed a certain limit while optimizing the power consumption across a habitat. The Raspberry Pi is used as a box; this scheduler interacts with the various sensors in 6LoWPAN. At the scale of a single dwelling, household consumption decreases, particularly at times corresponding to the peaks. However, it would be wiser to consider the use of a residential complex so that the result would be more significant. So, the ceiling would no longer be fixed. The scheduling would be done on two scales, firstly, per dwelling, and secondly, at the level of a residential complex.

Keywords: Scheduling, Smart Grid, Energy Consumption, Wireless Sensor Network, energy box, Gang Model, energy management system

Procedia PDF Downloads 149
53 Trends in Solving Assembly Job Shop Scheduling Problem: A Review

Authors: Midhun Paul, T. Radha Ramanan


The objective of this work is to present a state-of-the-art literature review highlighting the challenges in the research of the scheduling of assembly job shop problem and providing an insight on how the future directions of the research would be. The number of work has been substantial that it requires a review to enable one to understand the origin of the research and how it is getting evolved. This review paper presents a comprehensive review of the literature dealing with various studies carried on assembly job shop scheduling. The review details the evolution of the AJS from the perspective of other scheduling problems and also presents a classification scheme. The work also identifies the potential directions for future research, which we believe to be worthwhile considering.

Keywords: Manufacturing, Scheduling, Future Directions, assembly job shop

Procedia PDF Downloads 240
52 Minimizing Total Completion Time in No-Wait Flowshops with Setup Times

Authors: Ali Allahverdi


The m-machine no-wait flowshop scheduling problem is addressed in this paper. The objective is to minimize total completion time subject to the constraint that the makespan value is not greater than a certain value. Setup times are treated as separate from processing times. Several recent algorithms are adapted and proposed for the problem. An extensive computational analysis has been conducted for the evaluation of the proposed algorithms. The computational analysis indicates that the best proposed algorithm performs significantly better than the earlier existing best algorithm.

Keywords: Scheduling, Algorithm, no-wait flowshop, setup times, total completion time, makespan

Procedia PDF Downloads 240
51 Metaheuristics to Solve Tasks Scheduling

Authors: Rachid Ziteuni, Selt Omar


In this paper, we propose a new polynomial metaheuristic elaboration (tabu search) for solving scheduling problems. This method allows us to solve the scheduling problem of n tasks on m identical parallel machines with unavailability periods. This problem is NP-complete in the strong sens and finding an optimal solution appears unlikely. Note that all data in this problem are integer and deterministic. The performance criterion to optimize in this problem which we denote Pm/N-c/summs of (wjCj) is the weighted sum of the end dates of tasks.

Keywords: Scheduling, tabu search, parallel identical machines, unavailability periods, metaheuristic

Procedia PDF Downloads 182
50 Optimization of Scheduling through Altering Layout Using Pro-Model

Authors: Zouhair Issa Ahmed, Ahmed Abdulrasool Ahmed, Falah Hassan Abdulsada


This paper presents a layout of a factory using Pro-Model simulation by choosing the best layout that gives the highest productivity and least work in process. The general problem is to find the best sequence in which jobs pass between the machines which are compatible with the technological constraints and optimal with respect to some performance criteria. The best simulation with Pro-Model program increased productivity and reduced work in process by balancing lines of production compared with the current layout of factory when productivity increased from 45 products to 180 products through 720 hours.

Keywords: Simulation, Scheduling, Pro-Model, balancing lines of production, layout planning, WIP

Procedia PDF Downloads 350
49 Solving Flowshop Scheduling Problems with Ant Colony Optimization Heuristic

Authors: Riaz Ahmad, Arshad Mehmood Ch, Imran Ali Ch, Waqas Durrani


This study deals with the application of Ant Colony Optimization (ACO) approach to solve no-wait flowshop scheduling problem (NW-FSSP). ACO algorithm so developed has been coded on Matlab computer application. The paper covers detailed steps to apply ACO and focuses on judging the strength of ACO in relation to other solution techniques previously applied to solve no-wait flowshop problem. The general purpose approach was able to find reasonably accurate solutions for almost all the problems under consideration and was able to handle a fairly large spectrum of problems with far reduced CPU effort. Careful scrutiny of the results reveals that the algorithm presented results better than other approaches like Genetic algorithm and Tabu Search heuristics etc; earlier applied to solve NW-FSSP data sets.

Keywords: Scheduling, makespan, ant colony optimization (ACO), no-wait, flowshop

Procedia PDF Downloads 265
48 Formalizing a Procedure for Generating Uncertain Resource Availability Assumptions Based on Real Time Logistic Data Capturing with Auto-ID Systems for Reactive Scheduling

Authors: Lars Laußat, Manfred Helmus, Kamil Szczesny, Markus König


As one result of the project “Reactive Construction Project Scheduling using Real Time Construction Logistic Data and Simulation”, a procedure for using data about uncertain resource availability assumptions in reactive scheduling processes has been developed. Prediction data about resource availability is generated in a formalized way using real-time monitoring data e.g. from auto-ID systems on the construction site and in the supply chains. The paper focuses on the formalization of the procedure for monitoring construction logistic processes, for the detection of disturbance and for generating of new and uncertain scheduling assumptions for the reactive resource constrained simulation procedure that is and will be further described in other papers.

Keywords: Scheduling, monitoring, RFID, Fuzzy, auto-ID, construction logistic

Procedia PDF Downloads 354
47 Schedule a New Production Plan by Heuristic Methods

Authors: Hanife Merve Öztürk, Sıdıka Dalgan


In this project, a capacity analysis study is done at TAT A. Ş. Maret Plant. Production capacity of products which generate 80% of sales amount are determined. Obtained data entered the LEKIN Scheduling Program and we get production schedules by using heuristic methods. Besides heuristic methods, as mathematical model, disjunctive programming formulation is adapted to flexible job shop problems by adding a new constraint to find optimal schedule solution.

Keywords: Scheduling, Mathematical Modelling, flexible job shop problem, shifting bottleneck heuristic

Procedia PDF Downloads 239
46 Airport Check-In Optimization by IP and Simulation in Combination

Authors: Ahmed Al-Sultan


The check-in area of airport terminal is one of the busiest sections at airports at certain periods. The passengers are subjected to queues and delays during the check-in process. These delays and queues are due to constraints in the capacity of service facilities. In this project, the airport terminal is decomposed into several check-in areas. The airport check-in scheduling problem requires both a deterministic (integer programming) and stochastic (simulation) approach. Integer programming formulations are provided to minimize the total number of counters in each check-in area under the realistic constraint that counters for one and the same flight should be adjacent and the desired number of counters remaining in each area should be fixed during check-in operations. By using simulation, the airport system can be modeled to study the effects of various parameters such as number of passengers on a flight and check-in counter opening and closing time.

Keywords: Simulation, Scheduling, Integer Programming, airport terminal

Procedia PDF Downloads 251
45 Matlab Method for Exclusive-or Nodes in Fuzzy GERT Networks

Authors: Roland Lachmayer, Mahtab Afsari


Research is the cornerstone for advancement of human communities. So that it is one of the indexes for evaluating advancement of countries. Research projects are usually cost and time-consuming and do not end in result in short term. Project scheduling is one of the integral parts of project management. The present article offers a new method by using C# and Matlab software to solve Fuzzy GERT networks for Exclusive-OR kind of nodes to schedule the network. In this article we concentrate on flowcharts that we used in Matlab to show how we apply Matlab to schedule Exclusive-OR nodes.

Keywords: Scheduling, research projects, fuzzy GERT, fuzzy CPM, CPM, α-cuts

Procedia PDF Downloads 221
44 Critical Path Segments Method for Scheduling Technique

Authors: Sherif M. Hafez, Remon F. Aziz, May S. A. Elalim


Project managers today rely on scheduling tools based on the Critical Path Method (CPM) to determine the overall project duration and the activities’ float times which lead to greater efficiency in planning and control of projects. CPM was useful for scheduling construction projects, but researchers had highlighted a number of serious drawbacks that limit its use as a decision support tool and lacks the ability to clearly record and represent detailed information. This paper discusses the drawbacks of CPM as a scheduling technique and presents a modified critical path method (CPM) model which is called critical path segments (CPS). The CPS scheduling mechanism addresses the problems of CPM in three ways: decomposing the activity duration of separated but connected time segments; all relationships among activities are converted into finish–to–start relationship; and analysis and calculations are made with forward path. Sample cases are included to illustrate the shortages in CPM, CPS full analysis and calculations are explained in details, and how schedules can be handled better with the CPS technique.

Keywords: Construction Management, Scheduling, Project Control, critical path method, critical path segments, forward pass, float

Procedia PDF Downloads 214
43 Converting Scheduling Time into Calendar Date Considering Non-Interruptible Construction Tasks

Authors: Salman Ali Nisar, Suzuki Koji


In this paper we developed a new algorithm to convert the project scheduling time into calendar date in order to handle non-interruptible activities not to be split by non-working days (such as weekend and holidays). In a construction project some activities might require not to be interrupted even on non-working days, or to be finished on the end day of business days. For example, concrete placing work might be required to be completed by the end day of weekdays i.e. Friday, and curing in the weekend. This research provides an algorithm that imposes time constraint for start and finish times of non-interruptible activities. The algorithm converts working days, which is obtained by Critical Path Method (CPM), to calendar date with consideration of the start date of a project. After determining the interruption by non-working days, the start time of a certain activity should be postponed, if there is enough total float value. Otherwise, the duration is shortened by hiring additional resources capacity or/and using overtime work execution. Then, time constraints are imposed to start time and finish time of the activity. The algorithm is developed in Excel Spreadsheet for microcomputer and therefore we can easily get a feasible, calendared construction schedule for such a construction project with some non-interruptible activities.

Keywords: Scheduling, Project Management, critical path method, time constraint, non-interruptible tasks

Procedia PDF Downloads 368
42 Model-Based Automotive Partitioning and Mapping for Embedded Multicore Systems

Authors: Lukas Krawczyk, Burkhard Igel, Robert Höttger


This paper introduces novel approaches to partitioning and mapping in terms of model-based embedded multicore system engineering and further discusses benefits, industrial relevance and features in common with existing approaches. In order to assess and evaluate results, both approaches have been applied to a real industrial application as well as to various prototypical demonstrative applications, that have been developed and implemented for different purposes. Evaluations show, that such applications improve significantly according to performance, energy efficiency, meeting timing constraints and covering maintaining issues by using the AMALTHEA platform and the implemented approaches. Further- more, the model-based design provides an open, expandable, platform independent and scalable exchange format between OEMs, suppliers and developers on different levels. Our proposed mechanisms provide meaningful multicore system utilization since load balancing by means of partitioning and mapping is effectively performed with regard to the modeled systems including hardware, software, operating system, scheduling, constraints, configuration and more data.

Keywords: Distributed Systems, Scheduling, Mapping, System Analysis, partitioning, embedded multicore systems, model-based

Procedia PDF Downloads 469
41 Scheduling in a Single-Stage, Multi-Item Compatible Process Using Multiple Arc Network Model

Authors: Bokkasam Sasidhar, Ibrahim Aljasser


The problem of finding optimal schedules for each equipment in a production process is considered, which consists of a single stage of manufacturing and which can handle different types of products, where changeover for handling one type of product to the other type incurs certain costs. The machine capacity is determined by the upper limit for the quantity that can be processed for each of the products in a set up. The changeover costs increase with the number of set ups and hence to minimize the costs associated with the product changeover, the planning should be such that similar types of products should be processed successively so that the total number of changeovers and in turn the associated set up costs are minimized. The problem of cost minimization is equivalent to the problem of minimizing the number of set ups or equivalently maximizing the capacity utilization in between every set up or maximizing the total capacity utilization. Further, the production is usually planned against customers’ orders, and generally different customers’ orders are assigned one of the two priorities – “normal” or “priority” order. The problem of production planning in such a situation can be formulated into a Multiple Arc Network (MAN) model and can be solved sequentially using the algorithm for maximizing flow along a MAN and the algorithm for maximizing flow along a MAN with priority arcs. The model aims to provide optimal production schedule with an objective of maximizing capacity utilization, so that the customer-wise delivery schedules are fulfilled, keeping in view the customer priorities. Algorithms have been presented for solving the MAN formulation of the production planning with customer priorities. The application of the model is demonstrated through numerical examples.

Keywords: Optimization, Scheduling, maximal flow problem, multiple arc network model

Procedia PDF Downloads 299
40 Scheduling Jobs with Stochastic Processing Times or Due Dates on a Server to Minimize the Number of Tardy Jobs

Authors: H. M. Soroush


The problem of scheduling products and services for on-time deliveries is of paramount importance in today’s competitive environments. It arises in many manufacturing and service organizations where it is desirable to complete jobs (products or services) with different weights (penalties) on or before their due dates. In such environments, schedules should frequently decide whether to schedule a job based on its processing time, due-date, and the penalty for tardy delivery to improve the system performance. For example, it is common to measure the weighted number of late jobs or the percentage of on-time shipments to evaluate the performance of a semiconductor production facility or an automobile assembly line. In this paper, we address the problem of scheduling a set of jobs on a server where processing times or due-dates of jobs are random variables and fixed weights (penalties) are imposed on the jobs’ late deliveries. The goal is to find the schedule that minimizes the expected weighted number of tardy jobs. The problem is NP-hard to solve; however, we explore three scenarios of the problem wherein: (i) both processing times and due-dates are stochastic; (ii) processing times are stochastic and due-dates are deterministic; and (iii) processing times are deterministic and due-dates are stochastic. We prove that special cases of these scenarios are solvable optimally in polynomial time, and introduce efficient heuristic methods for the general cases. Our computational results show that the heuristics perform well in yielding either optimal or near optimal sequences. The results also demonstrate that the stochasticity of processing times or due-dates can affect scheduling decisions. Moreover, the proposed problem is general in the sense that its special cases reduce to some new and some classical stochastic single machine models.

Keywords: Scheduling, stochastic, number of late jobs, single server

Procedia PDF Downloads 331
39 A Review on Various Approaches for Energy Conservation in Green Cloud Computing

Authors: Sumati Manchanda


Cloud computing is one of the most recent developing engineering and is consistently utilized as a part of different IT firms so as to make benefits like expense sparing or financial minimization, it must be eco cordial also. In this manner, Green Cloud Computing is the need of the today's current situation. It is an innovation that is rising as data correspondence engineering. This paper surveys the unequivocal endeavors made by different specialists to make Cloud Computing more vitality preserving, to break down its vitality utilization focused around sorts of administrations gave furthermore to diminish the carbon foot shaped impression rate by colossal methodologies furthermore edify virtualization idea alongside different diverse methodologies which utilize virtual machines scheduling and migration. The summary of the proposed work by various authors that we have reviewed is also presented in the paper.

Keywords: Migration, Cloud Computing, Scheduling, Energy Efficiency, Virtualization, Green Cloud Computing

Procedia PDF Downloads 260
38 A New Mathematical Model for Scheduling Preventive Maintenance and Renewal Projects of Multi-Unit Systems; Application to Railway Track

Authors: Farzad Pargar


We introduce the preventive maintenance and renewal scheduling problem for a multi-unit system over a finite and discretized time horizon. Given the latest possible time for carrying out the next maintenance and renewal projects after the previous ones and considering several common set-up costs, the introduced scheduling model tries to minimize the cost of projects by grouping them and simultaneously finding the optimal balance between doing maintenance and renewal. We present a 0-1 pure integer linear programming that determines which projects should be performed together on which location and in which period (e.g., week or month). We consider railway track as a case for our study and test the performance of the proposed model on a set of test problems. The experimental results show that the proposed approach performs well.

Keywords: Maintenance, Scheduling, renewal, mathematical programming model

Procedia PDF Downloads 548
37 Comparison of Due Date Assignment Rules in a Dynamic Job Shop

Authors: Mumtaz Ipek, Burak Erkayman


Due date is assigned as an input for scheduling problems. At the same time, due date is selected as a decision variable for real time scheduling applications. Correct determination of due dates increases shop floor performance and number of jobs completed on time. This subject has been mentioned widely in the literature. Moreover rules for due date determination have been developed from analytical analysis. When a job arrives to the shop floor, a due date is assigned for delivery. Various due date determination methods are used in the literature. In this study six different due date methods are implemented for a hypothetical dynamic job shop and the performances of the due date methods are compared.

Keywords: Scheduling, Management Engineering, dynamic job shop, due date assignment

Procedia PDF Downloads 397
36 Heuristic Search Algorithm (HSA) for Enhancing the Lifetime of Wireless Sensor Networks

Authors: Tripatjot S. Panag, J. S. Dhillon


The lifetime of a wireless sensor network can be effectively increased by using scheduling operations. Once the sensors are randomly deployed, the task at hand is to find the largest number of disjoint sets of sensors such that every sensor set provides complete coverage of the target area. At any instant, only one of these disjoint sets is switched on, while all other are switched off. This paper proposes a heuristic search method to find the maximum number of disjoint sets that completely cover the region. A population of randomly initialized members is made to explore the solution space. A set of heuristics has been applied to guide the members to a possible solution in their neighborhood. The heuristics escalate the convergence of the algorithm. The best solution explored by the population is recorded and is continuously updated. The proposed algorithm has been tested for applications which require sensing of multiple target points, referred to as point coverage applications. Results show that the proposed algorithm outclasses the existing algorithms. It always finds the optimum solution, and that too by making fewer number of fitness function evaluations than the existing approaches.

Keywords: Scheduling, Wireless Sensor Networks, coverage, heuristic, WSN, lifetime, disjoint sets

Procedia PDF Downloads 336
35 Solution Approaches for Some Scheduling Problems with Learning Effect and Job Dependent Delivery Times

Authors: M. Duran Toksari, Berrin Ucarkus


In this paper, we propose two algorithms to optimally solve makespan and total completion time scheduling problems with learning effect and job dependent delivery times in a single machine environment. The delivery time is the extra time to eliminate adverse effect between the main processing and delivery to the customer. In this paper, we introduce the job dependent delivery times for some single machine scheduling problems with position dependent learning effect, which are makespan are total completion. The results with respect to two algorithms proposed for solving of the each problem are compared with LINGO solutions for 50-jobs, 100-jobs and 150-jobs problems. The proposed algorithms can find the same results in shorter time.

Keywords: Scheduling, Delivery Times, total completion time, makespan, learning effect

Procedia PDF Downloads 338
34 A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem

Authors: G. M. Komaki, S. Mobin, E. Teymourian, S. Sheikh


This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attention and due to NP-Hard nature of the problem, metaheuristic algorithms have been proposed to tackle it. Majority of the proposed algorithms require large computational time which is the main drawback. In this study, a general variable neighborhood search algorithm (GVNS) is proposed where several time-saving schemes have been incorporated into it. Also, the GVNS uses the sophisticated method to change the shaking procedure or perturbation depending on the progress of the incumbent solution to prevent stagnation of the search. The performance of the proposed algorithm is compared to the state-of-the-art algorithms based on standard benchmark instances.

Keywords: Scheduling, makespan, distributed permutation flow shop, general variable neighborhood search algorithm

Procedia PDF Downloads 226
33 The Application of Bayesian Heuristic for Scheduling in Real-Time Private Clouds

Authors: Sahar Sohrabi


The emergence of Cloud data centers has revolutionized the IT industry. Private Clouds in specific provide Cloud services for certain group of customers/businesses. In a real-time private Cloud each task that is given to the system has a deadline that desirably should not be violated. Scheduling tasks in a real-time private CLoud determine the way available resources in the system are shared among incoming tasks. The aim of the scheduling policy is to optimize the system outcome which for a real-time private Cloud can include: energy consumption, deadline violation, execution time and the number of host switches. Different scheduling policies can be used for scheduling. Each lead to a sub-optimal outcome in a certain settings of the system. A Bayesian Scheduling strategy is proposed for scheduling to further improve the system outcome. The Bayesian strategy showed to outperform all selected policies. It also has the flexibility in dealing with complex pattern of incoming task and has the ability to adapt.

Keywords: Cloud Computing, Scheduling, Bayesian, real-time private cloud

Procedia PDF Downloads 225
32 Timetabling Communities’ Demands for an Effective Examination Timetabling Using Integer Linear Programming

Authors: N. A. H. Aizam, N. F. Jamaluddin


This paper explains the educational timetabling problem, a type of scheduling problem that is considered as one of the most challenging problem in optimization and operational research. The university examination timetabling problem (UETP), which involves assigning a set number of exams into a set number of timeslots whilst fulfilling all required conditions, has been widely investigated. The limitation of available timeslots and resources with the increasing number of examinations are the main reasons in the difficulty of solving this problem. Dynamical change in the examination scheduling system adds up the complication particularly in coping up with the demand and new requirements by the communities. Our objective is to investigate these demands and requirements with subjects taken from Universiti Malaysia Terengganu (UMT), through questionnaires. Integer linear programming model which reflects the preferences obtained to produce an effective examination timetabling was formed.

Keywords: Scheduling, integer linear programming, demands, educational timetabling, university examination timetabling problem (UETP)

Procedia PDF Downloads 214
31 The Effect of Work Site Dangers on the Management of Construction Projects in Syria

Authors: Mohammed Aljoma, Eblal Zakzok


Safety is a science that seeks to protect and avoid humans from risks in any field and prevent losses in properties and lives as much as possible. On the other hand, occupational safety goals aim to protect workers from risks which can occur during work execution. The main purpose of occupational safety is to ultimately protect people, properties and the environment by reducing accidents and injuries that may cause losses and damages. To achieve this goal, we must remove the direct and indirect reasons which cause accidents and injuries; some of the reasons of accidents are the unsafe cases and inept behavior or both of them. This research focuses on the manner of providing instant protection from the very first beginning to people, properties and the environment by: -Inserting safety demands in the planning and designing works by identifying risk levels in every task of the project, -Using a new risk managing system or modifying or changing a previously-used one.

Keywords: Planning, Risk management, Scheduling, project duration, site safety

Procedia PDF Downloads 169
30 Scheduling of Repetitive Activities for Height-Rise Buildings: Optimisation by Genetic Algorithms

Authors: Mohammed Aljoma


In this paper, a developed prototype for the scheduling of repetitive activities in height-rise buildings was presented. The activities that describe the behavior of the most of activities in multi-storey buildings are scheduled using the developed approach. The prototype combines three methods to attain the optimized planning. The methods include Critical Path Method (CPM), Gantt and Line of Balance (LOB). The developed prototype; POTER is used to schedule repetitive and non-repetitive activities with respect to all constraints that can be automatically generated using a generic database. The prototype uses the method of genetic algorithms for optimizing the planning process. As a result, this approach enables contracting organizations to evaluate various planning solutions that are calculated, tested and classified by POTER to attain an optimal time-cost equilibrium according to their own criteria of time or coast.

Keywords: Planning, Risk management, Genetic Algorithms, Construction Management, Scheduling, project duration, planning scheduling, repetitive activity

Procedia PDF Downloads 198
29 Tabu Search Algorithm for Ship Routing and Scheduling Problem with Time Window

Authors: Khaled Moh. Alhamad


This paper describes a tabu search heuristic for a ship routing and scheduling problem (SRSP). The method was developed to address the problem of loading cargos for many customers using heterogeneous vessels. Constraints relate to delivery time windows imposed by customers, the time horizon by which all deliveries must be made and vessel capacities. The results of a computational investigation are presented. Solution quality and execution time are explored with respect to problem size and parameters controlling the tabu search such as tenure and neighbourhood size.

Keywords: Transportation, Scheduling, tabu search, heuristic

Procedia PDF Downloads 341
28 An Efficient Hybrid Approach Based on Multi-Agent System and Emergence Method for the Integration of Systematic Preventive Maintenance Policies

Authors: Abdelhadi Adel, Kadri Ouahab


This paper proposes a hybrid algorithm for the integration of systematic preventive maintenance policies in hybrid flow shop scheduling to minimize makespan. We have implemented a problem-solving approach for optimizing the processing time, methods based on metaheuristics. The proposed approach is inspired by the behavior of the human body. This hybridization is between a multi-agent system and inspirations of the human body, especially genetics. The effectiveness of our approach has been demonstrated repeatedly in this paper. To solve such a complex problem, we proposed an approach which we have used advanced operators such as uniform crossover set and single point mutation. The proposed approach is applied to three preventive maintenance policies. These policies are intended to maximize the availability or to maintain a minimum level of reliability during the production chain. The results show that our algorithm outperforms existing algorithms. We assumed that the machines might be unavailable periodically during the production scheduling.

Keywords: Scheduling, Multi-Agent Systems, Genetic Algorithm, Emergence, makespan, systematic maintenance, hybrid flow shop scheduling

Procedia PDF Downloads 182
27 Scheduling Nodes Activity and Data Communication for Target Tracking in Wireless Sensor Networks

Authors: AmirHossein Mohajerzadeh, Mohammad Alishahi, Saeed Aslishahi, Mohsen Zabihi


In this paper, we consider sensor nodes with the capability of measuring the bearings (relative angle to the target). We use geometric methods to select a set of observer nodes which are responsible for collecting data from the target. Considering the characteristics of target tracking applications, it is clear that significant numbers of sensor nodes are usually inactive. Therefore, in order to minimize the total network energy consumption, a set of sensor nodes, called sentinel, is periodically selected for monitoring, controlling the environment and transmitting data through the network. The other nodes are inactive. Furthermore, the proposed algorithm provides a joint scheduling and routing algorithm to transmit data between network nodes and the fusion center (FC) in which not only provides an efficient way to estimate the target position but also provides an efficient target tracking. Performance evaluation confirms the superiority of the proposed algorithm.

Keywords: Scheduling, Routing, Wireless Sensor Networks, coverage, target tracking

Procedia PDF Downloads 237
26 M-Machine Assembly Scheduling Problem to Minimize Total Tardiness with Non-Zero Setup Times

Authors: Ali Allahverdi, Harun Aydilek, Asiye Aydilek


Our objective is to minimize the total tardiness in an m-machine two-stage assembly flowshop scheduling problem. The objective is an important performance measure because of the fact that the fulfillment of due dates of customers has to be taken into account while making scheduling decisions. In the literature, the problem is considered with zero setup times which may not be realistic and appropriate for some scheduling environments. Considering separate setup times from processing times increases machine utilization by decreasing the idle time and reduces total tardiness. We propose two new algorithms and adapt four existing algorithms in the literature which are different versions of simulated annealing and genetic algorithms. Moreover, a dominance relation is developed based on the mathematical formulation of the problem. The developed dominance relation is incorporated in our proposed algorithms. Computational experiments are conducted to investigate the performance of the newly proposed algorithms. We find that one of the proposed algorithms performs significantly better than the others, i.e., the error of the best algorithm is less than those of the other algorithms by minimum 50%. The newly proposed algorithm is also efficient for the case of zero setup times and performs better than the best existing algorithm in the literature.

Keywords: Simulation, Scheduling, Algorithm, assembly flowshop, total tardiness

Procedia PDF Downloads 195
25 Two Stage Assembly Flowshop Scheduling Problem Minimizing Total Tardiness

Authors: Ali Allahverdi, Harun Aydilek, Asiye Aydilek


The two stage assembly flowshop scheduling problem has lots of application in real life. To the best of our knowledge, the two stage assembly flowshop scheduling problem with total tardiness performance measure and separate setup times has not been addressed so far, and hence, it is addressed in this paper. Different dominance relations are developed and several algorithms are proposed. Extensive computational experiments are conducted to evaluate the proposed algorithms. The computational experiments have shown that one of the algorithms performs much better than the others. Moreover, the experiments have shown that the best performing algorithm performs much better than the best existing algorithm for the case of zero setup times in the literature. Therefore, the proposed best performing algorithm not only can be used for problems with separate setup times but also for the case of zero setup times.

Keywords: Scheduling, Algorithm, assembly flowshop, total tardiness

Procedia PDF Downloads 133