Volume 55, 2021Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|Page(s)||S1747 - S1765|
|Published online||02 March 2021|
Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes
TBS Business School, 20 BD Lascrosses BP 7010, 31068 Toulouse Cedex 7, France
2 Department of Mathematics and Computer Science, TU Eindhoven, 5600 MB Eindhoven, The Netherlands
3 Université de Tours, Laboratoire d’Informatique Fondamentale et Appliquée (EA 6300), ERL CNRS 7002 ROOT, 64 Avenue Jean Portalis, 37200 Tours, France
* Corresponding author: email@example.com
Accepted: 18 March 2020
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.
Mathematics Subject Classification: 90B35
Key words: Unrelated machine scheduling / time-indexed formulation / valid inequalities / cutting plane algorithm / variable fixing
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.