Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A branch and bound method for the job-shop problem with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound to minimize the number of late jobs on a single machine with release time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-facility scheduling by logic-based Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated methods for optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling by Logic-Based Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Deterministic Dynamic Product Cycling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates / 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: A time indexed formulation of non-preemptive single machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to single-machine scheduling problems. / 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
Property / cites work
 
Property / cites work: MIP modelling of changeovers in production planning and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Product Inventory Logistics Modeling in the Process Industries / rank
 
Normal rank

Latest revision as of 17:14, 15 July 2024

scientific article
Language Label Description Also known as
English
Changeover formulations for discrete-time mixed-integer programming scheduling models
scientific article

    Statements

    Changeover formulations for discrete-time mixed-integer programming scheduling models (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    scheduling
    0 references
    integer programming
    0 references
    formulation tightness
    0 references
    manufacturing scheduling
    0 references
    0 references
    0 references

    Identifiers