Sciweavers

175 search results - page 25 / 35
» Approximation Algorithms for Flexible Job Shop Problems
Sort
View
WSC
2000
13 years 9 months ago
Use of discrete event simulation to validate an agent based scheduling engine
This paper discusses the use of simulation in a new context. Most often QUEST is viewed as a stand-alone simulation tool to analyze and understand shop floor behavior. It has rare...
Shubhabrata Biswas, Sara Merchawi
EOR
2008
78views more  EOR 2008»
13 years 7 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas
ASC
2006
13 years 9 months ago
A WAM implementation for flexible query answering
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approximate reasoning and flexible query answering. The operational mechanism of similar...
Pascual Julián Iranzo, Clemente Rubio-Manza...
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
HPDC
2007
IEEE
14 years 1 months ago
Precise and realistic utility functions for user-centric performance analysis of schedulers
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
Cynthia Bailey Lee, Allan Snavely