✦ LIBER ✦

Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop

✍ Scribed by Andrew A. Cunningham; Sujit K. Dutta

Publisher: John Wiley and Sons
Year: 1973
Tongue: English
Weight: 450 KB
Volume: 20
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800200107

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The open shop scheduling problem with a

The open shop scheduling problem with a given sequence of jobs on one machine

✍ Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a

Two-machine flow shop scheduling with co

Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

✍ Wing-Kwan Yeung; Ceyda Oğuz; Tai-Chiu Edwin Cheng 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

Optimization of schedule stability and e

Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment

✍ Selcuk Goren; Ihsan Sabuncuoglu; Utku Koc 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

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

Polynomial time algorithms for minimizin

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

✍ Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 102 KB 👁 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t