The Shifting Bottleneck Procedure for Job Shop Scheduling
From MaRDI portal
Recommendations
- Practical job shop scheduling
- The generalized shifting bottleneck procedure
- Job shop scheduling with setup times, deadlines and precedence constraints
- A computational study of shifting bottleneck procedures for shop scheduling problems
- An improved shifting bottleneck procedure for the job shop scheduling problem
Cited in
(only showing first 100 items - show all)- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
- Hybrid rollout approaches for the job shop scheduling problem
- Scheduling trains as a blocking parallel-machine job shop scheduling problem
- An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances
- An integrated tabu search algorithm for the lot streaming problem in job shops
- A procedure for the one-machine sequencing problem with dependent jobs
- A time indexed formulation of non-preemptive single machine scheduling problems
- One-machine rescheduling heuristics with efficiency and stability as criteria
- Extending the shifting bottleneck procedure to real-life applications
- A neural network model for scheduling problems
- The job shop scheduling problem: Conventional and new solution techniques
- The generalized shifting bottleneck procedure
- The life span method -- a new variant of local search
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- Benchmarks for shop scheduling problems
- Deterministic job-shop scheduling problems with capacity focus
- Cellular control of manufacturing systems
- The job shop tardiness problem: A decomposition approach
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- A branch and bound algorithm for the job-shop scheduling problem
- Preemptive scheduling with release dates, delivery times and sequence independent setup times
- Integration of lotsizing and scheduling decisions in a job-shop
- A decomposition approach for a resource constrained scheduling problem
- The job-shop problem and immediate selection
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
- Adjustment of heads and tails for the job-shop problem
- A decision support system for the resource constrained project scheduling problem
- A decomposition approach in a DSS for a resource constrained scheduling problem
- A genetic algorithm for the job shop problem
- Evolution based learning in a job shop scheduling environment
- Effective job shop scheduling through active chain manipulation
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
- A fast finite loading algorithm for job oriented scheduling
- Tabu-search for the multi-mode job-shop problem
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound.
- Augmented neural networks for task scheduling.
- Job-shop scheduling with processing alternatives.
- An experimental analysis of local minima to improve neighbourhood search.
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- Heuristics for minimizing total weighted tardiness in flexible flow shops
- A hybrid genetic algorithm for the open shop scheduling problem
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- Efficiency of reductions of job-shop to flow-shop problems
- Decomposition methods for large job shops
- Concurrent operations can be parallelized in scheduling multiprocessor job shop
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Minimizing makespan on parallel machines subject to release dates and delivery times
- A tabu search approach to machine scheduling
- An exact approach for the 0-1 knapsack problem with setups
- A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem
- Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems
- A batch-oblivious approach for complex job-shop scheduling problems
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- The job shop scheduling problem with convex costs
- Rule-based scheduling in wafer fabrication with due date-based objectives
- A competent memetic algorithm for complex scheduling
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Project scheduling under uncertainty: survey and research potentials
- Maximization of solution flexibility for robust shop scheduling
- Optimal timing of a sequence of tasks with general completion costs
- Insertion techniques for the heuristic solution of the job shop problem
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Job shop scheduling with beam search
- Deterministic job-shop scheduling: Past, present and future
- A lower bound for the job insertion problem.
- An extended enterprise planning methodology for the discrete manufacturing industry
- Job-shop scheduling with blocking and no-wait constraints
- On the drift of short schedules.
- An improved shifting bottleneck procedure for the job shop scheduling problem
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem
- Adaptive temperature control for simulated annealing: a comparative study
- Executing production schedules in the face of uncertainties: a review and some future directions
- Reducing simulation models for scheduling manufacturing facilities
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
- A sequencing problem with family setup times
- A branch \& bound method for the general-shop problem with sequence dependent setup-times
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- A survey of scheduling with parallel batch (p-batch) processing
- A simulated multi-objective model for flexible job shop transportation scheduling
- Efficient primal heuristic updates for the blocking job shop problem
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A theoretic and practical framework for scheduling in a stochastic environment
- Nested partitions for the large-scale extended job shop scheduling problem
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
- A scheduling problem in the baking industry
- On mathematical programming with indicator constraints
- A multi-objective memetic algorithm for the job-shop scheduling problem
- A new lower bound for the job-shop scheduling problem
- Benchmarks for basic scheduling problems
- A tabu search experience in production scheduling
- Routing and scheduling in a flexible job shop by tabu search
- Applying tabu search to the job-shop scheduling problem
- Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time
This page was built for publication: The Shifting Bottleneck Procedure for Job Shop Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778528)
