Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling / 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 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: The one-machine sequencing 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: An exact method to minimize the number of tardy jobs in single machine scheduling / 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: A dual algorithm for the one-machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / 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: Q4055377 / 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: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00438-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067913114 / rank
 
Normal rank

Latest revision as of 08:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Using short-term memory to minimize the weighted number of late jobs on a single machine.
scientific article

    Statements

    Using short-term memory to minimize the weighted number of late jobs on a single machine. (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2003
    0 references
    Scheduling
    0 references
    Weighted number of late jobs
    0 references
    Release times
    0 references
    Branch-and-bound
    0 references
    Dynamic programming
    0 references
    Lagrangean relaxation
    0 references
    Time-indexed formulation
    0 references
    0 references
    0 references

    Identifiers