In this paper, we survey different models, techniques, and some recent results to tackle machine scheduling problems within a distributed setting. In traditional optimization, a central authority is asked to solve a (computationally hard) optimization problem. In contrast, in distributed...

In this paper we analyze the performance of a recently proposed sequential auction, called the c-bisection auction, that can be used for a sale of a single indivisible object. We discuss the running time and the e±ciency in the ex-post equilibrium of the auction. We show that by changing the...

We present first constant performance guarantees for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive policies with a guaranteed performance ratio of 2 which matches the currently...

In this article we define a requirements elicitation method based on natural language modelling. We argue that our method complies with synthesized quality criteria for RE methods, and compare this with the compliance of traditional RE methods (EER, ORM, UML). We show limited empirical evidence...

In this article we define a requirements elicitation method based on natural language modelling. We argue that our method complies with synthesized quality criteria for RE methods, and compare this with the compliance of traditional RE methods (EER, ORM, UML). We show limited empirical evidence...

We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the expected value of the total weighted...

An independence system is a family I of subsets of a ground set V with the property that any subset of any member of I also belongs to I. The inclusion-minimal sets not in I are called minimal covers. We prove several complexity results related to computation, enumeration, and counting of the...

The object-role model (ORM) data structure can be represented in the unified modeling language (UML) using the five fact encoding constructs: class attribute, association, association class, sub-class and the association qualifier. In the existing literature there exist numerous mappings of how...

In dit artikel worden de 9 UML diagramsoorten in hun onderlinge samenhang beschreven. Als uitgangspunt voor deze beschrijving worden de modelleringsconstructies en de modelsoorten uit Kenniskunde gebruikt. Het artikel laat verder zien wat de essentiële diagramsoorten in UML zijn en in welke...

The object-role model (ORM) data structure can be represented in the unified modeling language (UML) using the five fact encoding constructs: class attribute, association, association class, sub-class and the association qualifier. In the existing literature there exist numerous mappings of how...