Pages that link to "Item:Q915635"
From MaRDI portal
The following pages link to Some efficient heuristic methods for the flow shop sequencing problem (Q915635):
Displayed 50 items.
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- Scheduling flow shops using differential evolution algorithm (Q817560) (← links)
- Makespan distribution of permutation flowshop schedules (Q835630) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines (Q878937) (← links)
- Two-machine flow shop problems with a single server (Q880567) (← links)
- An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers (Q955624) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
- An improved particle swarm optimization algorithm for flowshop scheduling problem (Q975447) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems (Q1038288) (← links)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (Q1041924) (← links)
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
- Modified simulated annealing algorithms for the flow shop sequencing problem (Q1129912) (← links)
- Restricted neighborhood in the tabu search for the flowshop problem (Q1203798) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- The generalized shifting bottleneck procedure (Q1268190) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
- Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs (Q1280126) (← links)
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization (Q1280136) (← links)
- Fuzzy sets and operations research: Perspectives (Q1282905) (← links)
- A two-machine permutation flow shop scheduling problem with buffers (Q1286775) (← links)
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
- A tabu search approach for the flow shop scheduling problem (Q1296693) (← links)
- Heuristics for the flow line problem with setup costs (Q1303708) (← links)
- A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557) (← links)
- Combinatorial optimization techniques for spacecraft scheduling automation (Q1339156) (← links)
- Unrelated parallel machine scheduling using local search (Q1341398) (← links)
- The three-machine flow-shop problem with arbitrary precedence relations (Q1342006) (← links)
- A genetic algorithm for flowshop sequencing (Q1342312) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- A heuristic algorithm for mean flowtime objective in flowshop scheduling (Q1389189) (← links)
- Heuristic procedures for minimizing makespan and the number of required pallets (Q1390237) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- Improved genetic algorithm for the permutation flowshop scheduling problem. (Q1427101) (← links)
- Case study on statistically estimating minimum makespan for flow line scheduling problems. (Q1427564) (← links)
- Sequencing of jobs in some production system (Q1582040) (← links)