𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing the expected weighted number of tardy jobs in stochastic flow shops

✍ Scribed by O.J. Boxma; F.G. Forst

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
492 KB
Volume
5
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimizing the number of tardy jobs in s
Minimizing the number of tardy jobs in single machine sequencing
✍ Ahmad H. Sharary; Nejib Zaguia πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 568 KB

A set P of n jobs has to be processed without preemption, one job at a time, on a single machine. The weight and processing time of each job is one. Furthermore, the jobs are subject to precedence constraints represented by a given ordered set (P, <). In a feasible schedule a job is called a tardy j

A shifting bottleneck heuristic for mini
A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
✍ Michael Pinedo; Marcos Singer πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 165 KB πŸ‘ 2 views

We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single-machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem.