Search
Now showing items 1-6 of 6
Bounding strategies for the hybrid flow shop scheduling problem
(Elsevier, 2011-07-01)
In this paper, we investigate new lower and upper bounds for the multiple-center hybrid flow shop scheduling problem. We propose a family of center-based lower bounds as well as a destructive lower bound that is based on ...
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 ...
Yazılım-tanımlı veri depolama ağlarında servis kalite farkındalıklı zamanlamaya doğru
(IEEE, 2017)
Yazılım-Tanımlı Veri Depolama (Software-Defined Storage, SDS) konsepti son zamanlarda veri merkezlerinde yeni bir teknoloji olarak ortaya çıkmıştır. Bu teknoloji, hem veri merkezi sahiplerine, hem uygulama geliştiricilerine ...
Towards a testing framework with visual feedback for actor-based systems
(IEEE, 2018-08-02)
We introduce a prototype testing framework as an extension of JUnit for testing actor-based systems. Our framework runs a given JUnit test in various schedules and records the execution trace for each run. In case a failure ...
Share this page