Country: Netherlands

Found 18376 papers in total
Some issues on consistency of fuzzy preference relations
Some issues on consistency of fuzzy preference relations
2004,
In decision making, in order to avoid misleading solutions, the study of consistency...
Simultaneous minimization of total completion time and total deviation of job completion times
Simultaneous minimization of total completion time and total deviation of job completion times
2004,
This paper addresses a single-machine scheduling problem with the objective of...
Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation
Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation
2004,
Based on a previously derived weight-driven algorithm for the computation of the T...
Development and analysis of cost-based dispatching rules for job shop scheduling
Development and analysis of cost-based dispatching rules for job shop scheduling
2004,
Most dispatching rules for job shop scheduling assume that the cost of holding per...
Estimation of the weights of interacting criteria from the set of profiles by means of information-theoretic functionals
Estimation of the weights of interacting criteria from the set of profiles by means of information-theoretic functionals
2004,
Following the recent work of Marichal and Roubens on fuzzy measure identification in...
On the open-shop problem with preemption and minimizing the average completion time
On the open-shop problem with preemption and minimizing the average completion time
2004,
We consider an open-shop problem: n jobs have to be processed on m machines where each...
Strategyproof cost-sharing mechanisms for set cover and facility location games
Strategyproof cost-sharing mechanisms for set cover and facility location games
2005,
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/ a fraction...
Evaluating project completion times when activity times are Weibull distributed
Evaluating project completion times when activity times are Weibull distributed
2004,
Activity networks have been used to model complex projects with wide applications in...
A polynomial-time Nash equilibrium algorithm for repeated games
A polynomial-time Nash equilibrium algorithm for repeated games
2005,
With the increasing reliance on game theory as a foundation for auctions and...
Scheduling with tool changes to minimize total completion time: Basic results and shortest processing time performance
Scheduling with tool changes to minimize total completion time: Basic results and shortest processing time performance
2004,
We consider a single machine sequencing problem subject to tool wear, where the...
A buyer–seller game model for selection and negotiation of purchasing bids: Extensions and new models
A buyer–seller game model for selection and negotiation of purchasing bids: Extensions and new models
2004,
A number of efficiency-based vendor selection and negotiation models have been...
Pricing combinatorial auctions
Pricing combinatorial auctions
2004,
Single-item auctions have many desirable properties. Mechanisms exist to ensure...
Linear production games with committee control: Limiting behaviour of the core
Linear production games with committee control: Limiting behaviour of the core
2004,
We study the relation between the core of a given controlled committee LP-game and the...
Hypercubes and compromise values for cooperative fuzzy games
Hypercubes and compromise values for cooperative fuzzy games
2004,
For cooperative fuzzy games with a non-empty core hypercubes catching the core, the...
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
1999,
We present a new linear programming relaxation for the problem of minimizing the sum...
A lower bound for on-line scheduling on uniformly related machines
A lower bound for on-line scheduling on uniformly related machines
2000,
We consider the problem of on-line scheduling of jobs arriving one by one on uniformly...
A comment on scheduling on uniform machines under chain-type precedence constraints
A comment on scheduling on uniform machines under chain-type precedence constraints
2000,
In a recent paper, Chekuri and Bender derive (among other results) a polynomial-time...
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
2000,
In this note, we give a 1.47-approximation algorithm for the preemtpive scheduling of...
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
2000,
We consider a problem of scheduling jobs in two-machine no-wait flow shops for which...
Scheduling on uniform parallel machines to minimize maximum lateness
Scheduling on uniform parallel machines to minimize maximum lateness
2000,
We consider the uniform parallel machine scheduling problem with the objective of...
Group technology approach to the open shop scheduling problem with batch setup times
Group technology approach to the open shop scheduling problem with batch setup times
2000,
This paper studies the problem of scheduling jobs in a two-machine open shop to...
An improved heuristic for two-machine flowshop scheduling with an availability constraint
An improved heuristic for two-machine flowshop scheduling with an availability constraint
2000,
In this paper we study the two-machine flowshop scheduling problem with an...
An optimal rounding gives a better approximation for scheduling unrelated machines
An optimal rounding gives a better approximation for scheduling unrelated machines
2005,
A polynomial-time algorithm is suggested for non-preemptive scheduling of n...
Optimal preemptive scheduling on a fixed number of identical parallel machines
Optimal preemptive scheduling on a fixed number of identical parallel machines
2005,
In this paper, we consider the preemptive scheduling problem on a fixed number of...
Papers per page: