Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria (Q1767711): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2734595 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3938812 / 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: Q4124332 / 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: Q3221403 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximability of scheduling with fixed jobs / rank | |||
Normal rank |
Latest revision as of 18:38, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria |
scientific article |
Statements
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria (English)
0 references
8 March 2005
0 references
Scheduling
0 references
Single machine
0 references
Fixed jobs
0 references
Preemption
0 references
0 references
0 references