Resource constrained project scheduling problem with alternative process plans and total changeover cost minimization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00194256" target="_blank" >RIV/68407700:21230/12:00194256 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Resource constrained project scheduling problem with alternative process plans and total changeover cost minimization
Original language description
We study the RCPSP problem with alternative process plans where the goal is to minimize the total changeover cost given by all performed changeovers. A special attention is paid to the model that includes deadlines and covers a possibility to define morealternative ways how to complete the project. A selection of activities present in the schedule influences both decision (finding a feasible schedule) and optimization problem. We propose a heuristic based on local search that is performed in a shiftingtime window. The heuristic is able to handle large scale instances in an efficient manner.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F12%2F1994" target="_blank" >GAP103/12/1994: Adaptive scheduling and Optimization algorithms for distributed Real-time Embeddes Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů