Minimizing the number of late jobs when the start time of the machine is variable (Q1758276): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / 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: Multicriteria scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Necessary and sufficient conditions of optimality for some classical scheduling problems / 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: Multicriteria scheduling problems: a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the number of tardy jobs with stochastically-ordered processing times / rank | |||
Normal rank | |||
Revision as of 20:13, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the number of late jobs when the start time of the machine is variable |
scientific article |
Statements
Minimizing the number of late jobs when the start time of the machine is variable (English)
0 references
8 November 2012
0 references
single machine scheduling
0 references
number of late jobs
0 references
Pareto optimal points
0 references
\(\epsilon \)-constraint approach
0 references
0 references
0 references
