Pages that link to "Item:Q1058969"
From MaRDI portal
The following pages link to On the complexity of preemptive open-shop scheduling problems (Q1058969):
Displaying 30 items.
- Scheduling ordered open shops (Q580167) (← links)
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← 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)
- A note on the complexity of the concurrent open shop problem (Q880556) (← links)
- On the complexity of constructing multiprocessor little-preemptive schedules (Q902062) (← links)
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← links)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- On the solution region for certain scheduling problems with preemption (Q1273129) (← 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)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- Shop scheduling problems under precedence constraints (Q1357789) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
- NP-hardness of shop-scheduling problems with three jobs (Q1893158) (← links)
- Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
- Open shop scheduling with some additional constraints (Q1911243) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- New complexity results for shop scheduling problems with agreement graphs (Q2232609) (← links)
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows (Q2378457) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223) (← links)
- A preemptive open shop scheduling problem with one resource (Q2641218) (← links)
- (Q3801319) (← 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)