Pages that link to "Item:Q1371949"
From MaRDI portal
The following pages link to An open shop scheduling problem with a non-bottleneck machine (Q1371949):
Displaying 13 items.
- A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581) (← links)
- Non-bottleneck machines in three-machine flow shops (Q1585915) (← links)
- Two-stage open shop scheduling with a bottleneck machine (Q1592745) (← links)
- An iterative improvement approach for the nonpreemptive open shop scheduling problem (Q1806862) (← links)
- Scheduling parallel dedicated machines under a single non-shared resource (Q1869718) (← links)
- A polynomial algorithm for the three-machine open shop with a bottleneck machine (Q1960318) (← links)
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs (Q1960324) (← 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)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- (Q3033546) (← links)
- SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE (Q3103656) (← links)
- The open shop scheduling problem with a given sequence of jobs on one machine (Q4248937) (← links)