Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

A branch and bound method in a permutation flow shop with blocking and setup times

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • Additional Information
    • Publication Information:
      Growing Science, 2022.
    • Publication Date:
    • Collection:
      LCC:Industrial engineering. Management engineering
      LCC:Production management. Operations management
    • Abstract:
      In this paper it is presented an improvement of the branch and bound algorithm for the permutation flow shop problem with blocking-in-process and setup times with the objective of minimizing the total flow time and tardiness, which is known to be NP-Hard when there are two or more machines involved. With that objective in mind, a new machine-based lower bound that exploits some structural properties of the problem. A database with 27 classes of problems, varying in number of jobs (n) and number of machines (m) was used to perform the computational experiments. Results show that the algorithm can deal with most of the problems with less than 20 jobs in less than one hour. Thus, the method proposed in this work can solve the scheduling of many applications in manufacturing environments with limited buffers and separated setup times.
    • File Description:
      electronic resource
    • ISSN:
    • Relation:;;
    • Accession Number:
    • Accession Number: