Abstract : Method for robust schedule preparation for domain of profit based cooperation is introduced in this paper. The method aims schedules, which are prepared and concluded step-by-step during the team formation phase. The method takes into account domain specifics, like incomplete information about the partners, and their various reputation and skill levels. The method is based on critical path dispatching rule, which is widely used in heuristics for np hard and continuous scheduling problems. Experimental results are presented for various workflow structures and other configurations of the domain.
Type de document :
Communication dans un congrès
Ángel Ortiz; Rubén Darío Franco; Pedro Gómez Gasquet. 9th IFIP WG 5.5 International Conference on Balanced Automation Systems for Future Manufacturing Networks (BASYS), Jul 2010, Valencia, Spain. Springer, IFIP Advances in Information and Communication Technology, AICT-322, pp.160-167, 2010, Balanced Automation Systems for Future Manufacturing Networks. 〈10.1007/978-3-642-14341-0_19〉
https://hal.inria.fr/hal-01060720
Contributeur : Hal Ifip
<>
Soumis le : jeudi 16 novembre 2017 - 13:01:21
Dernière modification le : vendredi 17 novembre 2017 - 01:11:54
Document(s) archivé(s) le : samedi 17 février 2018 - 13:20:05
Jiří Hodík. Creation of Robust Schedule for Profit Based Cooperation. Ángel Ortiz; Rubén Darío Franco; Pedro Gómez Gasquet. 9th IFIP WG 5.5 International Conference on Balanced Automation Systems for Future Manufacturing Networks (BASYS), Jul 2010, Valencia, Spain. Springer, IFIP Advances in Information and Communication Technology, AICT-322, pp.160-167, 2010, Balanced Automation Systems for Future Manufacturing Networks. 〈10.1007/978-3-642-14341-0_19〉. 〈hal-01060720〉
