Pages that link to "Item:Q857354"
From MaRDI portal
The following pages link to Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354):
Displaying 16 items.
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← 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)
- 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)
- Multiple-objective scheduling and real-time dispatching for the semiconductor manufacturing system (Q955622) (← links)
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem (Q1043329) (← links)
- A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
- Rule-based scheduling in wafer fabrication with due date-based objectives (Q1761232) (← links)
- Integrating preventive maintenance planning and production scheduling under reentrant job shop (Q1993028) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem (Q2378080) (← links)
- Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem (Q6106559) (← links)