Name
Abstract | ||
|---|---|---|
This paper deals with the problem of scheduling of mobile robots taking into account preemption cases in a flexible manufacturing system (FMS). In addition to capability of transporting materials between some machines, mobile robots are able to perform manufacturing tasks at other machines by using their manipulation arms. These manufacturing tasks can be preempted to allow mobile robots to transport materials when needed. The performance criterion is to minimize time required to complete all tasks, i.e. makespan. A mixed-integer programming (MIP) model is formulated to find the optimal solutions for the problem. Numerical experiments are investigated to demonstrate results of the proposed approach. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-07593-8_3 | DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE, 11TH INTERNATIONAL CONFERENCE |
Keywords | Field | DocType |
preemptive scheduling,mobile robots,mixed-integer programming | Scheduling (computing),Computer science,Real-time computing,Integer programming,Rate-monotonic scheduling,Artificial intelligence,Flexible manufacturing system,Distributed computing,Fixed-priority pre-emptive scheduling,Job shop scheduling,Fair-share scheduling,Mobile robot,Machine learning | Conference |
Volume | ISSN | Citations |
290 | 2194-5357 | 7 |
PageRank | References | Authors |
0.62 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Izabela Nielsen | 1 | 43 | 6.68 |
| Quang-Vinh Dang | 2 | 37 | 9.46 |
| Peter Nielsen | 3 | 50 | 19.16 |
| Pawel Pawlewski | 4 | 67 | 21.03 |