Pages that link to "Item:Q418093"
From MaRDI portal
The following pages link to A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093):
Displayed 24 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)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
- Importance of verifying queue model assumptions before planning with simulation software (Q439533) (← links)
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem (Q747040) (← links)
- A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← 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)
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria (Q2003434) (← links)
- Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
- Fair optimization and networks: a survey (Q2336590) (← links)
- On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming (Q2337226) (← links)
- The no-wait job shop with regular objective: a method based on optimal job insertion (Q2359802) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- Job-shop local-search move evaluation without direct consideration of the criterion's value (Q2629670) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems (Q2792203) (← links)
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems (Q6096569) (← links)
- Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem (Q6106559) (← links)
- Energy cost efficient scheduling in flexible job-shop manufacturing systems (Q6113446) (← links)