Pages that link to "Item:Q4363639"

The following pages link to A Fast Taboo Search Algorithm for the Job Shop Problem (Q4363639):

Displaying 50 items.

• A flow-based tabu search algorithm for the RCPSP with transfer times (Q280159) (← links)
• A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
• Path-relinking tabu search for the multi-objective flexible job shop scheduling problem (Q337004) (← 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)
• Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
• A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective (Q342161) (← links)
• An effective new island model genetic algorithm for job shop scheduling problem (Q342266) (← links)
• Multipath adaptive tabu search for a vehicle control problem (Q411085) (← links)
• A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
• Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
• Flow shop batching and scheduling with sequence-dependent setup times (Q490328) (← links)
• A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
• An agent-based parallel approach for the job shop scheduling problem with genetic algorithms (Q630749) (← links)
• Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
• Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
• The flexible blocking job shop with transfer and set-up times (Q719021) (← links)
• A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem (Q747040) (← links)
• Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
• Control abstractions for local search (Q816678) (← links)
• Maintaining longest paths incrementally (Q816679) (← links)
• A tabu search heuristic for the quay crane scheduling problem (Q835567) (← links)
• Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
• Nondeterministic control for hybrid search (Q857891) (← links)
• An effective architecture for learning and evolving flexible job-shop schedules (Q858446) (← 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)
• Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem (Q883910) (← links)
• A constraint-based local search backend for MiniZinc (Q890003) (← links)
• FMS scheduling based on timed Petri net model and reactive graph search (Q937986) (← 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)
• Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
• A new neighborhood and tabu search for the blocking job shop (Q967433) (← links)
• Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming (Q977004) (← 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)
• 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)
• A computational study of constraint satisfaction for multiple capacitated job shop scheduling (Q1266543) (← 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)
• A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
• A two-machine permutation flow shop scheduling problem with buffers (Q1286775) (← links)
• Unrelated parallel machine scheduling using local search (Q1341398) (← links)
• An alternative framework to Lagrangian relaxation approach for job shop scheduling. (Q1399595) (← links)