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

The selection and scheduling of telecommunication calls with time windows

โœ Scribed by Ali Amiri

Book ID
108116796
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
302 KB
Volume
167
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The quay crane scheduling problem with t
The quay crane scheduling problem with time windows
โœ Frank Meisel ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 500 KB

The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time wi

Maximizing the weighted number of on-tim
Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
โœ C. Koulamas ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 541 KB

The problem of maximizing the weighted number of on-time jobs on a single machine with time windows (STW) is shown to be strongly NP-hard. An efficient. heuristic is presented for STW. Computational experiments indicate that the performance of the heuristic is quite good.