2003
DOI: 10.1299/kikaic.69.2458
|View full text |Cite
|
Sign up to set email alerts
|

Genetic Algorithm Based Reactive Scheduling (1st Report, Modification of Production Schedule for Delays of Manufacturing Processes)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…Among these data, production progress and work history data at a manufacturing floor are very important because they influence production efficiency indices, which are the quality, the cost, and the delivery [7]- [10]. To gather data of production progress and work history on the manufacturing floor, it is necessary to sense materials, machines, and workers, which are constituent elements of the manufacturing floor.…”
Section: Data Collection Methodsmentioning
confidence: 99%
“…Among these data, production progress and work history data at a manufacturing floor are very important because they influence production efficiency indices, which are the quality, the cost, and the delivery [7]- [10]. To gather data of production progress and work history on the manufacturing floor, it is necessary to sense materials, machines, and workers, which are constituent elements of the manufacturing floor.…”
Section: Data Collection Methodsmentioning
confidence: 99%
“…In prior research, Tanimizu (2003) has approached this issue via reactive scheduling using a genetic algorithm [6]. Reactive scheduling means that the schedule of the whole project is altered appropriately when the specification changes; that is, the initial schedule is changed.…”
Section: ) Speedy Pdca Cyclementioning
confidence: 99%
“…The main idea of the algorithm is based on the one using GA proposed by Tanimizu et al (2003). It is expected that the proposed algorithm is effective for the RS, because LCO is more effective algorithm than GA for solving JSP.…”
Section: Application Of Lco To Rsmentioning
confidence: 99%
“…Here, the metaheuristic algorithms are suitable for improving the schedule with fast computational time. As a preceding study which applies the metaheuristic algorithm to the RS, Tanimizu et al (2003) proposed the RS process algorithm using GA. The effectiveness of their method is verified by some comparative experiments using the RS process based on classical dispatching rules.…”
Section: Introductionmentioning
confidence: 99%