Sequence Dependent Flow Shop Scheduling With Job Block Criteria
No Thumbnail Available
Date
2017
Journal Title
Journal ISSN
Volume Title
Publisher
Global Journal of Pure and Applied Mathematics. Volume 13, Number 5 (2017), pp. 1401-1414
Abstract
The majority of research on scheduling assumes setup times negligible or part
of the processing time. In this paper, a bicriteria scheduling with a sequence
dependent setup time (SDST) and job block criteria is considered. The
objective function of the problem is minimization of the total completion time
and the rental cost of machines taken on rent under a specified rental policy.
The processing time of attributes on these machines are associated with
probabilities. The scheduling problems considering either of these objectives
are NP-hard, so exact optimization techniques are impractical. A heuristic
algorithm to find optimal or near optimal sequence of jobs processing is
The performance of the proposed algorithm is justified by bi
objective in-out flow table of jobs.