A constraint programming approach for a batch processing problem with non-identical job sizes

DOI10.1016/j.ejor.2012.04.008zbMath1253.90198MaRDI QIDQ1926887

Arnaud Malapert, Louis-Martin Rousseau, Christelle Guéret

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.04.008

zbMATH Keywords

scheduling; combinatorial optimization; artificial intelligence; packing; constraint programming

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C27: Combinatorial optimization

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services, Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system, Integrated scheduling of production and distribution for manufacturers with parallel batching facilities, Column generation for minimizing total completion time in a parallel-batching environment, A survey of scheduling with parallel batch (p-batch) processing, Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine, A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time, The piggyback transportation problem: transporting drones launched from a flying warehouse, Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace, When serial batch scheduling involves parallel batching decisions: a branch and price scheme, Just-in-time single-batch-processing machine scheduling, Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine

Uses Software

• CPLEX
• Choco

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
• Optimal methods for batch processing problem with makespan and maximum lateness objectives
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
• Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
• A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
• Efficient scheduling algorithms for a single batch processing machine
• Scheduling a batching machine
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• A dynamic programming approach for consistency and propagation for knapsack constraints
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families
• Scheduling with batching: A review
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Scheduling batch processing machines with incompatible job families
• Scheduling a batch processing machine with non-identical job sizes
• Scheduling Groups of Jobs on a Single Machine
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Principles and Practice of Constraint Programming – CP 2004
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure