Pages that link to "Item:Q1806648"
From MaRDI portal
The following pages link to Some new results on simulated annealing applied to the job shop scheduling problem (Q1806648):
Displaying 27 items.
- A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
- A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems (Q626658) (← links)
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms (Q630749) (← links)
- Double layer ACO algorithm for the multi-objective FJSSP (Q732169) (← links)
- An effective architecture for learning and evolving flexible job-shop schedules (Q858446) (← links)
- Scheduling the truckload operations in automatic warehouses (Q863986) (← links)
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. (Q1410335) (← links)
- An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks (Q1869426) (← links)
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem (Q1885997) (← links)
- Parallel machine scheduling models with fuzzy processing times (Q1886763) (← links)
- Simplifying dispatching rules in genetic programming for dynamic job shop scheduling (Q2163788) (← links)
- A sequencing approach for creating new train timetables (Q2267382) (← links)
- Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems (Q2792203) (← links)
- Analysing stability and investments in railway networks using advanced evolutionary algorithms (Q3158002) (← links)
- Hybrid simulated annealing with memory: an evolution-based diversification approach (Q3163188) (← links)
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (Q3430250) (← links)
- Multiple colony ant algorithm for job-shop scheduling problem (Q3518511) (← links)
- A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS (Q3573666) (← links)
- SOLVING A MULTI-OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH TIMED PETRI NETS AND GENETIC ALGORITHM (Q3575380) (← links)
- A multi-echelon integrated JIT inventory model using the time buffer and emergency borrowing policies to deal with random delivery lead times (Q4474667) (← links)
- Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351) (← links)
- A new hybrid parallel genetic algorithm for the job‐shop scheduling problem (Q4980005) (← links)
- Algorithmical approaches to business process design (Q5955965) (← links)
