Header menu link for other important links
X
Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan
Published in
1992
Volume: 27
   
Issue: 2
Pages: 137 - 143
Abstract
The existing algorithms for optimizing the flowshop scheduling problem with the objective of minimizing makespan assume that every stage has a single processor. This paper relaxes this assumption and presents a branch-and-bound algorithms for scheduling in the flowshop with parallel processors. The computational experience on the working of the algorithm is also reported. © 1992.
About the journal
JournalInternational Journal of Production Economics
ISSN09255273
Open AccessNo
Concepts (13)
  •  related image
    Algorithms
  •  related image
    Computational methods
  •  related image
    Job analysis
  •  related image
    Operations research
  •  related image
    Optimization
  •  related image
    Parallel processing systems
  •  related image
    Branch-and-bound algorithms
  •  related image
    CONVERGENT FLOWSHOPS
  •  related image
    DIVERGENT FLOWSHOPS
  •  related image
    FLOWSHOP SCHEDULING PROBLEMS
  •  related image
    MAKESPAN MINIMIZATION
  •  related image
    OPTIMAL PERMUTATION SCHEDULING
  •  related image
    Scheduling