✦ LIBER ✦

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

✍ Scribed by Shao Chin Sung; Milan Vlach

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 298 KB
Volume: 8
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-005-2863-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid memetic algorithm for maximizin

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

✍ F. Jolai; M. S. Amalnick; M. Alinaghian; M. Shakhsi-Niaei; H. Omrani 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 644 KB

Maximizing the weighted number of just-i

Maximizing the weighted number of just-in-time jobs in

✍ Dvir Shabtay; Yaron Bensoussan 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 514 KB

Maximizing the weighted number of just-i

Maximizing the weighted number of just-in-time jobs in flow shop scheduling

✍ Byung-Cheon Choi; Suk-Hun Yoon 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 287 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.

On complexity of minimizing weighted num

On complexity of minimizing weighted number of late jobs in unit time open shops

✍ A.A. Gladky 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We show that the problem of minimizing the weighted number of late jobs in open shop with given release dates and unit time operations is strongly .I '?-hard. The complexity status of this problem was unknown.