MIP modelling of changeovers in production planning and scheduling problems (Q1278814): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of efficiently solvable generalized traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane approach to capacitated lot-sizing with start-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem as a constrained shortest path problem: Theory and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Deterministic Dynamic Product Cycling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal periodic scheduling of multipurpose batch plants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time indexed formulation of non-preemptive single machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated Lot-Sizing Problems with Start-Up Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints / rank
 
Normal rank

Latest revision as of 18:38, 28 May 2024

scientific article
Language Label Description Also known as
English
MIP modelling of changeovers in production planning and scheduling problems
scientific article

    Statements

    MIP modelling of changeovers in production planning and scheduling problems (English)
    0 references
    22 February 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    survey
    0 references
    valid inequalities
    0 references
    production planning
    0 references
    machine sequencing
    0 references
    lot-sizing
    0 references
    interval submodular inequalities
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references