Pages that link to "Item:Q2367003"
From MaRDI portal
The following pages link to Applying tabu search to the job-shop scheduling problem (Q2367003):
Displayed 50 items.
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results (Q814422) (← links)
- Control abstractions for local search (Q816678) (← links)
- Maintaining longest paths incrementally (Q816679) (← links)
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery (Q850302) (← links)
- Contraint-based combinators for local search (Q850450) (← links)
- Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
- A tabu search approach for scheduling hazmat shipments (Q856786) (← 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 tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
- FMS scheduling based on timed Petri net model and reactive graph search (Q937986) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
- Parallel and distributed local search in COMET (Q1010289) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- An integrated tabu search algorithm for the lot streaming problem in job shops (Q1042155) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem (Q1266629) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
- Unrelated parallel machine scheduling using local search (Q1341398) (← links)
- A genetic algorithm for the job shop problem (Q1342314) (← links)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- A tabu search algorithm for the open shop problem (Q1383321) (← links)
- Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
- An alternative framework to Lagrangian relaxation approach for job shop scheduling. (Q1399595) (← links)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- A repairing technique for the local search of the job-shop problem. (Q1417509) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- Heuristics for minimizing total weighted tardiness in flexible flow shops (Q1567299) (← links)
- A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
- A large step random walk for minimizing total weighted tardiness in a job shop (Q1579121) (← links)
- Efficiency of reductions of job-shop to flow-shop problems (Q1582031) (← links)
- A tabu search algorithm for scheduling a single robot in a job-shop environment (Q1602712) (← links)
- Solving the aerial fleet refueling problem using group theoretic tabu search (Q1767071) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- A lower bound for the job insertion problem. (Q1811122) (← links)
- Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects (Q1841162) (← links)
- Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
- Handling flexibility in a ``generalised job shop'' with a fuzzy approach (Q1869716) (← links)
- An improved shifting bottleneck procedure for the job shop scheduling problem (Q1879795) (← links)