✦ LIBER ✦

A note on a computational approximation to the two-machine problem

✍ Scribed by Brian Gluss

Book ID: 114036409
Publisher: Elsevier Science
Year: 1962
Weight: 350 KB
Volume: 5
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(62)90610-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A -approximation algorithm for the two-m

A -approximation algorithm for the two-machine routing open-shop problem on a two-node network

✍ Igor Averbakh; Oded Berman; Ilya Chernykh 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Note: On the two-machine no-idle flowsho

Note: On the two-machine no-idle flowshop problem

✍ Ondřej Čepek; Masanori Okada; Milan Vlach 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB 👁 1 views

In this short note we study a two-machine flowshop scheduling problem with the additional no-idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these cla

A note on the complexity of the problem

A note on the complexity of the problem of two-agent scheduling on a single machine

✍ C. T. Ng; T. C. E. Cheng; J. J. Yuan 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 267 KB

A note on allocating jobs to two machine

A note on allocating jobs to two machines

✍ Michael H. Rothkopf 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

A note on the two-dipole problem

✍ M.J. Mandell 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 334 KB

A note on the two envelopes problem

✍ P. Rawling 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 305 KB