4th International Virtual Congress (IVC-2017).  International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

Job sequencing problem using deviation technique

Author Affiliations

  • 1Department of Mathematics, Abasaheb Garware College, Pune-411004, MS, India

Res. J. Mathematical & Statistical Sci., Volume 5, Issue (5), Pages 9-13, May,12 (2017)

Abstract

The job sequencing technique is used to find the sequence of jobs which minimizes total time required to process the jobs on various machines. In this paper we have proposed Deviation Technique to solve job sequencing problem. We have given examples to illustrate the use of method for sequencing of n jobs on two machines, sequencing of n jobs on three machines and sequencing of n jobs on m machines.

References

  1. Laha Dipak and Chakraborty Uday Kumar (2009)., An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling., Int. J. Adv Manuf Technol, 44(5-6), 559-569. DOI 10.1007/s00170-008-1845-2, Springer-Verlag London Limited 2008.
  2. Kumar Sandeep and Jadon Pooja (2014)., A Novel Hybrid Algorithm for Permutation Flow Shop Scheduling., Int. J. of Comp. Sci. and Info. Tech. (IJCSIT), 5(4), 5057-5061.
  3. Singh Kumar Punit and Kumar R. (2012)., Path Optimization Algorithm for Network Problems using Job Sequencing Technique., Int. J. of Dist. and Para. Sys (IJDPS), 3(3), 301-309.
  4. Gupta Srikant, Ali Irfan and Ahmed A. (2016)., A New Algorithm for Solving Job Shop Sequencing Problem., Int. J. of Comp. Sci. Engg.(IJCSE), 5(2), 93-100.
  5. Iqbal Pervaiz, Sheik Dr. P.S. Uduman and Srinivasan Dr. S. (2013)., Job Sequencing Problem Using Advanced Heuristics Techniques., Proceedings of Int. Conference on Applied Mathematics and Theoretical Computer Science-2013, ISBN 978-93-82338-35-2
  6. Iyer P. Sankara (2008)., Operations Research., Tata McGraw-Hill Publishing Company Limited, India, 194-201, ISBN (13): 978-0-07-066902-4, ISBN (10): 0-07-066902-3.