Pages that link to "Item:Q1342314"
From MaRDI portal
The following pages link to A genetic algorithm for the job shop problem (Q1342314):
Displayed 34 items.
- A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan (Q865544) (← links)
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← 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)
- FMS scheduling based on timed Petri net model and reactive graph search (Q937986) (← links)
- Scheduling coordination problems in supply chain planning (Q940921) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
- A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
- Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- A genetic algorithm for multi-mode resource constrained project scheduling problem (Q1278080) (← links)
- RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions. (Q1406711) (← links)
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. (Q1410335) (← links)
- An efficient genetic algorithm for job shop scheduling with tardiness objectives. (Q1427583) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem (Q1885997) (← links)
- A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility (Q1909008) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem (Q2471233) (← links)
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops (Q2473277) (← links)
- A hybrid genetic algorithm for the job shop scheduling problem (Q2484343) (← links)
- A multiobjective evolutionary algorithm for scheduling and inspection planning in software development projects (Q2566703) (← links)
- Modelling and heuristics of FMS scheduling with multiple objectives (Q2566932) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
- Co-evolutionary genetic algorithm for multi-machine scheduling: Coping with high performance variability (Q4443376) (← links)
- A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling (Q4814097) (← links)
- A genetic algorithm-based approach to machine assignment problem (Q5466733) (← links)
- An effective hybrid optimization strategy for job-shop scheduling problems (Q5936137) (← links)
- Algorithmical approaches to business process design (Q5955965) (← links)