Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance (Q1666798): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q59119716, #quickstatements; #temporary_batch_1706974296281 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59119716 / rank | |||
Normal rank | |||
Revision as of 18:35, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance |
scientific article |
Statements
Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance (English)
0 references
27 August 2018
0 references
Summary: We consider parallel-machine scheduling problems with past-sequence-dependent (psd) delivery times and aging maintenance. The delivery time is proportional to the waiting time in the system. Each machine has an aging maintenance activity. We develop polynomial algorithms to three versions of the problem to minimize the total absolute deviation of job completion times, the total load, and the total completion time.
0 references
