Pages that link to "Item:Q1885987"
From MaRDI portal
The following pages link to Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987):
Displaying 13 items.
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness (Q1280122) (← links)
- A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs (Q2449360) (← links)
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223) (← links)
- Two-machine open shop scheduling with special transportation times (Q3157382) (← links)
- Dual criteria preemptive open-shop problems with minimum makespan (Q4698132) (← links)
- (Q5453295) (← links)
- On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)
