Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect (Q2503085): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Single-machine scheduling with learning considerations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Common due date scheduling with autonomous and induced learning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A bi-criterion single-machine scheduling problem with learning considerations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling problems with a learning effect / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel machine scheduling with a learning effect / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling with general job-dependent learning curves. / rank | |||
Normal rank | |||
Latest revision as of 19:18, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect |
scientific article |
Statements
Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect (English)
0 references
13 September 2006
0 references
scheduling
0 references
time-dependent
0 references
learning effect
0 references
single machine
0 references
