Indian Journal of Science and Technology

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


The flowshop scheduling problem has been one of the most attractive research issues. Deterministic flowshop problem is widely studied; whereas it is uncertain processing times has remained a challenge. In this paper, a robust heuristic method for this problem is presented, which is applicable whenever the lower and upper bounds of each job are available. The proposed method is capable of handling the perturbation which exists amongst the processing times. Therefore, the proposed robust method could guarantee that a small deviation of the processing times does not affect the feasibility. The performance of the proposed method is explored using some numerical examples.

Keywords

Flowshop Scheduling, Online Flowshop, Online Scheduling, Preemptive Flowshop, Robust Optimization, Uncertain Processing Times
User