A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems. / 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: The job-shop problem and immediate selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemption in single machine earliness/tardiness scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound approach for single machine scheduling with earliness and tardiness penalties / 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: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with early and tardy completion costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates / 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: A branch and bound procedure to minimize mean absolute lateness on a single processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for single machine scheduling with ready times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced dynasearch neighborhood for the single-machine total weighted 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: A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming method for single machine scheduling / 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: Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using short-term memory to minimize the weighted number of late jobs on a single machine. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal timing of a sequence of tasks with general completion costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine problem with earliness and tardiness penalties / 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: A time indexed formulation of non-preemptive single machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for single-machine scheduling without machine idle time / 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: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a class of single-machine weighted tardiness and earliness problems / rank
 
Normal rank

Latest revision as of 07:31, 7 July 2024

scientific article
Language Label Description Also known as
English
A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
scientific article

    Statements

    A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (English)
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    single-machine scheduling
    0 references
    machine idle time
    0 references
    exact algorithm
    0 references
    Lagrangian relaxation
    0 references
    dynamic programming
    0 references

    Identifiers