✦ LIBER ✦

On-line algorithms for minimizing makespan on batch processing machines

✍ Scribed by Gouchuan Zhang; Xiaoqiang Cai; C.K. Wong

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 172 KB
Volume: 48
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing makespan on a single batch pr

Minimizing makespan on a single batch processing machine with nonidentical job sizes

✍ Guochuan Zhang; Xiaoqiang Cai; C.-Y Lee; C.K Wong 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

An Efficient Approximation Algorithm for

An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines

✍ Chandra Chekuri; Michael Bender 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 107 KB

We give a new and efficient approximation algorithm for scheduling precedenceconstrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes p j /s i units of time

Approximation algorithms for minimizing

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

✍ Joseph Y-T. Leung; Haibing Li; Michael Pinedo 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is re

Sub-PCA modeling and on-line monitoring

Sub-PCA modeling and on-line monitoring strategy for batch processes

✍ Ningyun Lu; Furong Gao; Fuli Wang 📂 Article 📅 2004 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 107 KB 👁 2 views

Polynomial time algorithms for minimizin

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

✍ Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 102 KB 👁 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t

Lower bounds and algorithms for flowtime

Lower bounds and algorithms for flowtime minimization on a single machine with set-up times

✍ Simon Dunstall; Andrew Wirth; Kenneth Baker 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 165 KB 👁 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this