Order acceptance and scheduling in a two-machine flowshop

Xiuli Wang, Xingzi Xie, Edwin Tai Chiu Cheng

Research output: Journal article publicationJournal articleAcademic researchpeer-review

49 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)366-376
Number of pages11
JournalInternational Journal of Production Economics
Issue number1
Publication statusPublished - 1 Jan 2013


  • Order acceptance
  • Revenue
  • Scheduling
  • Two-machine flowshop

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Business, Management and Accounting(all)
  • Management Science and Operations Research
  • Economics and Econometrics


Dive into the research topics of 'Order acceptance and scheduling in a two-machine flowshop'. Together they form a unique fingerprint.

Cite this