✦ LIBER ✦

A bicriteria approach to minimize the total weighted number of

✍ Scribed by Dvir Shabtay; George Steiner

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 657 KB
Volume: 14
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-010-0208-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single machine batch scheduling to minim

Single machine batch scheduling to minimize the weighted number of late jobs

✍ Peter Brucker; Mikhail Y. Kovalyov 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 419 KB

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

Scheduling unit time open shops to minim

Scheduling unit time open shops to minimize the weighted number of late jobs

✍ Peter Brucker; Bernd Jurisch; Thomas Tautenhahn; Frank Werner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Using Lagrangean relaxation to minimize

Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine

✍ Stéphane Dauzère-Pérès; Marc Sevaux 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Scheduling of a single machine to minimi

Scheduling of a single machine to minimize total weighted completion time subject to release dates

✍ Lucio Bianco; Salvatore Ricciardelli 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 764 KB

## Abstract In this paper the __n__/1/__r__~j~ Σ~j~ __w__~__j__~ __C__~__j__~ problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are

Single-machine scheduling to minimize th

Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs

✍ Chung-Lun Li; T.C.E. Cheng; Z.-L. Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 866 KB