Pages that link to "Item:Q5690267"

The following pages link to Job Shop Scheduling by Local Search (Q5690267):

Displaying 50 items.

• Multi-objectivization via decomposition: an analysis of helper-objectives and complete decomposition (Q319106) (← links)
• Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
• A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
• A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
• Local adjustments: A general algorithm (Q707084) (← links)
• Analysis of the similarities and differences of job-based scheduling problems (Q723975) (← links)
• Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
• Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
• A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
• A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
• Scheduling the truckload operations in automatic warehouses (Q863986) (← links)
• An algorithm for the job shop scheduling problem based on global equilibrium search techniques (Q867431) (← links)
• Minimizing total weighted tardiness in a generalized job shop (Q880516) (← links)
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
• A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
• Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
• A filter-and-fan approach to the job shop scheduling problem (Q958547) (← links)
• Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
• An integrated tabu search algorithm for the lot streaming problem in job shops (Q1042155) (← links)
• An improved genetic algorithm for the distributed and flexible job-shop scheduling problem (Q1042492) (← links)
• A computational study of constraint satisfaction for multiple capacitated job shop scheduling (Q1266543) (← links)
• A search space analysis of the job shop scheduling problem (Q1290160) (← links)
• Some thoughts on combinatorial optimisation (Q1388818) (← links)
• Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
• A hierarchical approach for the FMS scheduling problem (Q1390190) (← links)
• A local search template. (Q1406708) (← links)
• A repairing technique for the local search of the job-shop problem. (Q1417509) (← 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)
• Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing (Q1584823) (← links)
• The flow shop with parallel machines: A tabu search approach (Q1609888) (← links)
• The job shop scheduling problem with convex costs (Q1754305) (← links)
• Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
• Job shop scheduling with beam search (Q1806850) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• Constraint satisfaction problems: Algorithms and applications (Q1809839) (← links)
• A lower bound for the job insertion problem. (Q1811122) (← links)
• Optimization of pitch sequencing for pneumatic tire by tabu search method (Q1859349) (← links)
• A knowledge-based evolutionary strategy for scheduling problems with bottlenecks (Q1869426) (← links)
• A novel threshold accepting meta-heuristic for the job-shop scheduling problem (Q1885997) (← links)
• Adaptive temperature control for simulated annealing: a comparative study (Q1886508) (← links)
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)
• Effective neighbourhood functions for the flexible job shop problem (Q1976516) (← links)
• Nested partitions for the large-scale extended job shop scheduling problem (Q2271832) (← links)
• An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
• Complexity of the job insertion problem in multi-stage scheduling (Q2467449) (← links)
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems (Q2475846) (← 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)