Skip to main content
Top

2018 | Book

Population-Based Approaches to the Resource-Constrained and Discrete-Continuous Scheduling

insite
SEARCH

About this book

This book addresses two of the most difficult and computationally intractable classes of problems: discrete resource constrained scheduling, and discrete-continuous scheduling. The first part of the book discusses problems belonging to the first class, while the second part deals with problems belonging to the second class. Both parts together offer valuable insights into the possibility of implementing modern techniques and tools with a view to obtaining high-quality solutions to practical and, at the same time, computationally difficult problems. It offers a valuable source of information for practitioners dealing with the real-world scheduling problems in industry, management and administration.

The authors have been working on the respective problems for the last decade, gaining scientific recognition through publications and active participation in the international scientific conferences, and their results are obtained using population-based methods. Dr E. Ratajczk-Ropel explores multiple agent and A-Team concepts, while Dr A. Skakovski focuses on evolutionary algorithms with a particular focus on the population learning paradigm.

Table of Contents

Frontmatter
Erratum to: Population-Based Approaches to the Resource-Constrained and Discrete-Continuous Scheduling
Ewa Ratajczak-Ropel, Aleksander Skakovski

Agent-Based Approach to the Single and Multi-mode Resource-Constrained Project Scheduling

Frontmatter
Chapter 1. Introduction
Abstract
The Resource-Constrained Project Scheduling Problem (RCPSP), as well as its numerous extensions and special cases, have attracted a lot of attention and many exact, heuristic and metaheuristic solution methods have been proposed in the literature in recent years [14].
Ewa Ratajczak-Ropel
Chapter 2. Agent-Based Optimization
Abstract
Agents and agent-based approaches are an active research topis in artificial intelligence and expert systems.
Ewa Ratajczak-Ropel
Chapter 3. Project Scheduling Models
Abstract
Project scheduling problems (PSP) could be defined as allocating scarce resources over time to perform a given set of activities.
Ewa Ratajczak-Ropel
Chapter 4. Resource-Constrained Project Scheduling
Abstract
The first part of this chapter presents Resource-Constrained Project Scheduling Problem (RCPSP) formulations and notations (Sect. 4.1). It also provides an overview of the best methods proposed so far for solving this problem, including a set of relevant bibliographic references in Sect. 4.2.
Ewa Ratajczak-Ropel
Chapter 5. Multi-mode Resource-Constrained Project Scheduling
Abstract
The first part of this chapter presents Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP) formulations and notations (Sect. 5.1).
Ewa Ratajczak-Ropel
Chapter 6. Conclusions
Abstract
In this part of the book the agent based approaches to single-mode and multi-mode resource-constrained project scheduling problem have been considered.
Ewa Ratajczak-Ropel

Population-Based Approaches to the Discrete-Continuous Scheduling

Frontmatter
Chapter 7. Introduction
Abstract
The discrete-continuous scheduling problem (DCSP), discussed in the following part of this book, is a particular case of the resource-constrained project scheduling problem (RCPSP). For this reason we begin with a brief description of the RCPSP at the beginning of Chap. 8 and continue with a thorough discussion on the DCSP in the remainder.
Aleksander Skakovski
Chapter 8. Discrete-Continuous Scheduling Problem
Abstract
The discrete-continuous scheduling problem (DCSP) is a particular case of the more general resource-constrained project scheduling problem (RCPSP). The detailed description, as well as a survey of variants and extensions of the RCPSP, the reader might find in [1].
Aleksander Skakovski
Chapter 9. State-of-the-Art Review
Abstract
As it is known from Sect. 8.​7, the general methodology for solving any DCSP assumes firstly, determining feasible sequences of tasks on machines, and secondly, determining optimal allocation of continuous resource to these sequences.
Aleksander Skakovski
Chapter 10. Proposed Metaheuristics for Solving Problem ΘZ (DCSPwCRD)
Abstract
An island–based evolution algorithm (IBEA) belongs to the class of distributed algorithms.
Aleksander Skakovski
Chapter 11. Performance Evaluation of the Proposed Algorithms
Abstract
In this section, a research on the performance evaluation and ways of the performance improvement for some of the proposed algorithms are discussed. Some useful properties of the DEA, used in the PLA3 and the IBDEA, and a policy for its performance improvement are also presented.
Aleksander Skakovski
Chapter 12. Conclusions
Abstract
In the presented study, we have considered the discrete-continuous scheduling problem (DCSP) and approaches for solving it.
Aleksander Skakovski
Metadata
Title
Population-Based Approaches to the Resource-Constrained and Discrete-Continuous Scheduling
Authors
Ewa Ratajczak-Ropel
Aleksander Skakovski
Copyright Year
2018
Electronic ISBN
978-3-319-62893-6
Print ISBN
978-3-319-62892-9
DOI
https://doi.org/10.1007/978-3-319-62893-6

Premium Partner