Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of DSpace
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Sameer Sharma"

Now showing 1 - 2 of 2
Results Per Page
Sort Options
  • 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.

DSpace software copyright © 2002-2026 LYRASIS

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback