Next Article in Journal
A Crowd Cooperative Spectrum Sensing Algorithm Using a Non-Ideal Channel
Next Article in Special Issue
Dual Market Facility Network Design under Bounded Rationality
Previous Article in Journal
Thermal Environment Prediction for Metro Stations Based on an RVFL Neural Network
Previous Article in Special Issue
Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(4), 50; https://doi.org/10.3390/a11040050

Evaluating Typical Algorithms of Combinatorial Optimization to Solve Continuous-Time Based Scheduling Problem

Institute of Control Sciences, 65 Profsoyuznaya Street, 117997 Moscow, Russia
These authors contributed equally to this work.
*
Authors to whom correspondence should be addressed.
Received: 22 February 2018 / Revised: 11 April 2018 / Accepted: 12 April 2018 / Published: 17 April 2018
(This article belongs to the Special Issue Algorithms for Scheduling Problems)
Full-Text   |   PDF [652 KB, uploaded 3 May 2018]   |  

Abstract

We consider one approach to formalize the Resource-Constrained Project Scheduling Problem (RCPSP) in terms of combinatorial optimization theory. The transformation of the original problem into combinatorial setting is based on interpreting each operation as an atomic entity that has a defined duration and has to be resided on the continuous time axis meeting additional restrictions. The simplest case of continuous-time scheduling assumes one-to-one correspondence of resources and operations and corresponds to the linear programming problem setting. However, real scheduling problems include many-to-one relations which leads to the additional combinatorial component in the formulation due to operations competition. We research how to apply several typical algorithms to solve the resulted combinatorial optimization problem: enumeration including branch-and-bound method, gradient algorithm, random search technique. View Full-Text
Keywords: RCPSP; combinatorial optimization; scheduling; linear programming; MES; Job Shop RCPSP; combinatorial optimization; scheduling; linear programming; MES; Job Shop
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Lazarev, A.A.; Nekrasov, I.; Pravdivets, N. Evaluating Typical Algorithms of Combinatorial Optimization to Solve Continuous-Time Based Scheduling Problem. Algorithms 2018, 11, 50.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top