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

Optimal periodic scheduling of sensor networks: A branch and bound approach

โœ Scribed by Shi, Dawei; Chen, Tongwen

Book ID
122812065
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
472 KB
Volume
62
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal shift scheduling: A branch-and-p
Optimal shift scheduling: A branch-and-price approach
โœ Anuj Mehrotra; Kenneth E. Murphy; Michael A. Trick ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 127 KB ๐Ÿ‘ 2 views

We present a branch-and-price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widel

A branch and bound approach for single m
A branch and bound approach for single machine scheduling with earliness and tardiness penalties
โœ Pei Chann Chang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 660 KB

An n job, single machine scheduling problem in which each job has a distinct due date, dd, is studied in this paper. The objective is to determine an optimal schedule Ir ยฐ for a set of jobs, S, such that the total absolute deviation of the schedule is minimized. This objective function is based on t