Pages that link to "Item:Q1342314"
From MaRDI portal
The following pages link to A genetic algorithm for the job shop problem (Q1342314):
Displaying 50 items.
- A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- An effective new island model genetic algorithm for job shop scheduling problem (Q342266) (← links)
- Mixed integer programming models for job shop scheduling: A computational analysis (Q342439) (← links)
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm (Q454950) (← links)
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms (Q630749) (← links)
- 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)
- Scheduling mixed-model production on multiple assembly lines with shared resources using genetic algorithms: the case study of a motorbike company (Q906292) (← 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)
- Risk measure of job shop scheduling with random machine breakdowns (Q1654341) (← 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)
- Modeling and algorithms of the crew rostering problem with given cycle on high-speed railway lines (Q1954542) (← links)
- A scheduling problem in the baking industry (Q2336885) (← links)
- A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)
- A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← 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)
- Optimizing makespan and stability risks in job shop scheduling (Q2664315) (← links)
- The application of genetic algorithms to lot streaming in a job-shop scheduling problem (Q3055438) (← links)
- Hybrid simulated annealing with memory: an evolution-based diversification approach (Q3163188) (← links)
- Scheduling semiconductor in-line steppers in new product/process introduction scenarios (Q3163705) (← 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)
- Scheduling of multiple in-line steppers for semiconductor wafer fabs (Q5172568) (← links)
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
- A genetic algorithm-based approach to machine assignment problem (Q5466733) (← links)
