Pages that link to "Item:Q3778528"
From MaRDI portal
The following pages link to The Shifting Bottleneck Procedure for Job Shop Scheduling (Q3778528):
Displaying 50 items.
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm (Q260652) (← links)
- Dynamic resource allocation: a flexible and tractable modeling framework (Q299823) (← links)
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
- Multi-objectivization via decomposition: an analysis of helper-objectives and complete decomposition (Q319106) (← links)
- A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
- A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
- An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← 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)
- An effective new island model genetic algorithm for job shop scheduling problem (Q342266) (← links)
- Heuristic approaches for scheduling jobs in large-scale flexible job shops (Q342300) (← links)
- A bi-objective approach for scheduling ground-handling vehicles in airports (Q342334) (← links)
- Mixed integer programming models for job shop scheduling: A computational analysis (Q342439) (← links)
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm (Q454950) (← links)
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Scheduling algorithms for a semiconductor probing facility (Q609817) (← links)
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms (Q622140) (← links)
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms (Q630749) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis (Q817121) (← links)
- A robust approach for the single machine scheduling problem (Q835547) (← links)
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities (Q835581) (← links)
- Job shop scheduling with setup times, deadlines and precedence constraints (Q835609) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Principles for the design of large neighborhood search (Q846169) (← 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)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246) (← links)
- On the representation of the one machine sequencing problem in the shifting bottleneck heuristic (Q879326) (← links)
- New single machine and job-shop scheduling problems with availability constraints (Q880500) (← 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)
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
- Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem (Q883910) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- Scheduling coordination problems in supply chain planning (Q940921) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
- An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
