Skip to main content
padlock icon - secure page this page is secure

A branch-and-bound algorithm for minimising the number of tardy jobs in a two-machine flow-shop problem with release dates

Buy Article:

$61.00 + tax (Refund Policy)

This article considers the two-machine flow-shop scheduling problem with the objective of minimising the number of tardy jobs in which jobs have release dates. Since the problem under consideration is an NP-hard problem, a branch-and-bound (B&B) algorithm is viable to solve the problem exactly. A heuristic algorithm as an upper bound, some lower bounds and several efficient dominance properties are used to speed up the elimination process of the B&B algorithm. For the evaluation of the performance of the proposed algorithm, computational experiments are performed on test problems and results are displayed. The experimental results show that the proposed B&B algorithm can solve problems with up to 28 jobs in timely manner, and the average percentage gap of the heuristic solutions is about 10%.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: branch-and-bound; flow shop; number of tardy jobs; release dates; scheduling

Document Type: Research Article

Affiliations: Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran

Publication date: June 3, 2014

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more