✦ LIBER ✦

Sooner and Later Waiting Time Problems Based on a Dependent Sequence

✍ Scribed by Qing Han; Sigeo Aki

Book ID: 111532575
Publisher: Springer Japan
Year: 2000
Tongue: English
Weight: 450 KB
Volume: 52
Category: Article
ISSN: 0020-3157
DOI: 10.1023/a:1004182030590

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sooner and Later Waiting Time Problems f

Sooner and Later Waiting Time Problems for Runs in Markov Dependent Bivariate Trials

✍ Sigeo Aki; Katuomi Hirano 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 416 KB

Sooner and later waiting time problems f

Sooner and later waiting time problems for Markovian Bernoulli trials

✍ K. Balasubramanian; R. Viveros; N. Balakrishnan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Sooner and later waiting time problems i

Sooner and later waiting time problems in a two-state Markov chain

✍ Masayuki Uchida; Sigeo Aki 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 823 KB

Sooner and later waiting time problems f

Sooner and later waiting time problems for Bernoulli trials: frequency and run quotas

✍ M. Ebneshahrashoob; Milton Sobel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 477 KB

A generalization of the sooner and later

A generalization of the sooner and later waiting time problems for Bernoulli trials: Frequency quota

✍ K.D. Ling 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 307 KB

A generalized two-machine flowshop sched

A generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-time

✍ Dar-Li Yang; Maw-Sheng Chern 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We consider a two-machine ¯owshop scheduling problem where the processing times are linearly dependent on the waiting times of the jobs. The objective is to minimize the makespan. A 0±1 mixed integer program and a heuristic algorithm are proposed. Some cases solved in polynomial time and computation