✦ LIBER ✦

A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines

✍ Scribed by F. Jolai; M. S. Amalnick; M. Alinaghian; M. Shakhsi-Niaei; H. Omrani

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 644 KB
Volume: 22
Category: Article
ISSN: 0956-5515
DOI: 10.1007/s10845-009-0285-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximizing Weighted number of Just-in-Ti

Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines

✍ Shao Chin Sung; Milan Vlach 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 298 KB

A heuristic for maximizing the number of

A heuristic for maximizing the number of on-time jobs on two uniform parallel machines

✍ Christos Koulamas; George J. Kyparisis 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

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.

Polynomial time algorithms for minimizin

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

✍ Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 102 KB 👁 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t