✦ LIBER ✦

Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling

✍ Scribed by Wlodzimierz Szwarc and Samar K. Mukhopadhyay

Book ID: 125579871
Publisher: Palgrave Publishers Ltd.
Year: 1995
Tongue: English
Weight: 258 KB
Volume: 46
Category: Article
ISSN: 0160-5682
DOI: 10.2307/2584312

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimization of Time-Varying Costs in Si

Minimization of Time-Varying Costs in Single-Machine Scheduling

✍ E. L. Lawler and B. D. Sivazlian 📂 Article 📅 1978 🏛 INFORMS 🌐 English ⚖ 246 KB

Minimizing a quadratic function of job l

Minimizing a quadratic function of job lateness on a single machine

✍ Sushil K. Gupta; Tapan Sen 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 907 KB

Minimizing the weighted sum of quadratic

Minimizing the weighted sum of quadratic completion times on a single machine

✍ Federico Della Croce; Wlodzimierz Szwarc; Roberto Tadei; Paolo Baracco; Raffaele 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 429 KB 👁 2 views

Minimizing a weighted quadratic function

Minimizing a weighted quadratic function of job lateness in the single machine system

✍ Tapan Sen; Parthasarati Dileepan; Mary R. Lind 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 528 KB

Single-Machine Scheduling to Minimize a

Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

✍ J.A. Hoogeveen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 210 KB

We consider the problem of scheduling n jobs on a single machine that is continuously available from time zero onward and that can handle no more than one job at a time. Each job requires processing during a given positive uninter-Ž . rupted time. The cost of each job is measured by K Ks2, 3 nondecr

A note on “minimizing a quadratic functi

A note on “minimizing a quadratic function of job lateness on a single machine”

✍ Roberto Tadei 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 185 KB