𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem

✍ Scribed by Philip Kaminsky and David Simchi-Levi

Book ID
123709484
Publisher
INFORMS
Year
1998
Tongue
English
Weight
420 KB
Volume
46
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Probabilistic analysis of an asymptotica
Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
✍ C.T. Ng; X. Cai; T.C.E. Cheng πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 2 views

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima