Timeline for How does the RCPSP's precedence constraint work?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 4, 2021 at 19:07 | comment | added | A.Omidi | NoThanks93330, thanks for the mentioned reference. @RobPratt, thank you for your answer. | |
| Apr 4, 2021 at 14:13 | vote | accept | NoThanks93330 | ||
| Apr 4, 2021 at 14:12 | comment | added | NoThanks93330 | RobPratt, Thank you for your answer. @A.Omidi I can't answer your question, but this version of the constraint is used e. g. in [2] on page 54. Maybe that helps for your research. [2] Artigues, Christian; Demassey, Sophie; Neron, Emmanuel (Hg.) (2008): Resource-constrained project scheduling. Models, algorithms, extensions and applications. London, Hoboken, NJ: ISTE; Wiley | |
| Apr 4, 2021 at 13:12 | comment | added | RobPratt | @A.Omidi it looks like you have $i$ and $j$ reversed, but that idea also works. Not sure which will perform better. | |
| Apr 4, 2021 at 8:42 | comment | added | A.Omidi | Many thanks for your suggestion. would you say please, if the following constraints are replaced instead of the second constraints, is there any reasonable change in the complexity of the model? $\sum_{t\in \mathcal{T}} t\cdot x_{(i,t)} - \sum_{t \in \mathcal{T}} t\cdot x_{(j,t)} \geq p_{j} \,\,\, \quad \forall (i,j) \in L_{(i,j)}$ Where $p_j$ is the processing time of job $j$. | |
| Apr 4, 2021 at 2:30 | history | answered | RobPratt | CC BY-SA 4.0 |