𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for two-machine flow-shop sequencing with precedence constraints

✍ Scribed by A.M.A. Hariri; C.N. Potts

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
827 KB
Volume
17
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An exact algorithm for the batch sequenc
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
✍ A. Agnetis; F. Rossi; G. Gristina πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 295 KB πŸ‘ 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.

An approximation algorithm for schedulin
An approximation algorithm for scheduling two parallel machines with capacity constraints
✍ Heng Yang; Yinyu Ye; Jiawei Zhang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 205 KB

We consider the problem of scheduling n independent jobs on two identical parallel machines, with a limit on the number of jobs that can be assigned to each single machine, so as to minimize the total weighted completion time of the jobs. We study a semideΓΏnite programming-based approximation algori