Most office equipment is maintained by service organizations consisting of teams of service representatives. An important problem for the service organizations is the determination of the spare parts inventory to be carried by each service representative. This note presents a model for finding...

Purpose: This research studies how the security-related outsourcing strategies and negotiation power of the public sector and the military and the relevant logistics service providers influence for indirect logistics costs. Design/methodology/approach: A tentative model was devised from...

A formulation is presented for obtaining the optimal kit of parts and tools for on-site equipment repairs, based on the fraction of jobs which can be completed from the contents of the kit. This formulation generalizes previous approaches in that part demands need not be independent and various...

In this paper a multi-product, multi-echelon location–allocation model for the optimization of a supply chain design is proposed. This model integrated inventory decisions into distribution network design with stochastic market demands. The goal is to select the optimum numbers, locations, and...

I present a simple estimated model of the New Zealand economy which is used to assess the sensitivity of the impact multiplier and output losses associated with fiscal consolidations to uncertainty over model parameters. I find that, in normal times, the fiscal multiplier can be expected to lie...

Quadratic assignment problems (QAPs) are known to be among the most challenging discrete optimization problems. Recently, a new class of semi-definite relaxation models for QAPs based on matrix splitting has been proposed (Mittelmann and Peng, SIAM J Optim 20:3408–3426, <CitationRef CitationID="CR25">2010</CitationRef>; Peng et...</citationref>

We consider the determination of optimal portfolios under a lower bound on the final wealth. Possible applications range from capital guarantee strategies over life insurance investment where part of the benefit is a guaranteed return on capital to continuous-time mean-variance problems with a...

This paper presents branch-and-bound algorithms developed for an m-machine permutation flowshop to minimise the maximum weighted flowtime/maximum weighted tardiness/maximum sum of weighted flowtime and weighted tardiness/maximum sum of weighted flowtime, weighted tardiness and weighted earliness...

As Roemer (1986) points out, things become more interesting once we include information. In this paper, following the line started by Jiménez-Gómez and Marco-Gil (2008), we define both a lower and an upper bounds on awards in the framework of the Lorenz-Bifocal Bankruptcy Problem (Gadea et al....