Proceedings of International Conference on Leading Edge Manufacturing in 21st century : LEM21
Online ISSN : 2424-3086
ISSN-L : 2424-3086
セッションID: D027
会議情報
D027 Job Shop Scheduling with Capacity Adjustment : An efficient search method using the mixture of GA and priority rule and its performance evaluation using Lagrangian relaxation method
Toru EGUCHIMitsunobu YODAYusuke YAMAMOTOTakeshi MURAYAMA
著者情報
会議録・要旨集 フリー

詳細
抄録
This paper deals with job shop scheduling problems in which overtime can be adjustable to meet due dates. The primal objective of scheduling is to meet due dates and the secondary one is to minimize overtime. For this purpose, we propose the scheduling method using the mixture of genetic algorithm and priority rule. Numerical experiments show that the proposed method can generate optimal or sub-optimal solutions when the scale of problem is small or time resolution is low. When the size of the problems is large and time resolution is high, although it becomes difficult to obtain optimal solutions, the performance of the proposed method is much better than other methods.
著者関連情報
© 2013 一般社団法人 日本機械学会
前の記事 次の記事
feedback
Top