✦ LIBER ✦

Job scheduling to minimize expected weighted flowtime on uniform processors

✍ Scribed by Rhonda Righter

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 591 KB
Volume: 10
Category: Article
ISSN: 0167-6911
DOI: 10.1016/0167-6911(88)90009-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing expected makespans of multi-p

Minimizing expected makespans of multi-priority classes of jobs on uniform processors

✍ Susan H. Xu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 548 KB

An efficient heuristic for scheduling in

An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs

✍ Chandrasekharan Rajendran; Hans Ziegler 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 640 KB

The problem of scheduling in a flowshop is considered with the objective of minimizing the total weighted flowtime of jobs. A heuristic algorithm is developed by the introduction of lower bounds on the completion times of jobs and the development of heuristic preference relations for the scheduling

Scheduling independent jobs on uniform p

Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria

✍ Alain Guinet 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 684 KB

Schedule of n jobs on two identical mach

Schedule of n jobs on two identical machines to minimize weighted mean flow time

✍ Bahram Alidaee 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Scheduling identical jobs with unequal r

Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness

✍ Maged M. Dessouky 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 308 KB

AbstractÐWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that