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

The cyclic separation scheduling problem

โœ Scribed by Ronald D. Armstrong; Prabhakant Sinha


Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
594 KB
Volume
24
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The complexity of cyclic shop scheduling
โœ Nicholas G. Hall; Tae-Eog Lee; Marc E. Posner ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 190 KB

We consider scheduling problems for shops in which a job set is manufactured repetitively. Jobs are scheduled to minimize the cycle time of the job set, which is equivalent to maximizing the throughput rate. We characterize the complexity of the scheduling problem for several types of job shops. Pol

Cyclical schedules for the joint repleni
โœ Ian R. Webb; Bruce R. Buzby; Gerard M. Campbell ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 75 KB

The Joint Replenishment Problem (JRP) involves production planning for a family of items. The items have a coordinated cost structure whereby a major setup cost is incurred whenever any item in the family is produced, and an item-specific minor setup cost is incurred whenever that item is produced.

The payment scheduling problem
โœ Richard C. Grinold ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 548 KB