Basic analysis on cell manufacturing scheduling method with combinatorial auction Integration of local search into auction mechanism

Cell manufacturing systems are widely introduced to cope with the dynamically changing market demands. We propose a scheduling method with combinatorial auction for cell manufacturing systems. Combinatorial auction, that is one of the autonomous distributed scheduling methods, can effectively allocate multiple assets. In this paper, we aim to reduce the calculation time by effective method based on local search. We analyze the relationship between optimality and calculation time by comparing with combinatorial auction that searches optimal solution.