✦ LIBER ✦

Decomposition in single-machine scheduling

✍ Scribed by Wlodzimierz Szwarc

Book ID: 110379469
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 427 KB
Volume: 83
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018916215399

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximization Problems in Single Machine

Maximization Problems in Single Machine Scheduling

✍ Mohamed Ali Aloulou; Mikhail Y. Kovalyov; Marie-Claude Portmann 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 117 KB

Single machine scheduling problems with

✍ Ji-Bo Wang; Li-Yan Wang; Dan Wang; Xiao-Yuan Wang; Wen-Jun Gao; Na Yin 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 286 KB

Knowledge-based single machine schedulin

Knowledge-based single machine scheduling

✍ Gursel A. Suer; Cihan Dagli 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Multi-agent single machine scheduling

✍ Alessandro Agnetis; Dario Pacciarelli; Andrea Pacifici 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 383 KB

Single-machine scheduling with dynamic a

Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm

✍ Suresh Chand; Rodney Traub; Reha Uzsoy 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 689 KB

This article considers the single-machine dynamic scheduling problem where the jobs have different arrival times and the objective is to minimize the sum of completion times. This problem is known to be strongly NP-hard. We develop decomposition results for this problem such that a large problem can

Preemption in single machine earliness/t

Preemption in single machine earliness/tardiness scheduling

✍ Kerem Bülbül; Philip Kaminsky; Candace Yano 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 617 KB