Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs (Q1342333): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Survey of scheduling research involving due date determination decisions / 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: Q3940839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: A Simple Optimality Proof of Moore's Sequencing Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sequencing <i>n</i> Jobs on One Machine to Minimize the Number of Late Jobs / 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: 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: Q5181074 / 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

Revision as of 10:23, 23 May 2024

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

    Statements

    Identifiers