Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
From MaRDI portal
Publication:5959373
DOI10.1016/S0305-0548(00)00078-2zbMath0995.90081OpenAlexW2139982839WikidataQ56920692 ScholiaQ56920692MaRDI QIDQ5959373
Clarisse Dhaenens-Flipo, Lionel Dupont
Publication date: 3 April 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00078-2
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (42)
A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services ⋮ Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times ⋮ A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes ⋮ Integrated production and delivery on parallel batching machines ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes ⋮ An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Minimising makespan for two batch-processing machines with non-identical job sizes in job shop ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ When serial batch scheduling involves parallel batching decisions: a branch and price scheme ⋮ Just-in-time single-batch-processing machine scheduling ⋮ A constraint programming approach for a batch processing problem with non-identical job sizes ⋮ A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time ⋮ A hybrid neural network approach to minimize total completion time on a single batch processing machine ⋮ Bin Packing Problem with Time Lags ⋮ Model approximation for batch flow shop scheduling with fixed batch sizes ⋮ MIP formulations and heuristics for solving parallel batching problems ⋮ Scheduling batch processing machine using max-min ant system algorithm improved by a local search method ⋮ A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Solving single batch-processing machine problems using an iterated heuristic ⋮ Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness ⋮ A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times ⋮ Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs ⋮ A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines ⋮ Revisit of the scheduling problems with integrated production and delivery on parallel batching machines ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan ⋮ Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes ⋮ Column generation for minimizing total completion time in a parallel-batching environment ⋮ Scheduling an unbounded batching machine with job processing time compatibilities ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
Cites Work
- Unnamed Item
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a batching machine
- Scheduling with agreeable release times and due dates on a batch processing machine
- Minimizing total completion time on a batch processing machine with job families
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
This page was built for publication: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
