Search results for " Scheduling"
showing 10 items of 158 documents
Handling precedence constraints in scheduling problems by the sequence pair representation
2015
In this paper, we show that sequence pair (SP) representation, primarily applied to the rectangle packing problems appearing in the VLSI industry, can be a solution representation of precedence constrained scheduling. We present three interpretations of sequence pair, which differ in complexity of schedule evaluation and size of a corresponding solution space. For each interpretation we construct an incremental precedence constrained SP neighborhood evaluation algorithm, computing feasibility of each solution in the insert neighborhood in an amortized constant time per examined solution, and prove the connectivity property of the considered neighborhoods. To compare proposed interpretations…
Reference point based multi-objective evolutionary algorithms for group decisions
2008
While in the past decades research on multi-objective evolutionary algorithms (MOEA) has aimed at finding the whole set of Pareto optimal solutions, current approaches focus on only those parts of the Pareto front which satisfy the preferences of the decision maker (DM). Therefore, they integrate the DM early on in the optimization process instead of leaving him/her alone with the final choice of one solution among the whole Pareto optimal set. In this paper, we address an aspect which has been neglected so far in the research on integrating preferences: in most real-world problems, there is not only one DM, but a group of DMs trying to find one consensus decision all participants are wille…
Scheduling Multimodal Transportation Systems
2004
Abstract In this paper a Lagrangian based heuristic procedure for scheduling transportation networks is presented. The solution procedure schedules a single line at a time, possibly correcting the previous decisions at each step.
Parallel Simulated Annealing: Getting Super Linear Speedups
2005
The study described in this paper tries to improve and combine different approaches that are able to speed up applications of the Simulated Annealing model. It investigates separately two main aspects concerning the degree of parallelism an implementation can egectively exploit at the initial andfinal periods of an execution. As for case studies, it deals with two implementations: the Job shop Scheduling problem and the poryblio selection problem. The paper reports the results of a large number of experiments, carried out by means of a transputer network and a hypercube system. They give useful suggestions about selecting the most suitable values of the intervention parameters to achieve su…
Integer Preemption Problems
2014
A fundamental assumption in the basic RCPSP is that activities in progress are non-preemptable. Some papers reveal the potential benefits of allowing activity interruptions in the schedule when the objective is the makespan minimization. In this chapter we consider the Maxnint_PRCPSP in which it is assumed that activities can be interrupted at any integer time instant with no cost incurred, that each activity can be split into a maximum number of parts, and that each part has a minimum duration established. We show how some procedures developed for the RCPSP can be adapted to work with the Maxnint_PRCPSP and we introduce some procedures specifically designed for this problem. Furthermore, p…
Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem
2017
The Workforce Scheduling and Routing Problem (WSRP) is a combinatorial optimisation problem that involves scheduling and routing of workforce. Tackling this type of problem often requires handling a considerable number of requirements, including customers and workers preferences while minimising both operational costs and travelling distance. This study seeks to determine effective combinations of genetic operators combined with heuristics that help to find good solutions for this constrained combinatorial optimisation problem. In particular, it aims to identify the best set of operators that help to maximise customers and workers preferences satisfaction. This paper advances the understand…
Seed Activation Scheduling for Influence Maximization in Social Networks
2018
This paper addresses the challenge of strategically maximizing the influence spread in a social network, by exploiting cascade propagators termed “seeds”. It introduces the Seed Activation Scheduling Problem (SASP) that chooses the timing of seed activation under a given budget, over a given time horizon, in the presence/absence of competition. The SASP is framed as a blogger-centric marketing problem on a two-level network, where the decisions are made to buy sponsored posts from prominent bloggers at calculated points in time. A Bayesian evidence diffusion model – the Partial Parallel Cascade (PPC) model – allows the network nodes to be partially activated, proportional to their accumulat…
Evapotranspiration Estimation with the S-SEBI Method from Landsat 8 Data against Lysimeter Measurements at the Barrax Site, Spain
2021
Evapotranspiration (ET) is a variable of the climatic system and hydrological cycle that plays an important role in biosphere–atmosphere–hydrosphere interactions. In this paper, remote sensing-based ET estimates with the simplified surface energy balance index (S-SEBI) model using Landsat 8 data were compared with in situ lysimeter measurements for different land covers (Grass, Wheat, Barley, and Vineyard) at the Barrax site, Spain, for the period 2014–2018. Daily estimates produced superior performance than hourly estimates in all the land covers, with an average difference of 12% and 15% for daily and hourly ET estimates, respectively. Grass and Vineyard showed the best performance, with …
An evolutionary approach to multi-objective scheduling of mixed model assembly lines
1999
In this paper a multi-objective genetic algorithm for the scheduling of a mixed model assembly line is proposed, pursuing the line stop time minimisation together with the component usage smoothing. Specific features of the developed GA are step by step random selection of diversified crossover and mutation operators, population control for the substitution of duplicate chromosomes, and in-process updating of GA control parameters. Three different formulation of the fitness function were been tested with some distinct line configurations.
Multi-Objective and Multi-Criteria Analysis for Optimal Pump Scheduling in Water Systems
2018
This contribution focuses on the problem of optimal pump scheduling, a fundamental element in pursuing operation optimization of water distribution systems. A combined approach of multi-objective optimization and multi-criteria analysis is herein suggested to first find the Pareto front of non-dominated solutions and then to rank them based on a set of weighted criteria. The Non-Dominated Sorting Genetic Algorithm (NSGA-II) is proposed to solve the multi-objective problem, while the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) is used to achieve the final ranking.