Time Symmetry of Resource Constrained Project Scheduling with General Temporal Constraints and Take-give Resources
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00243318" target="_blank" >RIV/68407700:21230/17:00243318 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10479-016-2184-6" target="_blank" >http://dx.doi.org/10.1007/s10479-016-2184-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10479-016-2184-6" target="_blank" >10.1007/s10479-016-2184-6</a>
Alternative languages
Result language
angličtina
Original language name
Time Symmetry of Resource Constrained Project Scheduling with General Temporal Constraints and Take-give Resources
Original language description
The paper studies a lacquer production scheduling problem formulated as a resource constrained project scheduling problem with general temporal constraints (i.e., positive and negative time-lags). This real-world scheduling problem requires so-called take-give resources that are needed from the beginning of an activity to the completion of another activity of the production process. Furthermore, we consider sequence dependent changeover times on take-give resources. We formulate this problem by mixed integer linear programming and we suggest a parallel heuristic to solve the problem. This heuristic exploits a time symmetry mapping which allows an easy construction of a schedule in the backward time orientation. In the second part of the paper, it is proven that the time symmetry mapping is bijective and involutive even for the problem with general temporal constraints, changeover times, and take-give resources. The motivation to use this mapping is to improve the performance of the heuristic and to simplify its implementation. Finally, the performance of the heuristic algorithm is evaluated on a set of lacquer production benchmarks requiring take-give resources and on standard benchmarks for the resource constrained project scheduling problem with general temporal constraints where we found new better solutions in 16 and 12 instances out of 90 for UBO500 and UBO1000 respectively.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA16-23509S" target="_blank" >GA16-23509S: Flexible Scheduling and Optimization Algorithms for Distributed Real-time Embedded Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Annals of Operations Research
ISSN
0254-5330
e-ISSN
1572-9338
Volume of the periodical
248
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
29
Pages from-to
209-237
UT code for WoS article
000392331900009
EID of the result in the Scopus database
2-s2.0-84963739915