Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2005.08.013 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.08.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989488450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / 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: 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: Minimizing late jobs in the general one machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method to minimize the number of tardy jobs in single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the multiple-choice knapsack linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the one-machine scheduling problem / 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: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of tardy jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / 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: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs / 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: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Optimality Proof of Moore's Sequencing Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch and bound algorithm for minimizing the weighted number of tardy jobs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2005.08.013 / rank
 
Normal rank

Latest revision as of 05:24, 10 December 2024

scientific article
Language Label Description Also known as
English
Minimizing the weighted number of tardy jobs on a single machine with release dates
scientific article

    Statements

    Minimizing the weighted number of tardy jobs on a single machine with release dates (English)
    0 references
    0 references
    0 references
    15 November 2006
    0 references
    scheduling
    0 references
    combinatorial optimization
    0 references
    branch and bound
    0 references
    surrogate relaxation
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers