Name
Title | ||
|---|---|---|
A linear time-cost tradeoff problem with multiple interim assessments within multiple projects in parallel. |
Abstract | ||
|---|---|---|
•We consider a project scheduling problem in which the jobs can be compressed.•The project consists of multiple subprojects with completely ordered jobs.•The objective is to minimize the total tardiness penalty and compression cost.•We develop a strongly polynomial time algorithm. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cie.2019.01.003 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Project scheduling,Time-cost tradeoff,Parallel precedence graph | Project scheduling problem,Mathematical optimization,Tardiness,Strongly polynomial,Interim,Engineering,Time complexity | Journal |
Volume | ISSN | Citations |
128 | 0360-8352 | 0 |
PageRank | References | Authors |
0.34 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Byung-Cheon Choi | 1 | 161 | 17.84 |
| Myoung-Ju Park | 2 | 29 | 7.50 |