Three stage constrained flow shop scheduling with jobs in a string of disjoint job-block

Author

Sharma, Sameer ; Gupta, Deepak ; Aggarwal, Shefali

Author_Institution

Dept. of Math., Maharishi Markandeshwar Univ., Ambala, India

fYear

2012

fDate

16-18 March 2012

Firstpage

1

Lastpage

6

Abstract

The objective of this paper is to develop a heuristic algorithm to minimize the total elapsed time for n jobs, 3 machine flow shop production scheduling in which processing times and independent set up times, each associated with probabilities including transportation time and breakdown interval. Further the jobs are processed in a string of disjoint job blocks. A computer programme followed by a numerical illustration is given to substantiate the algorithm.

Keywords

flow shop scheduling; numerical analysis; 3 machine flow shop production scheduling; breakdown interval; computer programme; disjoint job blocks; heuristic algorithm; independent set up times; jobs; numerical illustration; processing times; three stage constrained flow shop scheduling; transportation time; Current; Electric breakdown; Job shop scheduling; Probability; Processor scheduling; Transportation; Breakdown Interval; Disjoint Job-block; Flowshop Scheduling; Processing Time; Setup Time; Transportation Time;

fLanguage

English

Publisher

ieee

Conference_Titel

Engineering and Systems (SCES), 2012 Students Conference on

Conference_Location

Allahabad, Uttar Pradesh

Print_ISBN

978-1-4673-0456-6

Type

conf

DOI

10.1109/SCES.2012.6199094

Filename

6199094