Pages that link to "Item:Q2783788"
From MaRDI portal
The following pages link to Guided Local Search with Shifting Bottleneck for Job Shop Scheduling (Q2783788):
Displaying 50 items.
- Dynamic resource allocation: a flexible and tractable modeling framework (Q299823) (← links)
- A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
- A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
- Scatter search with path relinking for the job shop with time lags and setup times (Q337556) (← links)
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective (Q342161) (← links)
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (Q342173) (← links)
- Heuristic approaches for scheduling jobs in large-scale flexible job shops (Q342300) (← links)
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
- A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
- A variable depth search branching (Q453047) (← links)
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
- Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- Control abstractions for local search (Q816678) (← links)
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities (Q835581) (← links)
- Job shop scheduling with setup times, deadlines and precedence constraints (Q835609) (← links)
- Nondeterministic control for hybrid search (Q857891) (← links)
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques (Q867431) (← links)
- On the representation of the one machine sequencing problem in the shifting bottleneck heuristic (Q879326) (← links)
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579) (← links)
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← 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)
- A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← 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)
- Heuristics for minimizing total weighted tardiness in flexible flow shops (Q1567299) (← links)
- Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
- A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes (Q1590036) (← links)
- A tabu search approach to machine scheduling (Q1609892) (← links)
- A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem (Q1652506) (← links)
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- A competent memetic algorithm for complex scheduling (Q1761722) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- An improved shifting bottleneck procedure for the job shop scheduling problem (Q1879795) (← 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)
- Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints (Q2270437) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- A probabilistic cooperative-competitive hierarchical model for global optimization (Q2493692) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
