Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem

This paper introduces a new flow shop combinatorial optimization problem, called the blocking hybrid flow shop group scheduling problem (BHFGSP). In the problem, no buffers exist between any adjacent machines, and a set of jobs with different sequence-dependent setup times needs to be scheduled and...

Celý popis

Podrobná bibliografia

Vydané v:	Knowledge-based systems Ročník 258; s. 109962
Hlavní autori:	Qin, Haoxiang, Han, Yuyan, Wang, Yuting, Liu, Yiping, Li, Junqing, Pan, Quanke
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 22.12.2022
Predmet:	Blocking Hybrid flow shop group scheduling problem Iterated greedy algorithm Makespan Neighborhood probabilistic selection strategies Blocking Iterated greedy algorithm Makespan Hybrid flow shop group scheduling problem Neighborhood probabilistic selection strategies
ISSN:	0950-7051, 1872-7409
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!