Single machine scheduling to minimize the number of early and tardy jobs (Q1919786): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel machine min-max weighted absolute lateness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Space-Shuttle Scheduling Problem / 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: Q4142699 / 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: Q4130999 / rank
 
Normal rank

Revision as of 13:43, 24 May 2024

scientific article
Language Label Description Also known as
English
Single machine scheduling to minimize the number of early and tardy jobs
scientific article

    Statements