区間のk-彩色アルゴリズムの研究とスケジューリングへの応用

書誌事項

タイトル別名
  • A Study on Algorithms for the k-Coloring of Intervals and Their Applications to Scheduling

この論文をさがす

説明

In this study, we investigate algorithms for the k-coloring of intervals and the k-coloring problem for weighted intervals, and implement them on a PC. Furthermore, we focus on a just-in-time scheduling problem considering weights. Specifically, we explore cases that can be efficiently solved by utilizing the algorithms for the k-coloring of weighted intervals. Additionally, we propose a heuristic algorithm for the weighted just-in-time scheduling problem and implement this on a PC.

収録刊行物

詳細情報 詳細情報について

  • CRID
    1390300987841191424
  • DOI
    10.15002/00030789
  • HANDLE
    10114/00030789
  • ISSN
    24368083
  • 本文言語コード
    ja
  • 資料種別
    departmental bulletin paper
  • データソース種別
    • JaLC
    • IRDB
  • 抄録ライセンスフラグ
    使用可

問題の指摘

ページトップへ