Skip to main content

Publisher: Elsevier

Volume 104, Number 3, 1 February 1998

Favourites:
ADD

A hierarchical decision support system for production planning (with case study)
pp. 403-422(20)
Authors: Ozdamar, L.; Bozyel, M.A.; Birbil, S.I.

Favourites:
ADD

On the (R, s, Q) inventory model when demand is modelled as a compound Bernoulli process
pp. 423-436(14)
Authors: Janssen, F.; Heuts, R.; de Kok, T.

Favourites:
ADD

Manufacturer incentives to improve retail service levels
pp. 437-450(14)
Authors: Ernst, R.; Powell, S.G.

Favourites:
ADD

Optimal television schedules in alternative competitive environments
pp. 451-473(23)
Authors: Kelton, C.M.L.; Schneider Stone, L.G.

Favourites:
ADD

A framework for analysing decisions under risk
pp. 474-484(11)
Authors: Danielson, M.; Ekenberg, L.

Favourites:
ADD

Comparing multicriteria methods in the context of environmental problems
pp. 485-496(12)
Authors: Salminen, P.; Hokkanen, J.; Lahdelma, R.

Favourites:
ADD

Reserve assemblage of critical areas: A zero-one programming approach
pp. 497-509(13)
Authors: Williams, J.C.; ReVelle, C.S.

Favourites:
ADD

Design of a distributed fiber transport network with hubbing topology
pp. 510-520(11)
Authors: Yoon, M.; Baek, Y.; Tcha D.-w.

Favourites:
ADD

A parallel implementation of the PROMETHEE method
pp. 521-531(11)
Authors: Dias, L.C.; Costa, J.P.; Climaco, J.N.

Favourites:
ADD
Favourites:
ADD
Favourites:
ADD

Solving a two-dimensional trim-loss problem with MILP
pp. 572-581(10)
Authors: Westerlund, T.; Isaksson, J.; Harjunkoski, I.

Favourites:
ADD

Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming
pp. 582-592(11)
Authors: Millar, H.H.; Kiragu, M.

Favourites:
ADD

The -assignment problems
pp. 593-600(8)
Authors: Chang, G.J.; Ho, P.

Favourites:
ADD
Favourites:
ADD

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more