✦ LIBER ✦

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

✍ Scribed by Dvir Shabtay; Yaron Bensoussan

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 514 KB
Volume: 15
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-010-0204-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 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 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

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.

Scheduling Equal Processing Time Jobs to

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs

✍ Peter Brucker; Svetlana A. Kravchenko 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 705 KB

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.