Related machine scheduling with machine speeds satisfying linear constraints

Siyun Zhang, Kameng Nip and Zhenbo Wang ()
Additional contact information
Siyun Zhang: Tsinghua University
Kameng Nip: Sun Yat-sen University
Zhenbo Wang: Tsinghua University

Journal of Combinatorial Optimization, No 0, 17 pages

Abstract: Abstract We propose a related machine scheduling problem in which the processing times of jobs are given and known, but the speeds of machines are variables and must satisfy a system of linear constraints. The objective is to decide the speeds of machines and minimize the makespan of the schedule among all the feasible choices. The problem is motivated by some practical application scenarios. This problem is strongly NP-hard in general, and we discuss various cases of it. In particular, we obtain polynomial time algorithms for two special cases. If the number of constraints is more than one and the number of machines is a fixed constant, then we give a $$(2+\epsilon )$$(2+ϵ)-approximation algorithm. For the case where the number of machines is an input of the problem instance, we propose several approximation algorithms, and obtain a polynomial time approximation scheme when the number of distinct machine speeds is a fixed constant.

Keywords: Related machine scheduling; Linear programming; Approximation algorithm; Scheduling under linear constaints (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00523-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00523-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00523-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().