A heuristic for preemptive scheduling with set-up times (Q1202243): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Time bounds for selection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Performance Guarantees for Scheduling Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling with Deadlines and Loss Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times / rank | |||
Normal rank | |||
Latest revision as of 13:18, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for preemptive scheduling with set-up times |
scientific article |
Statements
A heuristic for preemptive scheduling with set-up times (English)
0 references
25 February 1993
0 references
preemptive scheduling
0 references
identical parallel machines
0 references
heuristics
0 references
worst- case analysis
0 references
\(m\) parallel machines
0 references
NP-complete
0 references
constant (job- and machine-independent) set-up times
0 references
polynomial time approximation algorithm
0 references
