Minimizing makespan on a single batching machine with release times and non-identical job
sizes - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books …

We consider the problem of scheduling family jobs with release dates on a bounded
batching machine to minimize the makespan. A polynomial-time approximation scheme for …

We consider the problem of scheduling n jobs on m identical parallel batching machines.
Each job is characterized by a release time and a processing time. Each machine can …

In this paper we consider the unbounded single machine parallel batch scheduling problem
with family jobs and release dates to minimize makespan. We show that this problem is …

In this paper we consider the single-machine parallel-batching scheduling problem with
family jobs under on-line setting in the sense that we construct our schedule irrevocably as …

We study the scheduling of a set of n jobs, each characterized by a release (arrival) time and
a processing time, for a batch processing machine capable of running at most B jobs at a …

A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite Capacity Page 1
Annals of Operations Research 133, 175–181, 2005 © 2005 Springer Science + Business …

Given an undirected graph G and a positive integer k, the k-vertex-connectivity
augmentation problem is to find a smallest set F of new edges for which G+ F is k-vertex …