✦ LIBER ✦

A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem

✍ Scribed by T.C.E. Cheng

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 139 KB
Volume: 17
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(90)90020-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the optimality of index priori

A note on the optimality of index priority rules for search and sequencing problems

✍ George J. Kyparisis; Christos Koulamas 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB

A note on the optimality conditions for

A note on the optimality conditions for the bilevel programming problem

✍ P. A. Clark; A. W. Westerberg 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 2 views

A Note on Determining the Range of Optim

A Note on Determining the Range of Optimality for Decision Analysis Problems

✍ Barry Alan Pasternack 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 42 KB

A note on a partial search algorithm for

A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

✍ T.C.E. Cheng 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Proof of the convergence of Sheleikhovsk

Proof of the convergence of Sheleikhovskii's method for a problem with transportation constraints

✍ L.M. Bregman 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 547 KB

A Note on the Neumann Problem for a Quas

A Note on the Neumann Problem for a Quasilinear Elliptic Problem of a Nonmonotone Type

✍ Ivan Hlaváček 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 155 KB

The existence and uniqueness of a weak solution of a Neumann problem is discussed for a second-order quasilinear elliptic equation in a divergence form. The note is a continuation of a recent paper, where mixed boundary value problems were considered, which guaranteed the coerciveness of the problem