✦ LIBER ✦

Scheduling jobs to minimize total cost

✍ Scribed by Y.L. Chen

Book ID: 103796575
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 553 KB
Volume: 74
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90208-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling jobs on unrelated parallel ma

Scheduling jobs on unrelated parallel machines to minimize regular total cost functions

✍ MERAL Azizoglu; OMER Kirca 📂 Article 📅 1999 🏛 Taylor and Francis Group 🌐 English ⚖ 118 KB

Scheduling jobs on parallel machines to

Scheduling jobs on parallel machines to minimize a regular step total cost function

✍ Boris Detienne; Stéphane Dauzère-Pérès; Claude Yugma 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 607 KB

Erratum to: Scheduling jobs on parallel

Erratum to: Scheduling jobs on parallel machines to minimize a regular step total cost function

✍ Boris Detienne; Stéphane Dauzère-Pérès; Claude Yugma 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 147 KB

A bicriteria approach to maximize the we

A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system

✍ Dvir Shabtay; Yaron Bensoussan; Moshe Kaspi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Two-agent scheduling to minimize the tot

Two-agent scheduling to minimize the total cost

✍ Q.Q. Nong; T.C.E. Cheng; C.T. Ng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Scheduling deteriorating jobs to minimiz

Scheduling deteriorating jobs to minimize makespan

✍ Wieslaw Kubiak; Steef van de Velde 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J j grows by w j with each time unit its start is delayed beyond a given common critical date d. This processing time is p j if J j starts by d. We show that this problem i