Pages that link to "Item:Q4302714"
From MaRDI portal
The following pages link to A Computational Study of Local Search Algorithms for Job Shop Scheduling (Q4302714):
Displayed 42 items.
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) (Q686527) (← links)
- Maintaining longest paths incrementally (Q816679) (← links)
- Human-guided search (Q972653) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
- Genetic algorithms and traveling salesman problems (Q1268132) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- General local search methods (Q1268283) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- Benchmarks for shop scheduling problems (Q1296703) (← links)
- Simulated annealing for resource-constrained scheduling (Q1309982) (← links)
- Unrelated parallel machine scheduling using local search (Q1341398) (← links)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Look ahead job demanding for improving job shop performance (Q1374406) (← links)
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828) (← links)
- Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
- An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
- A large step random walk for minimizing total weighted tardiness in a job shop (Q1579121) (← links)
- Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
- Some new results on simulated annealing applied to the job shop scheduling problem (Q1806648) (← links)
- Job shop scheduling with beam search (Q1806850) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem (Q1885997) (← links)
- A generalized permutation approach to job shop scheduling with genetic algorithms (Q1908992) (← links)
- Improving local search heuristics for some scheduling problems. I (Q1917263) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
- A hybrid genetic algorithm for the job shop scheduling problem (Q2484343) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- Simulated annealing and genetic algorithms for scheduling products with multi-level product structure (Q2563875) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
- Production Control of a Flexible Manufacturing System in a Job Shop Environment (Q3842991) (← links)
- A genetic algorithm methodology for complex scheduling problems (Q4239710) (← links)
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
- Convergence of Simulated Annealing with Feedback Temperature Schedules (Q5488541) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)
- Improving local search heuristics for some scheduling problems. II (Q5961605) (← links)