Table of Contents
ISRN Operations Research
Volume 2013, Article ID 948541, 9 pages
Research Article

A Heuristic Approach to Flow Shop Scheduling Problem in Which Processing Times Are Associated with Their Respective Probabilities with No-Idle Constraint

Department of Mathematics, Maharishi Markandeshwar University, Mullana, Ambala, Haryana 133-207, India

Received 20 June 2013; Accepted 30 July 2013

Academic Editors: P. Ekel and X.-M. Yuan

Copyright © 2013 Deepak Gupta and Harminder Singh. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper is an attempt to study general flow shop scheduling problem in which processing time of jobs is associated with probabilities under no-idle constraint. The objective of this paper is to develop a heuristic algorithm to flowshop scheduling so that no machine remains idle during working for any given sequence of jobs. The proposed algorithm is simple, and easy to understand and provides an important tool in many practical situations for minimizing the expected hiring cost of the machines for a fixed sequence of job processing. A numerical illustration is also given to justify the proposed algorithm.