Pages that link to "Item:Q1278196"
From MaRDI portal
The following pages link to Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196):
Displaying 14 items.
- Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252) (← links)
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q342351) (← links)
- Heuristics for search sequencing under time-dependent probabilities of existence (Q868139) (← links)
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
- Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
- A systematic procedure for setting parameters in simulated annealing algorithms (Q1389193) (← links)
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. (Q1410120) (← links)
- A genetic algorithm of determining cycle time for printed circuit board assembly lines (Q1592746) (← links)
- Total tardiness minimization in permutation flowshop with deterioration consideration (Q1630777) (← links)
- Minimizing makespan on an \(m\)-machine re-entrant flowshop (Q2459401) (← links)
- Optimal versus heuristic scheduling of surface mount technology lines (Q3159686) (← links)
- Optimal algorithm for minimizing production cycle time of a printed circuit board assembly line (Q4671359) (← links)
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints (Q4921223) (← links)
