On-line and off-line preemptive two-machine job shop scheduling (Q1592758): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5501839 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Makespan minimization in preemptive two machine job shops / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A combined BIT and TIMESTAMP algorithm for the list update problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4223058 / rank | |||
Normal rank | |||
Latest revision as of 11:36, 3 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line and off-line preemptive two-machine job shop scheduling |
scientific article |
Statements
On-line and off-line preemptive two-machine job shop scheduling (English)
0 references
13 May 2001
0 references
on-line algorithms
0 references
job shop scheduling
0 references
preemption
0 references
randomized algorithms
0 references
