Pages that link to "Item:Q1607977"
From MaRDI portal
The following pages link to A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977):
Displayed 28 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 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)
- Scheduling algorithms for a semiconductor probing facility (Q609817) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities (Q835581) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← 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)
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- Multiple orders per job batch scheduling with incompatible jobs (Q940891) (← links)
- Column generation heuristics for multiple machine, multiple orders per job scheduling problems (Q940892) (← links)
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times (Q1781549) (← 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)
- A linear programming-based method for job shop scheduling (Q2434310) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Capacity requirements planning for twin Fabs of wafer fabrication (Q3055346) (← links)
- A dynamic WIP control strategy for bottlenecks in a wafer fabrication system (Q3163209) (← links)
- Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance (Q3163712) (← links)
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines (Q3636744) (← links)
- Heuristics for minimizing total weighted tardiness in complex job shops (Q4681151) (← links)
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times (Q5444602) (← links)