Pages that link to "Item:Q4022914"
From MaRDI portal
The following pages link to New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling (Q4022914):
Displaying 50 items.
- Multi-objectivization via decomposition: an analysis of helper-objectives and complete decomposition (Q319106) (← links)
- A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
- A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem (Q604936) (← links)
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness (Q613514) (← links)
- Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
- Scheduling with tool changes to minimize total completion time under controllable machining conditions (Q868153) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- Efficient algorithms for machine scheduling problems with earliness and tardiness penalties (Q940876) (← links)
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
- A new neighborhood and tabu search for the blocking job shop (Q967433) (← links)
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
- One-machine rescheduling heuristics with efficiency and stability as criteria (Q1201849) (← links)
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation (Q1266547) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- PSPLIB -- a project scheduling problem library (Q1278481) (← links)
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem (Q1290704) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- Benchmarks for shop scheduling problems (Q1296703) (← links)
- Unrelated parallel machine scheduling using local search (Q1341398) (← links)
- Genetically improved presequences for Euclidean traveling salesman problems (Q1341408) (← links)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Resource-constrained project scheduling: A critical activity reordering heuristic (Q1399574) (← links)
- Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
- An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
- An efficient genetic algorithm for job shop scheduling with tardiness objectives. (Q1427583) (← links)
- Efficiency of reductions of job-shop to flow-shop problems (Q1582031) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
- On single-walk parallelization of the job shop problem solving algorithms (Q1761161) (← links)
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
- Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation (Q1774625) (← 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)
- An extended enterprise planning methodology for the discrete manufacturing industry (Q1840855) (← links)
- Scheduling flexible flow lines with sequence-dependent setup times (Q1876159) (← links)
- An improved shifting bottleneck procedure for the job shop scheduling problem (Q1879795) (← links)
- 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)
