Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems

@article{Trabelsi2012HeuristicsAM,
  title={Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems},
  author={Wajdi Trabelsi and Christophe Sauvey and Nathalie Sauer},
  journal={Computers & OR},
  year={2012},
  volume={39},
  pages={2520-2527}
}
Storage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. The last two cases can lead to blocking situations. In flowshop scheduling literature, many studies have been performed about classical flowshop problems and also about some problems with only one blocking situation between all machines. This paper deals with makespan minimization in flowshop scheduling problems where mixed blocking constraints are considered. After a problem… CONTINUE READING
1
Twitter Mention