2010•Unpublished venueRequires access

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

Tatsuya Omori, Toshiya Kaihara, Nobutada Fujii, Susumu Fujii, Masashi Kurahashi, Nobuhiro Hayashi, Shinya Inao

Open publisher page 1 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Combinatorial auction, Computer science, Auction algorithm, Scheduling (production processes), Mathematical optimization, Distributed computing, Auction theory, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Basic analysis on cell manufacturing scheduling method with combinatorial auction Integration of local search into auction mechanism — Research Paper | ScholarLens