Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
From MaRDI portal
Recommendations
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
- A new approach to computing optimal schedules for the job-shop scheduling problem
- A new lower bound for the job-shop scheduling problem
- A Computational Study of the Job-Shop Scheduling Problem
- Lagrangian bounds for just-in-time job-shop scheduling
Cites work
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A large step random walk for minimizing total weighted tardiness in a job shop
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
- A user's guide to tabu search
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- An overview of heuristic solution methods
- Applying tabu search to the job-shop scheduling problem
- Decomposition methods for large job shops
- Effective neighbourhood functions for the flexible job shop problem
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- Heuristics for minimizing total weighted tardiness in complex job shops
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
- Job-shop scheduling with processing alternatives.
- Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Minimizing total weighted tardiness in a generalized job shop
- New single machine and job-shop scheduling problems with availability constraints
- On the application of insertion techniques for job shop problems with setup times
- Practical job shop scheduling
- Routing and scheduling in a flexible job shop by tabu search
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
- Scheduling algorithms
- Scheduling with batching: A review
- Scheduling with limited machine availability
- Tabu Search—Part I
- Tabu-search for the multi-mode job-shop problem
- The flow shop with parallel machines: A tabu search approach
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(6)- The job shop scheduling problem with convex costs
- A lower bound for the job insertion problem.
- Solving the serial batching problem in job shop manufacturing systems
- Lagrangian bounds for just-in-time job-shop scheduling
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
- Minimizing L max for large-scale, job-shop scheduling problems
This page was built for publication: Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011298)
