𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimax problems with bitonic matrices

✍ Scribed by Dorit S. Hochbaum; Paul A. Tucker

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
192 KB
Volume
40
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The 1-minimax and 1-maximin problems wit
The 1-minimax and 1-maximin problems with demand weights of general probability distributions
✍ Oded Berman; Jiamin Wang πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 155 KB

## Abstract This paper investigates the 1‐minimax and 1‐maximin problems when demand weights are random variables with general continuous probability distributions. Properties of the optimal solutions are presented and solution procedures are developed. We also identify some known probability distr

Flowshop sequencing problem with ordered
Flowshop sequencing problem with ordered processing time matrices: A general case
✍ M. L. Smith; S. S. Panwalkar; R. A. Dudek πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 305 KB

## Abstract The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper con