Exploració per tema "blocking flow shop"
Ara es mostren els items 1-4 de 4
-
A bounded dynamic programming algorithm for the blocking flow shop problem
(IEEE Computer Society Conference Publishing Services (CPS), 2011-04-11)
Capítol de llibre
Accés restringit per política de l'editorialWe present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best-known ... -
An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
(Taylor & Francis, 2013-04-27)
Article
Accés restringit per política de l'editorialThis paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimisation. The proposed ILS makes ... -
Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem
(2016-04-11)
Report de recerca
Accés obertThe distributed blocking flow shop scheduling problem (DBFSP) allows modeling the scheduling process in companies with more than one factory. It configures production systems as flow shop lines where the blocking constraint ... -
Efficient constructive procedures for the distributed blocking flowshop scheduling problem
(2015)
Text en actes de congrés
Accés obertthe distributed blocking flow shop scheduling problem (DBFSP) allows modeling of the scheduling process in companies with more than one factory, with productive systems configured as flow shop lines where the blocking ...