✦ LIBER ✦

On-line scheduling with non-crossing constraints

✍ Scribed by Lele Zhang; Kwanniti Khammuang; Andrew Wirth

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 804 KB
Volume: 36
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2008.04.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A m-parallel crane scheduling problem wi

A m-parallel crane scheduling problem with a non-crossing constraint

✍ Andrew Lim; Brian Rodrigues; Zhou Xu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

Non-preemptive two-machine open shop sch

Non-preemptive two-machine open shop scheduling with non-availability constraints

✍ J. Breit; G. Schmidt; V. A. Strusevich 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 309 KB

On-line scheduling with tight deadlines

✍ Chiu-Yuen Koo; Tak-Wah Lam; Tsuen-Wan Ngan; Kunihiko Sadakane; Kar-Keung To 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 136 KB

On Line Graphs with Crossing Number 1

✍ V. R. Kulli; D. G. Akka; L. W. Beineke 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

## Abstract In this paper we deduce a necessary and sufficient condition for a line grah to have crossing number 1. In addition, we prove that the line graph of any nonplanar graph has crossing number greater than 2.

Improved on-line broadcast scheduling wi

Improved on-line broadcast scheduling with deadlines

✍ Stanley P. Y. Fung; Feifeng Zheng; Wun-Tat Chan; Francis Y. L. Chin; Chung Keung 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 391 KB

On-line machine scheduling with batch se

On-line machine scheduling with batch setups

✍ Lele Zhang; Andrew Wirth 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 558 KB