Name
Title | ||
|---|---|---|
Scheduling FMS problems with heuristic search function and transition-timed Petri nets |
Abstract | ||
|---|---|---|
In flexible manufacturing system (FMS) scheduling problems, the production process and constraints can be modeled by Petri nets concisely. However, the search space for an optimal or suboptimal schedule will exponentially grow with the increase of problem size. In this paper, we consider the scheduling problems of FMS in the framework of timed-transition Petri nets. In the framework, each token owns a individual timestamp which faciliates the analysis of the concurrency characteristic of modeled system. To save search effort, we provide an admissible heuristic function which also considers the available time of shared machine resources and subparts during calculating the lower bound of the remaining time for unprocessed operations. We prove the heuristic function is more effective than prior ones. Thus, an optimal scheduling strategy can be obtained at much less effort. Several numerical experiments are provided to demonstrate the effect of the improved heuristic function. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10845-014-0943-2 | Journal of Intelligent Manufacturing |
Keywords | Field | DocType |
Flexible manufacturing system,Scheduling,Heuristic search,Timed-transition Petri net | Mathematical optimization,Incremental heuristic search,Heuristic,Petri net,Scheduling (computing),Computer science,Concurrency,Admissible heuristic,Scheduling (production processes),Flexible manufacturing system | Journal |
Volume | Issue | ISSN |
26 | 5 | 0956-5515 |
Citations | PageRank | References |
2 | 0.41 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| cheng li | 1 | 2 | 0.41 |
| Weimin Wu | 2 | 236 | 43.97 |
| yiping feng | 3 | 2 | 0.41 |
| Gang Rong | 4 | 22 | 2.28 |