An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server

Contents:

We consider the two-machine no-wait flow shop problem with separable setup times and single server side constraints, and makespan as the performance measure. This problem is strongly NP-hard. A mathematical model of the problem is developed and a number of propositions are proven for the special cases. Furthermore, a hybrid algorithm of variable neighbourhood search (VNS) and Tabu search (TS) is proposed for the generic case. For evaluation, a number of test problems with small instances are generated and solved to optimality. Computational results show that the proposed algorithm is able to reproduce the optimal solutions of all of the small-instance test problems. For larger instances, proposed solutions are compared with the results of the famous two-opt algorithm as well as a lower bound that we develop in this paper. This comparison demonstrates the efficiency of the algorithm to find good-quality solutions. [Received 25 November 2009; Revised 26 February 2010; Revised 19 March 2010; Accepted 20 March 2010]

If you experience problems downloading a file, check if you have the
proper application to
view it first. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.

File URL: http://www.inderscience.com/link.php?id=39869Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

When requesting a correction, please mention this item's handle: RePEc:ids:eujine:v:5:y:2011:i:2:p:111-131. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Darren Simpson)

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through
the various RePEc services.