2018
DOI: 10.1061/(asce)co.1943-7862.0001524
|View full text |Cite
|
Sign up to set email alerts
|

Constructive Heuristics for Project Scheduling Resource Availability Cost Problem with Tardiness

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 41 publications
0
3
0
Order By: Relevance
“…In contrast, this definition decreases to 0% in the definition of low tardiness cost. Su, Santoro and Mendes (2018) took this value as an average of 25% of the resource's total unit costs, and these rates are determined as 87.5% in case of high cost and 12.5% in case of low cost. Furthermore, some researchers using test problems assigned random numbers between 1 and 10 (Kolisch, Sprecher and Drexl, 1995), (Afshar-Nadjafi and Shadrokh, 2008), (Pamay, 2011), 10 and 30 (Golestaneh, Jafari, Khalilzadeh and Karimi 2013), 10 and 20 (Afshar-Nadjafi, Basati and Maghsoudlou 2017) for tardiness unit penalty costs.…”
Section: Tardiness Penalty Costsmentioning
confidence: 99%
“…In contrast, this definition decreases to 0% in the definition of low tardiness cost. Su, Santoro and Mendes (2018) took this value as an average of 25% of the resource's total unit costs, and these rates are determined as 87.5% in case of high cost and 12.5% in case of low cost. Furthermore, some researchers using test problems assigned random numbers between 1 and 10 (Kolisch, Sprecher and Drexl, 1995), (Afshar-Nadjafi and Shadrokh, 2008), (Pamay, 2011), 10 and 30 (Golestaneh, Jafari, Khalilzadeh and Karimi 2013), 10 and 20 (Afshar-Nadjafi, Basati and Maghsoudlou 2017) for tardiness unit penalty costs.…”
Section: Tardiness Penalty Costsmentioning
confidence: 99%
“…Su et al [23] used a mixed-integer model and discrete constraints to solve the problems. Maghsoudlou et al [24] and Bibiks et al [25] applied the cuckoo Search algorithm to plan for the multirisk project with three distinct evaluation objectives.…”
Section: Approximation Algorithms For Ms-rcpspmentioning
confidence: 99%
“…)// parameter of the mutation operator (12) for (j � 0; j < n; j++) (14) end for (15) if (f (u i (t)) ≤ f(x i (t))) (16) x i (t+1) � u i (t) (17) else (18) x i (t+1) � x i (t) (19) end if (20) end for (21) Calculate the fitness and bestnest (22) If (makespan > min (fitness)) (23) makespan � min (fitness) (24) End if (25) bestnest ⟵ Reallocate (bestnest) (26) t ⟵ t + 1 (27) Input: currentBest //the best schedule among the current population Output: //the improved schedule (1) Begin (2) makespan � f(best) (3) newbest � currentBest; (4) R b ⟵ maxResource (newbest) //the last resource to finish its job (5) Tb ⟵ set of tasks is performed by resource Rb (6) For i � 1 to size(Tb) // Consider each task in T b , the set of tasks performed by resource R b (7) T i � T b [i]; (8) R i ⟵ set of resource that are skilled enough to execute the task i except R b (9) For j � 1 to size (R i ) // Consider each resource in turn (10)…”
Section: Imopse Datasetmentioning
confidence: 99%