Pages that link to "Item:Q1333531"
From MaRDI portal
The following pages link to On the complexity of preemptive openshop scheduling problems (Q1333531):
Displaying 19 items.
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- On the complexity of constructing multiprocessor little-preemptive schedules (Q902062) (← links)
- On the complexity of preemptive open-shop scheduling problems (Q1058969) (← links)
- A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness (Q1280122) (← links)
- Preemptive job-shop scheduling problems with a fixed number of jobs (Q1299919) (← links)
- Open shops with jobs overlap (Q1319530) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
- Open shop scheduling with some additional constraints (Q1911243) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223) (← links)
- (Q3217918) (← links)
- Openshop scheduling under linear resources constraints (Q4381875) (← links)
- (Q4605690) (← links)
- Open Problem—M/G/1 Scheduling with Preemption Delays (Q5113909) (← links)
- NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026) (← links)
