2864 search results - page 443 / 573 » Constraint Programming in OPL |
CPAIOR
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...
HM
2010
Springer
13 years 10 months ago
2010
Springer
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
APJOR
2010
13 years 9 months ago
2010
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
COR
2008
13 years 9 months ago
2008
We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective ...
COR
2008
13 years 9 months ago
2008
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...