2007
DOI: 10.1016/j.cie.2007.04.002
|View full text |Cite
|
Sign up to set email alerts
|

Capability of cumulative delay based reactive scheduling for job shops with machine breakdowns

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…As the reconfiguration period is equal to 15 units of time, and by following the Delay Time function, the value of cumulative delay time is very small: 0,005238 units of time (considering the data values from [8] for the estimated parameters a and b for the instance I (8,120,1.3,0.1,1). For this reason, the cumulative value was not considered in the results presented, as they have a very low impact on the final results.…”
Section: Simulations and Resultsmentioning
confidence: 99%
“…As the reconfiguration period is equal to 15 units of time, and by following the Delay Time function, the value of cumulative delay time is very small: 0,005238 units of time (considering the data values from [8] for the estimated parameters a and b for the instance I (8,120,1.3,0.1,1). For this reason, the cumulative value was not considered in the results presented, as they have a very low impact on the final results.…”
Section: Simulations and Resultsmentioning
confidence: 99%
“…They examined the single machine case in detail in order to find the optimal sequence of jobs. Suwa and Sandoh [16] suggested a scheduling policy for job-shop reactive scheduling under the circumstances of machines' unavailability. Hao and Lin [17] studied one of the classic scheduling in a dynamic environment that emphasizes responsiveness to environmental changes.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Examples of the first kind of approach are the work of Jain and Elmaraghy (1997), Fang and Xi (1997), Rangsaritratsamee et al (2004), Li et al (1993) and Suwa and Sandoh (2007). The first three make use of genetic algorithms, the fourth develops an heuristic algorithm that adapts ideas from MRP systems and the last one uses tabu search to generate schedules.…”
Section: Introductionmentioning
confidence: 99%