Time Symmetry of Project Scheduling with Time Windows 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%2F09%3A00158401" target="_blank" >RIV/68407700:21230/09:00158401 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Time Symmetry of Project Scheduling with Time Windows and Take-give Resources
Original language description
The paper studies a real production scheduling problem with special resources called take-give resources. Such resources are needed from the beginning of an activity to the completion of another activity of the production process. The difference to otherworks is that we consider sequence dependent changeover time on take-give resources. We formulate this problem by integer linear programming and we suggest a heuristic problem solution. In the second part of the paper we discuss how to construct a schedule in backward time orientation and we formulate a time symmetry mapping. Consequently it is shown that the mapping is bijective and involutive. Finally, performance of the heuristic algorithm with the time symmetry mapping is evaluated on a set of lacquer production benchmarks.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/OE09004" target="_blank" >OE09004: Elektro Contact and harness material for future Vehicles New Techno</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů