Lot scheduling on a single machine to minimize the (weighted) number of tardy orders (Q2203602): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Lot scheduling on a single machine / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducibility among Combinatorial 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: Q3525910 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single machine lot scheduling to minimize the total weighted (discounted) completion time / rank | |||
Normal rank | |||
Latest revision as of 18:34, 23 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lot scheduling on a single machine to minimize the (weighted) number of tardy orders |
scientific article |
Statements
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders (English)
0 references
7 October 2020
0 references
scheduling
0 references
lot scheduling
0 references
single machine
0 references
number of tardy orders
0 references
dynamic programming
0 references
0 references
