Country: Netherlands

Found 18376 papers in total
Network decomposition-based benchmark results for the discrete time–cost tradeoff problem
Network decomposition-based benchmark results for the discrete time–cost tradeoff problem
2005,
In project management, the project duration can often be compressed by accelerating...
Augmented Lagrangian function, non-quadratic growth condition and exact penalization
Augmented Lagrangian function, non-quadratic growth condition and exact penalization
2006,
In this paper, under the assumption that the perturbation function satisfies a growth...
New computational results for the discrete time/cost trade-off problem with time-switch constraints
New computational results for the discrete time/cost trade-off problem with time-switch constraints
2005,
Recently, time-switch constraints have been introduced in the literature by Yang and...
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
2006,
The aim of this paper is to emphasize some remarkable properties of multicriteria...
Justification and RCPSP: A technique that pays
Justification and RCPSP: A technique that pays
2005,
The objective of this paper is to show that justification is a simple technique that...
A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
2005,
This paper presents an empirical study on the efficiency of the simulated annealing...
A scatter search algorithm for project scheduling under partially renewable resources
A scatter search algorithm for project scheduling under partially renewable resources
2006,
In this paper we develop a heuristic algorithm, based on Scatter Search, for project...
On the robust assignment problem under a fixed number of cost scenarios
On the robust assignment problem under a fixed number of cost scenarios
2006,
We investigate the complexity of the min–max assignment problem under a fixed...
An action-research based instrument for monitoring continuous quality improvement
An action-research based instrument for monitoring continuous quality improvement
2005,
Despite containing an extensive body of normative or prescriptive studies, quality...
Finite buffer polling models with routing
Finite buffer polling models with routing
2005,
This paper analyzes a finite buffer polling system with routing. Finite buffers are...
A semidefinite programming based polyhedral cut and price approach for the maxcut problem
A semidefinite programming based polyhedral cut and price approach for the maxcut problem
2006,
We investigate solution of the maximum cut problem using a polyhedral cut and price...
Partial convexification cuts for 0–1 mixed-integer programs
Partial convexification cuts for 0–1 mixed-integer programs
2005,
In this research, we propose a new cut generation scheme based on constructing a...
Static hedging of multivariate derivatives by simulation
Static hedging of multivariate derivatives by simulation
2005,
We propose an approximate static hedging procedure for multivariate derivatives. The...
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
2006,
The aim of this paper is to emphasize some remarkable properties of multicriteria...
Maximization of solution flexibility for robust shop scheduling
Maximization of solution flexibility for robust shop scheduling
2005,
We consider the problem of introducing flexibility in the schedule determination phase...
Inventory placement in acyclic supply chain networks
Inventory placement in acyclic supply chain networks
2006,
By adding a set of redundant constraints, and by iteratively refining the...
Complexity results for flow-shop problems with a single server
Complexity results for flow-shop problems with a single server
2005,
Flow-shop problems with a single server are generalizations of classical flow-shop...
The two-machine flow-shop problem with weighted late work criterion and common due date
The two-machine flow-shop problem with weighted late work criterion and common due date
2005,
The paper is on the two-machine non-preemptive flow-shop scheduling problem with a...
Positive half-products and scheduling with controllable processing times
Positive half-products and scheduling with controllable processing times
2005,
We study the single machine scheduling problem with controllable job processing times...
Single machine scheduling to minimize total weighted tardiness
Single machine scheduling to minimize total weighted tardiness
2005,
The problem of minimizing the total weighted tardiness in single machine scheduling is...
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
2005,
In this paper we study both the non-preemptive and preemptive versions of the popular...
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach
2005,
This paper considers the problem of scheduling jobs on unrelated parallel machines to...
Scheduling unit execution time and unit communication delay outforests to minimize maximum lateness
Scheduling unit execution time and unit communication delay outforests to minimize maximum lateness
2005,
In this paper, a well known NP -hard problem with parallel processors, precedence...
A comprehensive review and evaluation of permutation flowshop heuristics
A comprehensive review and evaluation of permutation flowshop heuristics
2005,
In this work we present a review and comparative evaluation of heuristics and...
Papers per page: