A branch and bound algorithm for solving large-scale single-machine scheduling problems with non-identical release dates
by Seyed Hessameddin Zegordi; Mohammad Yavari
European J. of Industrial Engineering (EJIE), Vol. 12, No. 1, 2018

Abstract: In this paper, we have examined minimising the total completion times in a single-machine scheduling problem with non-identical job release dates. This problem is known to be strongly NP-hard. We have proposed an effective lower bound-based. Also, a near optimal heuristic has been presented that has an average gap of less than 0.077% from the optimum solution. Additionally, in 18% of the problem instances with up to 60 jobs, the upper bound value is equal to the lower bound value. Then we provide two dominance properties. Subsequently, the proposed lower bound, upper bound and dominance properties have been applied in the branch and bound method and have been tested in a wide range of instances. Computational experiments demonstrate the ability of the proposed method to solve hard and large-size problems with up to 130 jobs within a reasonable time. [Received 19 June 2015; Revised 26 November 2016; Revised 24 January 2017; Accepted 5 September 2017]

Online publication date: Wed, 14-Feb-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com