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

Minimizing the number of tankers to meet a fixed schedule

โœ Scribed by G. B. Dantzig; D. R. Fulkerson

Publisher
John Wiley and Sons
Year
1954
Tongue
English
Weight
290 KB
Volume
1
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

โœฆ Synopsis

I 6 . 12 G . B . D a n t z i g and D. R . F u l k e r s o n The Hand C o r p o r a t i o n

I

It is shown that the problem of determining the minimum number of tankers required to meet a fixed schedule of transportation of Navy fuel oil can be made into a linear programming problem of the t r a n sportation type. The simplex algorithm is then applied to solve a p a rt i cular s e heduling problem.

๐Ÿ“œ SIMILAR VOLUMES

Open shop scheduling to minimize the num
Open shop scheduling to minimize the number of late jobs
โœ Christos Koulamas; George J. Kyparisis ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 63 KB ๐Ÿ‘ 2 views

We develop polynomial algorithms for several cases of the NP-hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are or

A note on the complexity of family sched
A note on the complexity of family scheduling to minimize the number of late jobs
โœ T. C. Edwin Cheng; Zhaohui Liu; Yakov M. Shafransky ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English โš– 65 KB ๐Ÿ‘ 2 views

The single-machine family scheduling problem of minimizing the number of late jobs has been known to be NP-hard, but whether it is NP-hard in the strong sense is cited as an open problem in several reviews. In this note, we prove that this problem is strongly NP-hard even if all set-up times and pro