An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan

  title={An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan},
  author={Yuzhong Zhang and Zhigang Cao},
  journal={Journal of Combinatorial Optimization},
Abstract Motivated by the existence of an APTAS (Asymptotic PTAS) for bin packing problem, we consider the batch scheduling problem with nonidentical job sizes to minimize makespan. For the proportional special version, i.e., there exists a fixed number α such that pj=αsj for every 1≤j≤n, we first present a lower bound of 3/2 for the approximation ratio and then design an APTAS.  

The Train Delivery Problem - Vehicle Routing Meets Bin Packing

This work considers the train delivery problem, which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem with unsplittable demands, and designs the first approximation schemes for the general problem.

Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm

A novel two-phase heuristic (TP-H) is developed to solve a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times, and it is shown that TP-H can effectively and efficiently solve large-size problems in a reasonable time.

A coordinated scheduling of delivery and inventory in a multi-location hospital supplied with a central pharmacy

The objective of this work is to find a coordinated production and delivery schedule such that the sum of delivery and inventory costs is minimized and the experimental results show the efficiency of the proposed solving methods, based on the two following criteria: solution quality and processing time.



Scheduling a batch processing machine with non-identical job sizes

A branch and bound procedure applicable to a batch processor model with arbitrary job processing times, job weights and job sizes is described and it is found that the procedure returns optimal solutions to problems of up to 25 jobs in reasonable CPU time.

Approximation Algorithms in Batch Processing

A lower bound of a polynomial approximation scheme for minimizing makespan in a batch processing system under dynamic job arrivals is proved and this is matched by an on-line algorithm for the special case of unbounded machine capacity.

Scheduling a batching machine

This work proves some properties that identify a specific class of optimal schedules, and then uses these properties in designing an approximation algorithm and a branch-and-bound type optimization algorithm.

Minimizing Mean Completion Time in a Batch Processing System

The batch processing problem reduces to the ordinary uniprocessor system scheduling problem if B=1 and even for this seemingly simple extreme case, it is able to show that the problem is NP-hard for the weighted version.

Computing near-optimal schedules

This work surveys results for multiprocessor scheduling and shop scheduling problems that state that certain performance guarantees are unlikely to be attained, in the sense that if there is such a good algorithm, then P'= N P.

Scheduling with batching: A review

Bin packing can be solved within 1 + ε in linear time

For any listL ofn numbers in (0, 1) letL* denote the minimum number of unit capacity bins needed to pack the elements ofL. We prove that, for every positive ε, there exists anO(n)-time algorithmS