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

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...

Full description

Saved in:

Bibliographic Details
Main Authors:	HUANG, Gaofeng, LIM, Andrew, RODRIGUES, Brian
Format:	text
Language:	English
Published:	Institutional Knowledge at Singapore Management University 2007
Subjects:	Local search Bicriteria flowshop scheduling Operations and Supply Chain Management
Online Access:	https://ink.library.smu.edu.sg/lkcsb_research/608 https://doi.org/10.1007/s10589-007-9018-z
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Singapore Management University
Language:	English

id	sg-smu-ink.lkcsb_research-1607
record_format	dspace
spelling	sg-smu-ink.lkcsb_research-16072016-03-11T15:33:15Z A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem HUANG, Gaofeng LIM, Andrew RODRIGUES, Brian 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 benchmark data show the approach to be effective when compared to other algorithms available for the problem. 2007-06-01T07:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/608 info:doi/10.1007/s10589-007-9018-z https://doi.org/10.1007/s10589-007-9018-z Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Local search Bicriteria flowshop scheduling Operations and Supply Chain Management
institution	Singapore Management University
building	SMU Libraries
continent	Asia
country	Singapore Singapore
content_provider	SMU Libraries
collection	InK@SMU
language	English
topic	Local search Bicriteria flowshop scheduling Operations and Supply Chain Management
spellingShingle	Local search Bicriteria flowshop scheduling Operations and Supply Chain Management HUANG, Gaofeng LIM, Andrew RODRIGUES, Brian A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem
description	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 benchmark data show the approach to be effective when compared to other algorithms available for the problem.
format	text
author	HUANG, Gaofeng LIM, Andrew RODRIGUES, Brian
author_facet	HUANG, Gaofeng LIM, Andrew RODRIGUES, Brian
author_sort	HUANG, Gaofeng
title	A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem
title_short	A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem
title_full	A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem
title_fullStr	A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem
title_full_unstemmed	A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem
title_sort	local search using solution fragments for the 2-machine bi-criteria scheduling problem
publisher	Institutional Knowledge at Singapore Management University
publishDate	2007
url	https://ink.library.smu.edu.sg/lkcsb_research/608 https://doi.org/10.1007/s10589-007-9018-z
_version_	1770569625218580480

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

Similar Items