Name
Abstract | ||
|---|---|---|
Production scheduling problem for complex manufacturing system has been the hotspot for research and industry communities. A priority rule-based scheduling algorithm has been proposed in this paper. The scheduling objective of this algorithm is to minimize the makespan, while maximizing the utilization of machines as much as possible. Some priority rules are represented, considering delivery date, number of operations, and processing time. These rules are applied to this proposed algorithm and the simulation results show that the algorithm achieves good results. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ICNC.2010.5582907 | ICNC |
Keywords | Field | DocType |
complex manufacturing process,priority rule-based scheduling algorithm,manufacturing systems,production control,industry communities,research communities,production scheduling,complex manufacturing system,priority rule,production scheduling problem,job shop,processing time,delivery date,rule based,scheduling algorithm,job shop scheduling | Mathematical optimization,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Flow shop scheduling,Priority inheritance,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing | Conference |
Volume | ISBN | Citations |
1 | 978-1-4244-5958-2 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenmin Miao | 1 | 0 | 0.68 |
| Zhongjun Li | 2 | 0 | 0.34 |
| Shukai Yuan | 3 | 0 | 0.34 |