Pages that link to "Item:Q1579121"
From MaRDI portal
The following pages link to A large step random walk for minimizing total weighted tardiness in a job shop (Q1579121):
Displaying 22 items.
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective (Q342161) (← links)
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (Q342173) (← links)
- Heuristic approaches for scheduling jobs in large-scale flexible job shops (Q342300) (← links)
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
- A hybrid differential evolution and tree search algorithm for the job shop scheduling problem (Q410367) (← links)
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm (Q411034) (← links)
- A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem (Q747040) (← links)
- Minimizing total weighted tardiness in a generalized job shop (Q880516) (← links)
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- An efficient genetic algorithm for job shop scheduling with tardiness objectives. (Q1427583) (← links)
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- A linear programming-based method for job shop scheduling (Q2434310) (← links)
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem (Q2471233) (← links)
- An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem (Q5174415) (← links)
- Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling (Q6173707) (← links)