Single-machine sequencing with controllable processing times (Q1194768): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Survey of scheduling research involving due date determination decisions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution structures and sensitivity of special assignment problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Factored Transportation Problem / 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 | |||
Latest revision as of 14:30, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-machine sequencing with controllable processing times |
scientific article |
Statements
Single-machine sequencing with controllable processing times (English)
0 references
11 October 1992
0 references
due date assignment
0 references
static single-machine sequencing
0 references
common due data
0 references
0 references
