Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints

DOI10.1016/J.COR.2023.106474MaRDI QIDQ6551068zbMATH OpenFDO

Authors Kanxin Hu, Yuxin Che, Tsan Sheng Ng, Jie Deng

Publication date 6 June 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2023.106474

zbMATH Keywords

batch processingdue datesmeta-heuristicsrelease datestwo-dimensional packingunrelated parallel machine scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
• An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
• An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
• Evaluating the importance of randomization in adaptive large neighborhood search
• Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing
• Scheduling identical parallel machines with tooling constraints
• Scheduling unrelated additive manufacturing machines with practical constraints
• Scheduling unrelated parallel batch processing machines with non-identical job sizes
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
• Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study

Cited in

(9)

• Nesting and scheduling optimization of additive manufacturing systems: mapping the territory
• Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
• A new class of lower bounds for scheduling a batch processing machine to minimize makespan
• Multi-neighborhood simulated annealing for the oven scheduling problem
• Batch processing machine scheduling problems using a self-adaptive approach based on dynamic programming
• Benders decompositions for order acceptance and scheduling in additive manufacturing
• Improving the efficiency of logic-based benders decomposition for p-batch scheduling problems with two-dimensional packing
• A modified adaptive large neighborhood search algorithm for solving network-shared manufacturing resource scheduling
• Data-driven university examination timetabling with consideration of student stress

This page was built for publication: Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints

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