Pages that link to "Item:Q1342286"
From MaRDI portal
The following pages link to Minimizing makespan in hybrid flowshops (Q1342286):
Displayed 38 items.
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
- A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines (Q881563) (← links)
- Scheduling problems in master-slave model (Q940888) (← links)
- Modeling realistic hybrid flexible flowshop scheduling problems (Q941540) (← links)
- Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
- Minimizing makespan in two-stage hybrid cross docking scheduling problem (Q1001000) (← links)
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
- A hybrid two-stage flowshop with part family, batch production, major and minor set-ups (Q1291587) (← links)
- Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines (Q1295836) (← links)
- Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
- Flowshop scheduling with identical jobs and uniform parallel machines (Q1303728) (← links)
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517) (← links)
- Heuristic algorithms for the two-stage hybrid flowshop problem (Q1371955) (← links)
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. (Q1410120) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine (Q1569925) (← links)
- Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage (Q1607975) (← links)
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
- Scheduling flexible flow lines with sequence-dependent setup times (Q1876159) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Scheduling jobs on a \(k\)-stage flexible flow-shop (Q2271811) (← links)
- A note on makespan minimization in two-stage flexible flow shops with uniform machines (Q2433488) (← links)
- Scheduling two-stage hybrid flow shop with availability constraints (Q2496033) (← links)
- The master-slave paradigm in parallel computer and industrial settings (Q2564882) (← links)
- Flexible flow shop scheduling with uniform parallel machines (Q2569085) (← links)
- Optimal versus heuristic scheduling of surface mount technology lines (Q3159686) (← links)
- An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions (Q3509420) (← links)
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time (Q4230171) (← links)
- (Q4487091) (← links)
- Sequencing a hybrid two-stage flowshop with dedicated machines (Q4706331) (← links)
- Solving the<i>n</i>-job 3-stage flexible flowshop scheduling problem using an agent-based approach (Q4823496) (← links)
- (Q4949162) (← links)
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately (Q5436247) (← links)