Table of Contents
ISRN Operations Research
Volume 2013, Article ID 948541, 9 pages
http://dx.doi.org/10.1155/2013/948541
Research Article

A Heuristic Approach to Flow Shop Scheduling Problem in Which Processing Times Are Associated with Their Respective Probabilities with No-Idle Constraint

Department of Mathematics, Maharishi Markandeshwar University, Mullana, Ambala, Haryana 133-207, India

Received 20 June 2013; Accepted 30 July 2013

Academic Editors: P. Ekel and X.-M. Yuan

Copyright © 2013 Deepak Gupta and Harminder Singh. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. M. Johnson, “Optimal two and three stage production schedule with setup times included,” Naval Research Logistics Quarterly, vol. 1, pp. 61–68, 1954. View at Google Scholar
  2. E. Ignall and L. Scharge, “Application of branch and bound technique to some flow shop scheduling problems,” Operation Research, vol. 13, pp. 400–412, 1965. View at Google Scholar
  3. I. Adiri and D. Pohoryles, “Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times,” Naval Research Logistics Quarterly, vol. 29, no. 3, pp. 495–504, 1982. View at Publisher · View at Google Scholar
  4. C. Rajendran and D. Chaudhuri, “An efficient heuristic approach to the scheduling of jobs in a flowshop,” European Journal of Operational Research, vol. 61, no. 3, pp. 318–325, 1992. View at Publisher · View at Google Scholar · View at Scopus
  5. W. Szwarc, “Special cases of the flow-shop problem,” Naval Research Logistics Quarterly, vol. 24, no. 3, pp. 483–492, 1977. View at Publisher · View at Google Scholar · View at Scopus
  6. T. Yoshida and K. Hitomi, “Optimal two-stage production scheduling with setup times separated,” AIIE Transactions, vol. 11, no. 3, pp. 261–263, 1979. View at Google Scholar · View at Scopus
  7. Anup, “On two machine flow shop problem in which processing time assume probabilities and there exists equivalent for an ordered job bloc,” Journal of the Indian Society of Statistics and Operations Resear, vol. 23, pp. 41–44, 2002. View at Google Scholar
  8. T. P. Singh, K. Rajindra, and G. Deepak, “Optimal three stage production schedule the processing time and set up times associated with probabilities including job block criteria,” in Proceedings of National Conference FACM, pp. 463–470, 2005.
  9. D. Gupta, T. P. Singh, and R. Kumar, “Minimizing rental cost in two stage flow shop, the processing time associated with probabilities including job block,” Reflections de ERA, vol. 1, no. 2, pp. 107–120, 2006. View at Google Scholar
  10. D. Gupta and H. Singh, “The idle/waiting time operator with applications to multistage flow shop scheduling to minimize the rental cost under specified rental policy where processing times are associated with probabilities including transportation time,” Industrial Engineering Letters, vol. 2, no. 3, pp. 61–70, 2012. View at Google Scholar
  11. L. Narain and P. C. Bagga, “Minimizing total elapsed time subject to zero total idle time of machines in n × 3 flowshop problem,” Indian Journal of Pure and Applied Mathematics, vol. 34, no. 2, pp. 219–228, 2003. View at Google Scholar · View at Scopus
  12. L. Narain and P. C. Bagga, “Flowshop/no-idle scheduling to minimise the mean flowtime,” ANZIAM Journal, vol. 47, no. 2, pp. 265–275, 2005. View at Publisher · View at Google Scholar · View at Scopus
  13. L. Narian and P. C. Bagga, “Scheduling problems in rental situation,” Bulletin of Pure and Applied Sciences: Section E, vol. 24, 2005. View at Google Scholar