K2 DOMINANCE ORDERS FOR SCHEDULING PROBLEMS(Keynote speech)

スポンサーリンク

概要

• 論文の詳細を見る

• A partial order on the set of jobs in a scheduling problem is a dominance order if there is an optimal sequence for the jobs which is consistent with the order. We consider a technique, called subset-restricted pairwise interchange, which can be used to interchange pairs of jobs around subsets of jobs satisfying certain conditions, without increasing the cost of the schedule. We use a new interchange operator, we call Shuffle Interchange (SI), which generalizes well-known interchange operators used in scheduling theory. Using SI, we derive dominance orders for various one- and two-machine scheduling problems and give a unified treatment of all these dominance orders. These orders allow us to reduce the search space for solution algorithms, and result in substantial reductions in running time.

• 一般社団法人日本機械学会の論文
• 2004-05-24

著者

• Stephenson Paul

  Acadia University

• Steiner George

  McMaster University

関連論文

• K2 DOMINANCE ORDERS FOR SCHEDULING PROBLEMS(Keynote speech)
• BATCH SCHEDULING IN CUSTOMER-CENTRIC SUPPLY CHAINS(Advanced Planning and Scheduling for Supply Chain Management)
• Dominance Orders for Scheduling Problems(KEYNOTE SPEECHES)

スポンサーリンク