|
|||||
|
|
A local search using solution fragments for the 2-machine bicriteria scheduling problem |
|
| Authors: | Gaofeng Huang Andrew Lim Brian Rodrigues |
| Institution: | (1) Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Clearwater Bay, Hong Kong, Hong Kong;(2) Lee Kong Chian School of Business, Singapore Management University, 50 Stamford Road, Singapore, 178899, Singapore |
| Abstract: | 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-known
-hard 2-machine bicriteria flowshop scheduling problem. Computational experiments using benchmark data show the approach to
be effective when compared to other algorithms available for the problem. |
| Keywords: | Local search Bicriteria flowshop scheduling |
| 本文献已被 SpringerLink 等数据库收录！ | |