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

An exact algorithm for multiple depot bus scheduling

โœ Scribed by M.A. Forbes; J.N. Holt; A.M. Watts

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
660 KB
Volume
72
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Exact algorithms for scheduling multiple
Exact algorithms for scheduling multiple families of jobs on parallel machines
โœ Zhi-Long Chen; Warren B. Powell ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o

An exact algorithm for large multiple kn
An exact algorithm for large multiple knapsack problems
โœ David Pisinger ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 137 KB

The Multiple Knapsack Problem (MKP) is the problem of assigning a subset of n items to m distinct knapsacks, such that the total proยฎt sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several applications in naval as well as ยฎnancial ma