|
|||||
|
|
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs |
|
| Authors: | Kangbok Lee Joseph Y-T Leung Zhao-hong Jia Wenhua Li Michael L Pinedo Bertrand MT Lin |
| Institution: | 1. Department of Business & Economics, York College, The City University of New York, 94-20 Guy R. Brewer Blvd, Jamaica, NY 11451, USA;2. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA;3. Key Lab of Intelligent Computing & Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui 230039, PR China;4. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, PR China;5. Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012-1126, USA;6. Department of Information & Finance Management, National Chiao Tung University, Taiwan |
| Abstract: | 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. |
| Keywords: | Bi-criteria scheduling Maximum machine cost Total machine cost Makespan Total completion time Heuristics |
| 本文献已被 ScienceDirect 等数据库收录！ | |