An exact approach for bi-objective non-identical batch processing machines scheduling

DOI10.1007/S10479-025-06485-ZMaRDI QIDQ7002465zbMATH OpenFDO

Authors Shaoxiang Zheng, Nai-ming Xie, Qiao Wu

Publication date 3 April 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-025-06485-Z

zbMATH Keywords

batch processingbi-objective optimizationbranch-and-pricemanufacturingscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
• A branch-and-price algorithm for the bin packing problem with conflicts
• A branch-and-price algorithm for the temporal bin packing problem
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
• Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
• Branch-and-bound for bi-objective integer programming
• Efficient scheduling algorithms for a single batch processing machine
• Exact algorithms to minimize makespan on single and parallel batch processing machines
• Integrated scheduling on parallel batch processing machines with non-identical capacities
• Novel mathematical formulations for parallel-batching processing machine scheduling problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing
• Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches

This page was built for publication: An exact approach for bi-objective non-identical batch processing machines scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7002465)