A Proposal of Optimisation Method Based on Combinatorial Auction for Production Scheduling Problem(Machine Elements and Manufacturing)

Bibliographic Information

Other Title
  • 生産スケジューリング問題に対する組合せオークションを用いた最適化手法に関する一提案(機械要素,潤滑,工作,生産管理など)
  • 生産スケジューリング問題に対する組合せオークションを用いた最適化手法に関する一提案
  • セイサン スケジューリング モンダイ ニ タイスル クミアワセ オークション オ モチイタ サイテキカ シュホウ ニ カンスル イチ テイアン

Search this article

Abstract

Recently, production scheduling becomes increasingly important in order to satisfy diversifying needs of consumers and reduce unnecessary costs because of the intensified competition between enterprises. As production system becames large-scale and complex, it is difficult to manage systems intensively. So autonomous distributed scheduling is required. In conventional researches, auction based scheduling, that is one of the autonomous distributed scheduling, has been proposed and recognised that it allows quick decision-making and can respond dynamic environmental variation flexibly, but has a defect that the optimality is not ensured. On the other hand, recently combinatorial auction method attracts attention. Combinatorial auction, that is an auction where bidders can bid on combinations of items, can effectively allocate multiple items. In this study, we propose an optimization method based on combinatorial auction for production scheduling problems. Due to using combinatorial auction, we can expect to realise a scheduling approach considering both autonomous distributed property and optimality at the same time. We formulate two combinatorial auction models such as model 1 and model 2. Machines bid for combination of jobs in the model 1, and jobs bid for combination of machine's timeslots in the model 2. We analyse the characteristics of the proposed method with simple scheduling problems as a basic study in this paper.

Journal

Citations (5)*help

See more

References(11)*help

See more

Details 詳細情報について

Report a problem

Back to top