A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem

• المؤلفون الرئيسيون: HUANG, Gaofeng, LIM, Andrew, RODRIGUES, Brian
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2007
• الموضوعات: Local search; Bicriteria flowshop scheduling; Operations and Supply Chain Management
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/608; https://doi.org/10.1007/s10589-007-9018-z

In this work, we introduce a local search strategy for combinatorial optimization problems which explores neighborhoods obtained using fragments of current solutions.We apply the approach to the well-knownNP-hard 2-machine bicriteria flowshop scheduling problem. Computational experiments using bench...