The following pages link to (Q4238569):
Displaying 39 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 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)
- Minimizing value-at-risk in single-machine scheduling (Q513548) (← 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)
- Optimal planning of a multi-station system with sojourn time constraints (Q817147) (← links)
- A tabu search heuristic for the quay crane scheduling problem (Q835567) (← links)
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities (Q835581) (← links)
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families (Q878578) (← links)
- Minimizing total weighted tardiness in a generalized job shop (Q880516) (← links)
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579) (← links)
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
- Heuristic factory planning algorithm for advanced planning and scheduling (Q1010253) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- Heuristics for minimizing total weighted tardiness in flexible flow shops (Q1567299) (← links)
- A large step random walk for minimizing total weighted tardiness in a job shop (Q1579121) (← links)
- Decomposition methods for large job shops (Q1592580) (← links)
- Semi-autonomous planning using linear programming in the Chilean General Treasury (Q1598785) (← links)
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977) (← 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)
- Executing production schedules in the face of uncertainties: a review and some future directions (Q1887777) (← links)
- On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming (Q2337226) (← 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)
- Applying machine based decomposition in 2-machine flow shops (Q2572846) (← links)
- Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints (Q2669504) (← links)
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
- Study on constraint scheduling algorithm for job shop problems with multiple constraint machines (Q3527958) (← links)
- Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042) (← links)
- Heuristics for minimizing total weighted tardiness in complex job shops (Q4681151) (← links)
