Rate the Article: Scheduling Model for Special Class of Flow Shop Problem, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 131 | Views: 435 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1

Research Paper | Mathematics | India | Volume 4 Issue 8, August 2015 | Rating: 6.6 / 10


Scheduling Model for Special Class of Flow Shop Problem

Praveen Kumar


Abstract: The present paper is explored to deal with multi-criteria in scheduling for a special class of job shop problem. We have considered a (n, k) job shop problem in which we have m-parallel service platforms to serve same type of job with different potential and rest others are available to provide particular job services. Our objective is to find out the optimum processing cost, completion time & schedule.


Keywords: cut, Fuzzy Ranking, LPP, LR-type fuzzy number, CDS Algorithm


Edition: Volume 4 Issue 8, August 2015,


Pages: 294 - 300



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top