Pages that link to "Item:Q1410328"
From MaRDI portal
The following pages link to Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328):
Displaying 16 items.
- New perspectives in VLSI design automation: deterministic packing by sequence pair (Q610960) (← links)
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search (Q846170) (← links)
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← links)
- Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
- Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations (Q1717811) (← links)
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Scheduling jobs on a \(k\)-stage flexible flow-shop (Q2271811) (← links)
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
- Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach (Q2792241) (← links)
- A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem (Q2794678) (← links)
- Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic (Q3055403) (← links)
- A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD (Q3406729) (← links)
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach (Q3527930) (← links)
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q3527950) (← links)
