Timing constraints' optimization of reserved tasks in the distributed shop-floor scheduling
Cited 2 times inCited 5 times in
- Timing constraints' optimization of reserved tasks in the distributed shop-floor scheduling
- Lee, S; Jung, Mooyoung
- MANUFACTURING SYSTEMS; RESOURCE-ALLOCATION
- Issue Date
- TAYLOR & FRANCIS LTD
- INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.41, no.2, pp.397 - 410
- This paper addresses timing constraints optimization for tasks in a single resource reserved by negotiation in agent-based distributed shop-floor scheduling. The proposed algorithm finds an optimal schedule that meets all the timing and other constraints, where timing constraints such as release times and deadlines are determined in advance through bidding-based production reservation. Even if the algorithm is terminated prematurely, it would still provide a complete schedule that is at least as good as any schedule currently obtained. Furthermore, it assists in managing unpredicted events by increasing marginal time space between the expected completion time of a task and its deadline.
- ; Go to Link
- Appears in Collections:
- SBA_Journal Papers
- Files in This Item:
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.