𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Openshop scheduling with machine dependent processing times

✍ Scribed by Moshe Dror


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
878 KB
Volume
39
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Two machine openshop scheduling with mac
✍ Asoo J. Vakharia; BΓΌlent Γ‡atay πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 408 KB

In a recent paper, Dror (1992) presented several results for openshop scheduling with machine dependent processing times. In this note, we present clarifications regarding the algorithm developed by him for minimizing the sum of job completion times (or average flow time) in a 2 machine openshop and

Single-machine scheduling with learning
✍ Dan Wang; Ming-Zheng Wang; Ji-Bo Wang πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 206 KB

We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two g