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

Maximizing the weighted number of just-in-time jobs in flow shop scheduling

โœ Scribed by Byung-Cheon Choi; Suk-Hun Yoon

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

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.