Search
Now showing items 1-2 of 2
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
(Elsevier, 2011-03)
This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective ...
Discrepancy search for the flexible job shop scheduling problem
(Elsevier, 2010-12)
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim ...
Share this page