Host: The Japan Society of Mechanical Engineers
Name : [in Japanese]
Date : March 12, 2019
Customers desire manufacturing company to make desired products quickly. It is essential not only to plan an efficient production schedule but also to plan a material resources schedule to carry out the production schedule. There is a case that there are multiple evaluation criteria of the parts ordering schedule which decides parts order quantity and timing. This paper proposes an optimization method for the parts ordering scheduling problem which can obtain a set of Pareto solutions in a trial. The method uses Combinatorial Auction which can deal with a plurality of auctioned goods at a time to imitate a negotiation among agents. This paper conducted computational experiments to confirm the effectiveness of the method.