科研之友
微信
新浪微博
Facebook
分享链接
摘要
The theory of network coordination provides theoretical foundations to explain how companies can overcome organizational boundaries and constraints to jointly manage business processes across their selling chains. In particular, this work focuses on Collaborative Scheduling, a collaboration process whereby selling chain trading partners activate either on-line or off-line inter-firm coordination mechanisms to jointly plan production activities in order to deliver the final products to end customers each one of them, being the delivery date as close to the date desired as possible. The problem of collaborative scheduling is formally defined by means of a mathematical model. In the model, the defined objective function has the goal to minimize the total weighted tardiness of the package of products acquired by the clients to be delivered in a specific date. The delivery date of each Product-Package is conditioned by the latest date established by each supplier for each product that forms part of the same one. Besides, having different process times for each product and different penalties for each Product-Package, each supplier can offer a different mix of additional products with different due date. Due to the complexity of the problem a Genetic Algorithm has been the approach taken for its resolution. The GA elements and procedures are defined and the parameters are tuned. Although the major contribution of this work focuses on the algorithmic development of a proposal in the context of operations research that could help to solve the problem also is discussed the environment in which this occurs and that justifies our interest. In order to validate the proposed solutions diverse configurations are presented and the results obtained by means of the GA and some heuristics rules are compared.
- 出版日期2012-8
