✦ LIBER ✦

One machine scheduling problem with fuzzy duedates

✍ Scribed by Sangsu Han; Hiroaki Ishii; Susumu Fujii

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 542 KB
Volume: 79
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90391-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single machine scheduling problem with f

Single machine scheduling problem with fuzzy precedence relation

✍ Hiroaki Ishii; Minoru Tada 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Minimizing late jobs in the general one

Minimizing late jobs in the general one machine scheduling problem

✍ Stéphane Dauzère-Pérès 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Open-shop scheduling problems with domin

Open-shop scheduling problems with dominated machines

✍ I. Adiri; N. Aizikowitz (Hefetz) 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

One-machine generalized precedence const

One-machine generalized precedence constrained scheduling problems

✍ Erick D. Wikum; Donna C. Llewellyn; George L. Nemhauser 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 656 KB

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

A single-machine scheduling problem with

A single-machine scheduling problem with random processing times

✍ S. Chakravarthy 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB