𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new dynamic programming algorithm for the parallel machines total weighted completion time problem

✍ Scribed by Chung-Yee Lee; Reha Uzsoy

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
171 KB
Volume
11
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation algorithms for minimizing
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
✍ Joseph Y-T. Leung; Haibing Li; Michael Pinedo πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 214 KB

## Abstract We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is re

A dynamic programming algorithm for the
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
✍ Ioachim, Irina; GοΏ½linas, Sylvie; Soumis, FranοΏ½ois; Desrosiers, Jacques πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w