@article{Duraj_Kopeć_Kubale_Pikies_2017, title={Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments}, volume={11}, url={https://journals.agh.edu.pl/dmms/article/view/2502}, DOI={10.7494/dmms.2017.11.1-2.53}, abstractNote={Abstract. In the paper we consider the problem of scheduling of unit-length jobs on 3 or 4 uniform parallel machines to minimize schedule length or total completion time. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a bipartite graph of bounded degree. The edges of the graph correspond to pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard, we show that under some conditions imposed on machine speeds and the structure of incompatibility graph our problem can be solved to optimality in polynomial time. Theoretical considerations are accompanied by computer experiments with some particular model of scheduling.<br /><br />}, number={1-2}, journal={Decision Making in Manufacturing and Services}, author={Duraj, Szymon and Kopeć, Paweł and Kubale, Marek and Pikies, Tytus}, year={2017}, month={Dec.}, pages={53–61} }