Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12446
Title: Order acceptance and scheduling in a two-machine flowshop
Authors: Wang, X
Xie, X
Cheng, TCE 
Keywords: Order acceptance
Revenue
Scheduling
Two-machine flowshop
Issue Date: 2013
Publisher: Elsevier
Source: International journal of production economics, 2013, v. 141, no. 1, p. 366-376 How to cite?
Journal: International journal of production economics 
Abstract: We study the order acceptance and scheduling problem in a two-machine flowshop. The firm receives a pool of orders before a planning period, each of which is characterized by revenue, processing times on machines 1 and 2, a due date, and a tardiness penalty. The firm seeks to decide on the orders to accept and schedule the accepted orders so as to maximize the total net revenue. We formulate the problem as mixed-integer linear programming models, and develop a heuristic and a branch-and-bound (B&B) algorithm based on some derived dominance rules and relaxation techniques. We assess the performance of the B&B algorithm and the heuristic via computational experiments. The computational results show that the B&B algorithm can solve problem instances with up to 20 jobs within a reasonable time while the heuristic is efficient in approximately solving large instances of the problem.
URI: http://hdl.handle.net/10397/12446
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2012.08.020
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

20
Last Week
0
Last month
0
Citations as of Sep 11, 2017

WEB OF SCIENCETM
Citations

21
Last Week
0
Last month
0
Citations as of Sep 21, 2017

Page view(s)

48
Last Week
1
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.