A constraint programming approach for a batch processing problem with non-identical job sizes
type: Item
instance of: scholarly article
title: A constraint programming approach for a batch processing problem with non-identical job sizes
zbMATH Open document ID: 1253.90198
author: Arnaud Malapert
author: Christelle Guéret
author: Louis-Martin Rousseau
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6119470
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: artificial intelligence
zbMATH Keywords: constraint programming
zbMATH Keywords: scheduling
zbMATH Keywords: packing
describes a project that uses: Choco
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.04.008
OpenAlex ID: W1995082853
cites work: Scheduling a batch processing machine with non-identical job sizes
cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems.
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Scheduling a batching machine
cites work: New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
cites work: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
cites work: Q3624058
cites work: Q4198056
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
cites work: Q4821303
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
cites work: A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
cites work: Q3993418
cites work: A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
cites work: Minimizing total weighted tardiness on a single batch process machine with incompatible job families
cites work: Scheduling with batching: A review
cites work: Q3184605
cites work: Optimal methods for batch processing problem with makespan and maximum lateness objectives
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: A dynamic programming approach for consistency and propagation for knapsack constraints
cites work: Scheduling batch processing machines with incompatible job families
cites work: Scheduling Groups of Jobs on a Single Machine
DOI: 10.1016/J.EJOR.2012.04.008
description: scientific article; zbMATH DE number 6119470