A modified rapid access heuristic for flowshop scheduling problem
This 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.
Volume (Year): 3 (2011)
Issue (Month): 4 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=286|
When requesting a correction, please mention this item's handle: RePEc:ids:injams:v:3:y:2011:i:4:p:327-340. 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 references are entirely missing, you can add them using this form.