TY - JOUR
T1 - A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines
AU - Ng, Chi To
AU - Cheng, Tai Chiu Edwin
AU - Bandalouski, Andrei M.
AU - Kovalyov, Mikhail Y.
AU - Lam, Sze Sing
N1 - Funding Information:
Acknowledgements—This research was supported in part by The Hong Kong Polytechnic University under grant number G-YL36. Research of M. Y. Kovalyov was also conducted within the project number Φ10ΦΠ − 001 of the Belarusian Republican Foundation for Fundamental Research.
PY - 2014/10
Y1 - 2014/10
N2 - We study the problem of scheduling n non-preemptive jobs on m unrelated parallel machines. Each machine can process a specified subset of the jobs. If a job is assigned to a machine, then it occupies a specified time interval on the machine. Each assignment of a job to a machine yields a value. The objective is to find a subset of the jobs and their feasible assignments to the machines such that the total value is maximized. The problem is NP-hard in the strong sense. We reduce the problem to finding a maximum weight clique in a graph and survey available solution methods. Furthermore, based on the peculiar properties of graphs, we propose an exact solution algorithm and five heuristics. We conduct computer experiments to assess the performance of our and other existing heuristics. The computational results show that our heuristics outperform the existing heuristics.
AB - We study the problem of scheduling n non-preemptive jobs on m unrelated parallel machines. Each machine can process a specified subset of the jobs. If a job is assigned to a machine, then it occupies a specified time interval on the machine. Each assignment of a job to a machine yields a value. The objective is to find a subset of the jobs and their feasible assignments to the machines such that the total value is maximized. The problem is NP-hard in the strong sense. We reduce the problem to finding a maximum weight clique in a graph and survey available solution methods. Furthermore, based on the peculiar properties of graphs, we propose an exact solution algorithm and five heuristics. We conduct computer experiments to assess the performance of our and other existing heuristics. The computational results show that our heuristics outperform the existing heuristics.
KW - cargo loading/unloading
KW - fixed interval scheduling
KW - interval graph
KW - maximum weight clique
UR - https://www.scopus.com/pages/publications/84906856037
U2 - 10.1057/jors.2013.109
DO - 10.1057/jors.2013.109
M3 - Article
AN - SCOPUS:84906856037
SN - 0160-5682
VL - 65
SP - 1571
EP - 1579
JO - Journal of the Operational Research Society
JF - Journal of the Operational Research Society
IS - 10
ER -