A modified rapid access heuristic for flowshop scheduling problem
AbstractThis paper presents a modified rapid access (MRA) heuristic to solve the flowshop scheduling problems. This new heuristic follows the fundamental idea of the original rapid access approach by forming a two-machine subproblem, but the processing times are determined by using an exponential weighting modifier for the original linear weighting scheme without additional computational effort, then the subproblem is solved by using Johnson's two-machine algorithm. The performance of MRA is tested using instances from the literature and compared with the performance of the original rapid access (RA). Results show that the MRA outperforms the original RA in large size problems by using specific value of parameter alpha. Factorial experiment and response surface methodology are applied to determine the best alpha value which is the main factor that impacts the performance of MRA and produce the best performance of the MRA heuristic.
Download InfoIf 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.
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.
Bibliographic InfoArticle provided by Inderscience Enterprises Ltd in its journal Int. J. of Applied Management Science.
Volume (Year): 3 (2011)
Issue (Month): 4 ()
Contact details of provider:
Web page: http://www.inderscience.com/browse/index.php?journalID=286
flowshop scheduling; makespan; rapid access heuristics; response surface methodology; RSM.;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Graham Langley) or (Christopher F. Baum).
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 references are entirely missing, you can add them using this form.
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.