✦ LIBER ✦

On-line scheduling with extendable working time on a small number of machines

✍ Scribed by Deshi Ye; Guochuan Zhang

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 100 KB
Volume: 85
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00404-0

No coin nor oath required. For personal study only.

✦ Synopsis

Speranza and Tuza [

📜 SIMILAR VOLUMES

Maximizing the weighted number of on-tim

Maximizing the weighted number of on-time jobs in single machine scheduling with time windows

✍ C. Koulamas 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 541 KB

The problem of maximizing the weighted number of on-time jobs on a single machine with time windows (STW) is shown to be strongly NP-hard. An efficient. heuristic is presented for STW. Computational experiments indicate that the performance of the heuristic is quite good.

Batch scheduling on a two-machine jobsho

Batch scheduling on a two-machine jobshop with machine-dependent setup times

✍ Gur Mosheiov; Daniel Oron 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB

Optimal preemptive scheduling on a fixed

Optimal preemptive scheduling on a fixed number of identical parallel machines

✍ Aziz Moukrim; Alain Quilliot 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Minimizing flow time on a constant numbe

Minimizing flow time on a constant number of machines with preemption

✍ Nikhil Bansal 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Scheduling jobs with release times on a

Scheduling jobs with release times on a machine with finite storage

✍ W.M. Nawijn; W. Kern; S. Baas 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 511 KB

Scheduling jobs with release times preem

Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

✍ Nodari Vakhania 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 910 KB