A parallel neighborhood search for order acceptance and scheduling in flow shop environment

Deming Lei and Xiuping Guo

International Journal of Production Economics, 2015, vol. 165, issue C, 12-18

Abstract: We consider the order acceptance and scheduling problem in a flow shop where the objective is to simultaneously minimize makespan and maximize total net revenue. We formulate the problem as a mixed integer linear programming model and develop an effective parallel neighborhood search algorithm. Two-string representation and three neighborhood structures are applied to generate new solutions. Parallelization is implemented by applying two independent searches and directly exchanging information between them. We assess the performance of the proposed method via computational experiments using an extensive set of instances. The experimental results show that the proposed method is highly effective and competitive when compared to other algorithms.

Keywords: Parallel neighborhood search; Flow shop scheduling; Order acceptance; Multi-objective; Optimization (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S092552731500081X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:165:y:2015:i:c:p:12-18

DOI: 10.1016/j.ijpe.2015.03.013

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().