標題: Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
作者: Lee, Kangbok
Leung, Joseph Y-T.
Jia, Zhao-hong
Li, Wenhua
Pinedo, Michael L.
Lin, Bertrand M. T.
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
關鍵字: Bi-criteria scheduling;Maximum machine cost;Total machine cost;Makespan;Total completion time;Heuristics
公開日期: 1-十月-2014
摘要: 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.
URI: http://dx.doi.org/10.1016/j.ejor.2014.03.026
http://hdl.handle.net/11536/24600
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.03.026
期刊: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume: 238
Issue: 1
起始頁: 54
結束頁: 64
顯示於類別:期刊論文


文件中的檔案:

  1. 000337261600005.pdf