2002
DOI: 10.1016/s0305-0483(02)00024-5
|View full text |Cite
|
Sign up to set email alerts
|

Planning and re-planning in project and production scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2007
2007
2020
2020

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(14 citation statements)
references
References 10 publications
0
14
0
Order By: Relevance
“…In [7] the number of tasks that receives a new start time, after rescheduling, is minimized. Another approach [8] proposes to reschedule the remaining tasks, such that the sum of deviations of the new finishing times from the original ones is minimized.…”
Section: Related Workmentioning
confidence: 99%
“…In [7] the number of tasks that receives a new start time, after rescheduling, is minimized. Another approach [8] proposes to reschedule the remaining tasks, such that the sum of deviations of the new finishing times from the original ones is minimized.…”
Section: Related Workmentioning
confidence: 99%
“…Multi-mode problems with generalized precedence constraints have been considered by Barrios et al [14], Brucker and Knust [30], Calhoun et al [34], de Reyck and Herroelen [47], Drexl et al [64], Heilmann [82,83], Nonobe and Ibaraki [141], and Sabzehparvar and Seyed-Hosseini [156] (see also Section 3). Zhu et al [198] employ a multi-mode problem with generalized resource constraints (see also Section 4).…”
Section: Multiple Modesmentioning
confidence: 99%
“…The concepts of minimal and maximal time lags has also been considered within the multi-mode RCPSP, see Barrios et al [14], Brucker and Knust [30], Heilmann [82,83], de Reyck and Herroelen [47] and Calhoun et al [34]. Sabzehparvar and Seyed-Hosseini [156] consider minimal and maximal mode-dependent time lags, i.e.…”
Section: Maximal Time Lagsmentioning
confidence: 99%
“…In this research, four heuristic methods were developed based on GA and Simulated Annealing (SA). Calhoun, Dekcro, Moore, Chrissis and Van Hove [5] used Taboo search method for solving the scheduling problem. They used Java programming language for implementing the proposed model for 100 numbers of jobs over four numbers of machines.…”
Section: Related Workmentioning
confidence: 99%