On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / 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.1002/nav.20352 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012125051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dominance rule to minimize total weighted tardiness with unequal release dates. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal-length jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates / 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: Scheduling with release dates on a single machine to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of a single machine to minimize total weighted completion time subject to release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations and the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Schedule-Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times and time windows on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of the total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient heuristics to minimize total flow time with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms to minimize the weighted number of late jobs on a single machine. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling with Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on the Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer programming model for scheduling orders in a steel mill / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic paradoxes of the single-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs / 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: Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties / rank
 
Normal rank

Latest revision as of 12:31, 2 July 2024

scientific article; zbMATH DE number 5679202
Language Label Description Also known as
English
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
scientific article; zbMATH DE number 5679202

    Statements

    On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (English)
    0 references
    0 references
    0 references
    9 March 2010
    0 references
    mixed integer program
    0 references
    scheduling
    0 references
    earliness
    0 references
    tardiness
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers