An Algorithm for Single Machine Scheduling to Minimize Total Holding Cost with Ready Times and Due Dates Constraints

DOI Web Site 9 References

Bibliographic Information

Other Title
  • 着手可能時刻と納期に制約のある単一機械スケジューリングにおける総在庫コスト最小化問題の解法
  • チャクシュ カノウ ジコク ト ノウキ ニ セイヤク ノ アル タンイツ キカイ スケジューリング ニ オケル ソウ ザイコ コスト サイショウカ モンダイ ノ カイホウ

Search this article

Abstract

This paper considers single-machine scheduling to minimize the total weighted earliness representing the total holding cost subject to ready times and due dates constraints, and proposes an optimization algorithm based on the branch-and-bound method. Every job is available for processing only when all preceding job operations have been finished and the shop can accept delivery of materials and parts. Every job must be completed before or just on its due date and no tardy jobs are allowed. If a job is completed earlier than its due date, then the shop holds the job and incurs the holding cost for earliness. In the scheduling problem, it is not easy even to obtain a feasible schedule, and both job sequence and completion times for all jobs must be determined since machine idle times may be inserted in the optimum schedule. In the proposed algorithm, the successor nodes of the search tree are generated according to a schedule based on the Backward-WSPT rule, and the number of assigned jobs is adjusted at each node. Computational results indicate that the proposed algorithm can obtain a better sub-optimum solution if the search is closed by limits during the calculation.

Journal

References(9)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top