MILP models to minimise makespan in additive manufacturing machine scheduling problems (Q1722963): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128535394, #quickstatements; #temporary_batch_1723938276269
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2019.01.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2911214837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of one-machine batching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-machine batching and sequencing of multiple-type items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling to minimize maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unrelated parallel batch processing machines with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128535394 / rank
 
Normal rank

Latest revision as of 00:45, 18 August 2024

scientific article
Language Label Description Also known as
English
MILP models to minimise makespan in additive manufacturing machine scheduling problems
scientific article

    Statements

    MILP models to minimise makespan in additive manufacturing machine scheduling problems (English)
    0 references
    0 references
    19 February 2019
    0 references
    additive manufacturing
    0 references
    3D printing
    0 references
    scheduling
    0 references
    mathematical modelling
    0 references
    MILP
    0 references

    Identifiers