MILP models to minimise makespan in additive manufacturing machine scheduling problems

DOI10.1016/j.cor.2019.01.006zbMath1458.90315OpenAlexW2911214837WikidataQ128535394 ScholiaQ128535394MaRDI QIDQ1722963

Ibrahim Kucukkoc

Publication date: 19 February 2019

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

Full work available at URL: https://doi.org/10.1016/j.cor.2019.01.006

zbMATH Keywords

schedulingmathematical modellingadditive manufacturingMILP3D printing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing ⋮ Scheduling unrelated additive manufacturing machines with practical constraints ⋮ Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families ⋮ Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing ⋮ Competing through the last mile: strategic 3D printing in a city logistics context ⋮ A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ Particle swarm optimization for integrated scheduling problem with batch additive manufacturing and batch direct-shipping delivery ⋮ An overview on the use of operations research in additive manufacturing ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers ⋮ Metal additive manufacturing: nesting vs. scheduling

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• Scheduling unrelated parallel batch processing machines with non-identical job sizes
• Scheduling a batching machine
• The complexity of one-machine batching problems
• One-machine batching and sequencing of multiple-type items
• Batch scheduling to minimize maximum lateness
• Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
• Scheduling with batching: A review
• On the Complexity of Scheduling with Batch Setup Times
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• Scheduling Groups of Jobs on a Single Machine

This page was built for publication: MILP models to minimise makespan in additive manufacturing machine scheduling problems