Name
Abstract | ||
|---|---|---|
•A meta-heuristic solution approach using extended networks is presented.•Four types of setup times using activity segments are used.•A logical boolean optimizer is used to solve conflicts.•The impact of network and resource parameters on the makespan reduction is investigated. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cor.2019.05.004 | Computers & Operations Research |
Keywords | Field | DocType |
Project scheduling,RCPSP,Activity preemption,Setup times | Schedule (project management),Mathematical optimization,Preemption,Job shop scheduling,Boolean satisfiability problem,Schedule,Project network,Solver,Project networks,Mathematics | Journal |
Volume | ISSN | Citations |
109 | 0305-0548 | 1 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M Vanhoucke | 1 | 919 | 55.85 |
| José Coelho | 2 | 110 | 7.94 |