A dual-criteria flow shop scheduling with sequence-dependent setup times

Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum to...

Full description

Saved in:
Bibliographic Details
Published inJournal of information & optimization sciences Vol. 36; no. 5; pp. 485 - 500
Main Authors Nailwal, Kewal Krishan, Gupta, Deepak, Sharma, Sameer
Format Journal Article
LanguageEnglish
Published Taylor & Francis 03.09.2015
Subjects
Online AccessGet full text
ISSN0252-2667
2169-0103
DOI10.1080/02522667.2015.1026460

Cover

More Information
Summary:Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm.
ISSN:0252-2667
2169-0103
DOI:10.1080/02522667.2015.1026460