2015
DOI: 10.1007/s00170-015-6981-x
|View full text |Cite
|
Sign up to set email alerts
|

Simulation and experimental design methods for job shop scheduling with material handling: a survey

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
19
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(19 citation statements)
references
References 56 publications
0
19
0
Order By: Relevance
“…Therefore, the Discrete Event Simulation (DES) method [3] is widely used for the design of manufacturing systems [4], solving production stage. Robots can undertake the same work faster and more consistently than human operators, but how fast can a robot work?…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, the Discrete Event Simulation (DES) method [3] is widely used for the design of manufacturing systems [4], solving production stage. Robots can undertake the same work faster and more consistently than human operators, but how fast can a robot work?…”
Section: Introductionmentioning
confidence: 99%
“…A lot of researchers have applied JS scheduling to material handling. A recent review paper summarizes how these problems are solved in dynamic and static problem settings [27]. In the same context, a mathematical programming approach has been proposed to optimize the material flow in a flexible JS automated manufacturing system, given the demand fluctuations and machine specifications [28].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Several methods dealing with FMS scheduling have been proposed [5][6][7][8] where the problem NP-hardness was the major challenge encountered [9]. In FMS scheduling, the most important task is to determine the sequence of production.…”
Section: Introductionmentioning
confidence: 99%
“…For PN analysis, several methods can be founded such as enumerative methods, which are adapted to FMS scheduling [8]. In fact, to solve the scheduling problem using enumerative methods, the reachability graph is entirely or partly explored to retrieve the optimal path [14].…”
Section: Introductionmentioning
confidence: 99%