Heuristics for the response time variability problem
by Albert Corominas; Wieslaw Kubiak; Rafael Pastor
European J. of Industrial Engineering (EJIE), Vol. 6, No. 6, 2012

Abstract: The recently introduced response time variability problem (RTVP) is a scheduling problem that has a broad range of real-life applications, for example, to sequence the models to be produced on a mixed-model assembly line. Previous studies include heuristic algorithms and mathematical programming models, whose practical limit for obtaining optimal solutions is around 40 units to be scheduled. In this paper, we propose and test new algorithms that combine heuristic procedures for obtaining initial sequences and several local optimisation procedures. [Received 24 July 2009; Revised 11 June 2010; Revised 18 February 2011; Accepted 01 May 2011]

Online publication date: Wed, 10-Sep-2014

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