Fast approximation algorithms for bi-criteria scheduling with machine assignment costs

檔案

日期

2014-10-01

類型

期刊名稱

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

卷期與頁次

第 238 卷第 1 期,頁 54–64

ISSN

0377-2217

語言

英文

摘要

We consider parallel machine scheduling problems where the processing of the jobs on the machines involves two types of objectives. The first type is one of two classical objective functions in scheduling theory: either the total completion time or the makespan. The second type involves an actual cost associated with the processing of a specific job on a given machine: each job-machine combination may have a different cost. Two bi-criteria scheduling problems are considered: (1) minimize the maximum machine cost subject to the total completion time being at its minimum, and (2) minimize the total machine cost subject to the makespan being at its minimum. Since both problems are strongly NP-hard, we propose fast heuristics and establish their worst-case performance bounds. (C) 2014 Elsevier B.V. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Lee, K., Leung, J. Y.-T., Jia, Z.-H., Li, W., Pinedo, M. L., & Lin, B. M. T. (2014). Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 238(1), 54–64. https://doi.org/10.1016/j.ejor.2014.03.026

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/24600