๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finding a complete matching with the maximum product on weighted bipartite graphs

โœ Scribed by Frank S.C. Tseng; Wei-Pang Yang; Arbee L.P. Chen

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
352 KB
Volume
25
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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