arXiv Open Access 2013

Simultaneous approximation for scheduling problems

Long Wan

Lihat Sumber

Abstrak

Motivated by the problem to approximate all feasible schedules by one schedule in a given scheduling environment, we introduce in this paper the concepts of strong simultaneous approximation ratio (SAR) and weak simultaneous approximation ratio (WAR). Then we study the two parameters under various scheduling environments, such as, non-preemptive, preemptive or fractional scheduling on identical, related or unrelated machines.

Topik & Kata Kunci

cs.DS

Penulis (1)

Long Wan

Format Sitasi

APA MLA BibTeX

Wan, L. (2013). Simultaneous approximation for scheduling problems. https://arxiv.org/abs/1304.4073

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓