Scholars Central

Research articlePublished Jun 2013

Optimal Two Stage Flow Shop Scheduling Problem with Branch and Bound Method Including Transportation Time

Authors: Deepak Gupta Payal Singla Shashi Bala

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

This paper studies two stage flow shop scheduling problem in which processing times are associated with their respective probabilities and transportation times from one machine to another are given. The objective of the study is to get optimal sequence of jobs in order to minimize the total elapsed time. The given problem is solved with branch and bound method. The method is illustrated by numerical example.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

More from this journal

The newest in International Journal of Innovative Research in Computer and Communication Engineering.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalInternational Journal of Innovative Research in Computer and Communication Engineering
  • SubjectComputer Science & IT
  • SubjectEngineering
  • SubjectSocial Sciences & Humanities
  • BylineArticles whose byline prints “Deepak Gupta Payal Singla Shashi Bala”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels