𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The bottleneck problem with minimum quantity commitments

✍ Scribed by Andrew Lim; Zhou Xu

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
206 KB
Volume
53
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Given an edge‐distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introduce minimum quantity commitments to balance workloads of suppliers, provide the best possible approximation algorithm, and study its generalizations and specializations. Β© 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006

πŸ“œ SIMILAR VOLUMES

The tree center problems and the relatio
The tree center problems and the relationship with the bottleneck knapsack problems
✍ Shioura, Akiyoshi; Shigeno, Maiko πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 57 KB πŸ‘ 2 views

The tree center problems are designed to find a subtree minimizing the maximum distance from any vertex. This paper shows that these problems in a tree network are related to the bottleneck knapsack problems and presents linear-time algorithms for the tree center problems by using the relation.

Solving the undirected minimum cost flow
Solving the undirected minimum cost flow problem with arbitrary costs
✍ A. SedeΓ±o-Noda; C. GonzΓ‘lez-MartΓ­n; S. Alonso πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 66 KB

## Abstract We address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is characterized by the property that the flow of each arc with negative cost must be equal to its capacity. That is, the flow can be nonzero in both directions. This sit

An optimal procedure for the coordinated
An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts
✍ Chia-Shin Chung; Sin-Hoon Hum; Omer Kirca πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 99 KB πŸ‘ 1 views

We consider in this paper the coordinated replenishment dynamic lot-sizing problem when quantity discounts are offered. In addition to the coordination required due to the presence of major and minor setup costs, a separate element of coordination made possible by the offer of quantity discounts nee

Models and heuristics for the k -degree
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs
✍ Christophe Duhamel; LuΓ­s Gouveia; Pedro Moura; MaurΓ­cio de Souza πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 319 KB πŸ‘ 1 views

## Abstract The __k__ ‐Degree constrained Minimum Spanning Tree Problem (__k__ ‐DMSTP) consists in finding a minimal cost spanning tree satisfying the condition that every node has a degree no greater than a fixed value __k__. Here we consider an extension where besides the edge costs, a concave co

A note on the single-machine scheduling
A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
✍ Suresh Chand; Hans Schneeberger πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th