𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Batch scheduling on a two-machine jobshop with machine-dependent setup times

✍ Scribed by Gur Mosheiov; Daniel Oron

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
164 KB
Volume
58
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An FPTAS for scheduling a two-machine fl
An FPTAS for scheduling a two-machine flowshop with one unavailability interval
✍ C.T. Ng; Mikhail Y. Kovalyov πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 87 KB

## Abstract We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. Th

A note on the two machine job shop with
A note on the two machine job shop with exponential processing times
✍ Michael Pinedo πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 215 KB

## Abstract Consider two machines, labeled 1 and 2. A set of tasks has to be processed first on machine 1 and after that on machine 2. A second set of tasks has to be processed first on machine 2 and after that on machine 1. All the processing times are exponentially distributed. We present a polic

Scheduling jobs with random processing t
Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
✍ X. Cai; F. S. Tu πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 942 KB

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time ofeach job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objec