Common due date assignment and scheduling with ready times (Q1867095): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem / 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: Q4055377 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing average completion time in the presence of release dates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time / rank | |||
Normal rank | |||
Revision as of 14:28, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Common due date assignment and scheduling with ready times |
scientific article |
Statements
Common due date assignment and scheduling with ready times (English)
0 references
2 April 2003
0 references
single-machine scheduling
0 references
earliness
0 references
tardiness
0 references
due date assignment
0 references
0 references
