Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure

Authors:
Lionel Dupont;Clarisse Dhaenens-Flipo
Affiliations:
GILCO -6, Avenue Félix Viallet, 38031 Grenoble Cedex, France;LIFL - Batiment M3, Cité scientifique, 59655 Villeneuve d'Ascq cedex, France
Venue:
Computers and Operations Research
Year:
2002

Citing 2
Cited 18

Batching and scheduling jobs on batch and discrete processors

Operations Research
Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research

Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

Computers and Operations Research
Scheduling a capacitated batch-processing machine to minimize makespan

Robotics and Computer-Integrated Manufacturing
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes

Computers and Operations Research
Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing

Robotics and Computer-Integrated Manufacturing
Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics

Expert Systems with Applications: An International Journal
Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines

Engineering Applications of Artificial Intelligence
A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes

Computers and Operations Research
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes

Engineering Applications of Artificial Intelligence
Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints

Operations Research
Tabu search heuristic for two-machine flowshop with batch processing machines

Computers and Industrial Engineering
The train delivery problem: vehicle routing meets bin packing

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Scheduling an unbounded batching machine with job processing time compatibilities

Discrete Applied Mathematics
Dynamic scheduling problem of batch processing machine in semiconductor burn-in operations

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Minimizing makespan on a single batch processing machine with non-identical job sizes: a hybrid genetic approach

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes

Applied Soft Computing
Scheduling unrelated parallel batch processing machines with non-identical job sizes

Computers and Operations Research
An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In response to market pressures resulting in increased competition, product proliferation and greater customization, firms in many industries have adopted modern technologies to provide operational flexibility on several dimensions. In this paper, we ...