Pages that link to "Item:Q3832309"
From MaRDI portal
The following pages link to Open-shop scheduling problems with dominated machines (Q3832309):
Displaying 19 items.
- The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
- The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016) (← links)
- Scheduling ordered open shops (Q580167) (← links)
- The museum visitor routing problem (Q969135) (← links)
- Openshop and flowshop scheduling to minimize sum of completion times (Q1086145) (← links)
- Open shop scheduling with machine dependent processing times (Q1201806) (← links)
- Open shop scheduling with maximal machines (Q1377665) (← links)
- A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
- An iterative improvement approach for the nonpreemptive open shop scheduling problem (Q1806862) (← links)
- A polynomial algorithm for the three-machine open shop with a bottleneck machine (Q1960318) (← links)
- When difference in machine loads leads to efficient scheduling in open shops (Q1960320) (← links)
- Three-machine open shop with a bottleneck machine revisited (Q2061137) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Open-shop dense schedules: properties and worst-case performance ratio (Q2434260) (← links)
- A polynomially solvable case of the two-stage open shop problem for three machines (Q2729351) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
- Lexicographical scheduling problem on three machine open shop (Q3988770) (← links)
- Optimal four-machine flow shop scheduling with dominance condition (Q5454979) (← links)
