MILP models to minimise makespan in additive manufacturing machine scheduling problems
type: Item
instance of: scholarly article
title: MILP models to minimise makespan in additive manufacturing machine scheduling problems
zbMATH Open document ID: 1458.90315
author: Ibrahim Kucukkoc
published in: Computers \& Operations Research
publication date: 2019-02-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7024939
zbMATH Keywords: additive manufacturing
zbMATH Keywords: 3D printing
zbMATH Keywords: scheduling
zbMATH Keywords: mathematical modelling
zbMATH Keywords: MILP
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2019.01.006
OpenAlex ID: W2911214837
cites work: The complexity of one-machine batching problems
cites work: Scheduling a batching machine
cites work: Q4873242
cites work: One-machine batching and sequencing of multiple-type items
cites work: Batch scheduling to minimize maximum lateness
cites work: A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
cites work: Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
cites work: Scheduling unrelated parallel batch processing machines with non-identical job sizes
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: Scheduling with batching: A review
cites work: Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
cites work: Scheduling Groups of Jobs on a Single Machine
Wikidata QID: Q128535394
DOI: 10.1016/J.COR.2019.01.006
description: scientific article; zbMATH DE number 7024939