Pages that link to "Item:Q1427583"
From MaRDI portal
The following pages link to An efficient genetic algorithm for job shop scheduling with tardiness objectives. (Q1427583):
Displaying 20 items.
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
- A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- Double layer ACO algorithm for the multi-objective FJSSP (Q732169) (← links)
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem (Q747040) (← links)
- Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory (Q857327) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
- Order acceptance using genetic algorithms (Q1000954) (← links)
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
- A new hybrid genetic algorithm for job shop scheduling problem (Q1761165) (← links)
- A sequencing approach for creating new train timetables (Q2267382) (← links)
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times (Q2378452) (← links)
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem (Q2471233) (← links)
- A scatter search approach to sequence-dependent setup times job shop scheduling (Q3055324) (← links)
- Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling (Q3498906) (← links)
- A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS (Q3573666) (← links)
- A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES (Q3636499) (← links)
- Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling (Q5712093) (← links)
