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

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

โœ Scribed by Francis Sourd; Safia Kedad-Sidhoum

Publisher
Springer US
Year
2007
Tongue
English
Weight
434 KB
Volume
11
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A branch and bound algorithm for the res
A branch and bound algorithm for the resource-constrained project scheduling problem
โœ Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB

A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit