A Heuristic Approach to n×m Flow Shop Scheduling Problem in Which Processing Times Are Associated with Their Respective Probabilities with No-Idle Constraint. (11th September 2013)

• Record Type: Journal Article
• Authors: Gupta, Deepak; Singh, Harminder
• Other Names: Ekel P. Academic Editor.; Yuan X.-M. Academic Editor.
• Is Part Of: ISRN operations research. Volume 2013(2013)
• Publication Date: 2013-09-11
• Subjects: Operations research -- Periodicals; Operations research; Electronic journals; Periodicals; 003
• DOI: 10.1155/2013/948541
• Languages: English
• ISSNs: 2314-6397

Abstract

Abstract : This paper is an attempt to study generaln × m 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 ton × m 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.