Name
Abstract | ||
|---|---|---|
Past approaches to solving the assembly scheduling problem have mainly been from the consideration of a hierarchically controlled shop. Thus, the problem is considered in its entirety and solved in a monolithic fashion. However, in recent times, there have been attempts to impose heterarchical or distributed control. The paper extends the work of Welgama (1997) in the area of distributed behaviour-based control and examines the performance of a model based on this for scheduling assembly problems. Using this approach, we investigate the performance of a set of scheduling problems for a 3-stage 4-station assembly problem. This performance is compared with a mixed integer programming (MIP) model of the same situation. The results are promising and show comparative due date and makespan performance. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/ICSMC.1998.725450 | SMC |
Keywords | Field | DocType |
assembling,distributed control,production control,3-stage 4-station assembly problem,assembly shop,distributed behaviour-based control,distributed scheduling,heterarchical control,mixed integer programming model,linear programming,job shop scheduling,assembly,scheduling problem | Job shop scheduling,Fair-share scheduling,Computer science,Scheduling (computing),Flow shop scheduling,Scheduling (production processes),Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Distributed computing | Conference |
Volume | ISSN | ISBN |
1 | 1062-922X | 0-7803-4778-1 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Tharumarajah | 1 | 18 | 2.74 |
| Bemelman, R. | 2 | 0 | 0.34 |
| Welgama, P. | 3 | 0 | 0.34 |
| Wells, A.J. | 4 | 10 | 1.22 |