Pages that link to "Item:Q4022914"

The following pages link to New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling (Q4022914):

Displaying 50 items.

• A backward approach in list scheduling algorithms for multi-machine tardiness problems (Q1891242) (← links)
• A generalized permutation approach to job shop scheduling with genetic algorithms (Q1908992) (← links)
• Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling (Q1909005) (← links)
• Problem space local search for number partitioning (Q1919856) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
• A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)
• The no-wait job shop with regular objective: a method based on optimal job insertion (Q2359802) (← links)
• A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
• Optimal job insertion in the no-wait job shop (Q2392741) (← links)
• Algorithms for single machine total tardiness scheduling with sequence dependent setups (Q2433437) (← links)
• A review of the joint replenishment problem literature: 1989--2005 (Q2462102) (← links)
• An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem (Q2471233) (← links)
• No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
• Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
• Job-shop local-search move evaluation without direct consideration of the criterion's value (Q2629670) (← links)
• Instance space analysis and algorithm selection for the job shop scheduling problem (Q2669728) (← links)
• Sequencing via explanation-based learning (Q2708079) (← links)
• Ant colony optimisation with parameterised search space for the job shop scheduling problem (Q3163736) (← links)
• An adaptive scheduling algorithm for a parallel machine problem with rework processes (Q3163785) (← links)
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
• CONFLICT IDENTIFICATION AND RECONCILIATION IN A COLLABORATIVE MANUFACTURING SCHEDULING TASK (Q3528987) (← links)
• IMPERFECT COORDINATION IN OPTIMIZATION (Q3636399) (← links)
• A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES (Q3636499) (← links)
• A genetic algorithm methodology for complex scheduling problems (Q4239710) (← links)
• A game-theoretic control approach for job shops in the presence of disruptions (Q4394284) (← links)
• A genetic algorithm approach to curve fitting (Q4399020) (← links)
• Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042) (← links)
• Case-based reasoning and improved adaptive search for project scheduling (Q4487088) (← links)
• An advanced scatter search algorithm for solving job shops with sequence dependent and non-anticipatory setups (Q4589091) (← links)
• Models and algorithms for the dynamic-demand joint replenishment problem (Q4671273) (← links)
• Problem and Heuristic Space Search Strategies for Job Shop Scheduling (Q4869760) (← links)
• A new hybrid parallel genetic algorithm for the job‐shop scheduling problem (Q4980005) (← links)
• A heuristic hybrid framework for vector job scheduling (Q4987672) (← links)
• (Q5020564) (← links)
• Auction-based approach for a flexible job-shop scheduling problem with multiple process plans (Q5059253) (← links)
• (Q5206679) (← links)
• (Q5287167) (← links)
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
• Due date and cost-based FMS loading, scheduling and tool management (Q5444486) (← links)
• Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)
• A new dominance rule to minimize total weighted tardiness with unequal release dates. (Q5952443) (← links)
• Fast parallel heuristics for the job shop scheduling problem (Q5955476) (← links)
• Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint (Q6094840) (← links)
• A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources (Q6106766) (← links)
• Firefly-Inspired Algorithm for Job Shop Scheduling (Q6163642) (← links)
• Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem (Q6189811) (← links)