Sciweavers

626 search results - page 53 / 126
» Scheduling as Rule Composition
Sort
View
ANOR
2008
123views more  ANOR 2008»
13 years 8 months ago
An approach to predictive-reactive scheduling of parallel machines subject to disruptions
: In this paper, a new predictive-reactive approach to a parallel machine scheduling problem in the presence of uncertain disruptions is presented. The approach developed is based ...
Alejandra Duenas, Dobrila Petrovic
COR
2010
164views more  COR 2010»
13 years 8 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
ICIAP
1999
ACM
14 years 4 days ago
Texture Segmentation by Frequency-Sensitive Elliptical Competitive Learning
In this paper a new learning algorithm is proposed with the purpose of texture segmentation. The algorithm is a competitive clustering scheme with two specific features: elliptic...
Steve De Backer, Paul Scheunders
APAL
2008
80views more  APAL 2008»
13 years 8 months ago
System BV is NP-complete
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a self-dual, non-commutative logical operator, called seq. While the rules mix ...
Ozan Kahramanogullari
JCO
2002
96views more  JCO 2002»
13 years 7 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu