Author:
Berghman Lotte,Spieksma Frits C.R.,T’kindt Vincent
Abstract
We consider a time-indexed formulation for the unrelated parallel machine scheduling problem. We show that all polyhedral knowledge known from the single machine problem (in particular, valid inequalities) is applicable to this formulation. We present new facet-inducing valid inequalities and a preprocessing technique involving fixing variables based on reduced costs. We combine both techniques in a basic cutting-plane algorithm and test the performance of the resulting algorithm by running it on randomly generated instances.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Solution Methods for Supply Chain Scheduling Problems;International Series in Operations Research & Management Science;2021-10-20