Research Articles

Permanent URI for this collection

http://davjalandhar.ndl.gov.in/handle/123456789/178

Browse

Browsing Research Articles by Author "Deepak Gupta"

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    Heuristic Approach for n-Jobs, 3-Machines Flow Shop Scheduling Problem, Processing Time Associated With Probabilities Involving Transportation Time, Break-Down Interval, Weightage of Jobs and Job Block Criteria
    (Mathematical Theory and Modeling Vol.1, No.1, 2011, 2011) Deepak Gupta; Samir Sharma; Seema Sharma
    This paper deals with a new simple heuristic algorithm for n jobs, 3 machines flow shop scheduling problem in which processing times are associated with their corresponding probabilities involving transportation time, break down interval and job block criteria. Further jobs are attached with weights to indicate their relative importance. A heuristic approach method to find optimal or near optimal sequence minimizing the total elapsed time whenever mean weighted production flow time is taken into consideration. The proposed method is very easy to understand and also provide an important tool for decision makers. A numerical illustration is also given to clarify the algorithm
  • No Thumbnail Available
    Item
    On Linkage of Parallel Biserial Servers Linked with a Common Server to a Three Stage Flowshop Scheduling Model
    (International Journal of Applied Physics and Mathematics, Vol. 2, No. 3,, 2012) Deepak Gupta; Sameer Sharma; Seema Sharma
    The present paper deals with the linkage between a queue network in which a common service server is linked in series with each of two parallel biserial servers and a three stage flowshop scheduling system. The objective of this paper is of two folds, on one hand it finds mean queue length and the total waiting time of jobs and on other hand it minimizes the total elapsed time. The proposed model provides an important tool for manufacturing concern, office management, banking service system, computer networks and in administrative setup etc.
  • No Thumbnail Available
    Item
    Sequence Dependent Flow Shop Scheduling With Job Block Criteria
    (Global Journal of Pure and Applied Mathematics. Volume 13, Number 5 (2017), pp. 1401-1414, 2017) Sameer Sharma; Deepak Gupta; Seema; Kewal Krishan Nailwal
    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.