Pages that link to "Item:Q1412168"
From MaRDI portal
The following pages link to Flow-shop problems with intermediate buffers (Q1412168):
Displaying 23 items.
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- Job-shop scheduling with limited capacity buffers (Q850665) (← links)
- Simple heuristics for scheduling with limited intermediate storage (Q868994) (← links)
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- Complexity of single machine scheduling subject to nonnegative inventory constraints (Q992655) (← links)
- A note of using effective immune based approach for the flow shop scheduling with buffers (Q1045843) (← links)
- The scheduling problem where multiple machines compete for a common local buffer (Q1127173) (← links)
- A two-machine permutation flow shop scheduling problem with buffers (Q1286775) (← links)
- Movement optimization in flow shop processing with buffers. (Q1403180) (← links)
- The permutation flow shop with buffers: A tabu search approach (Q1610144) (← links)
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (Q2149603) (← links)
- Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
- Flexible flow shop with dedicated buffers (Q2414462) (← links)
- Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications (Q2434299) (← links)
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841) (← links)
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers (Q2489134) (← links)
- Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem (Q2814141) (← links)
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers (Q3596695) (← links)
- (Q4782792) (← links)
- Scheduling of a job-shop problem with limited output buffers (Q5059284) (← links)
- An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements (Q6497031) (← links)
- Algorithms for flow shop with job-dependent buffer requirements (Q6629020) (← links)