- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
-
- Kise Hiroshi
- Department of Mechanical Engineering, Faculty of Engineering, Kyoto Institute of Technology
-
- Ibaraki Toshihide
- Kyoto University
-
- Mine Hisashi
- Kyoto University
Bibliographic Information
- Other Title
-
- 最大納期遅れを最小にする1機械処理順序問題に対する6種の近似解法の評価 : 準備時間のある場合
Search this article
Description
Six approximation algorithms for the one-machine scheduling problem with ready and due times to minimize the maximum lateness are analyzed. The performance is measured by the relative deviation of approximate values to optimal ones. Best possible upper bounds on the worst case performance of all six algorithms are derived. The average performance is also examined by solving randomly generated problems; one of the six algorithms outperforms others and keeps the average relative deviation within 2%.
Journal
-
- Journal of the Operations Research Society of Japan
-
Journal of the Operations Research Society of Japan 22 (3), 205-224, 1979
The Operations Research Society of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1390282679085411968
-
- NII Article ID
- 110001184034
-
- ISSN
- 21888299
- 04534514
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- Crossref
- CiNii Articles
- OpenAIRE
-
- Abstract License Flag
- Disallowed