Abstract

Branch and bound technique to two stage flow shop scheduling problem in which setup time is separated from processing time and both are associated with probabilities including job block criteria

This paper presents an algorithm with the help of branch and bound approach for a flowshop scheduling problems consisting of n jobs to be processed on 2 machines in which setup time is separated from processing time and both are associated with probabilities including job block criteria.


Author(s): Deepak Gupta and Harminder Singh

Abstract | PDF

Share this  Facebook  Twitter  LinkedIn  Google+
Flyer image

Abstracted/Indexed in

  • Chemical Abstracts Service (CAS)
  • Index Copernicus
  • Google Scholar
  • Genamics JournalSeek
  • CiteFactor
  • Electronic Journals Library
  • Directory of Research Journal Indexing (DRJI)
  • WorldCat
  • Proquest Summons
  • Publons
  • Serials Union Catalogue (SUNCAT)
  • Geneva Foundation for Medical Education and Research
  • Secret Search Engine Labs