𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The flow shop problem with a composite cost function

✍ Scribed by C.R. Woollam; N. Sambandam

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
342 KB
Volume
9
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Asymptotically optimal schedules for sin
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
✍ S.M.R. Iravani; C.P. Teo πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 221 KB

We consider the processing of M jobs in a flow shop with N stations in which only a single server is in charge of all stations. We demonstrate that for the objective of minimizing the total setup and holding cost, a class of easily implementable schedules is asymptotically optimal.

Solving the undirected minimum cost flow
Solving the undirected minimum cost flow problem with arbitrary costs
✍ A. SedeΓ±o-Noda; C. GonzΓ‘lez-MartΓ­n; S. Alonso πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 66 KB

## Abstract We address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is characterized by the property that the flow of each arc with negative cost must be equal to its capacity. That is, the flow can be nonzero in both directions. This sit