Multi-resource shop scheduling with resource flexibility
From MaRDI portal
Publication:1296087
Recommendations
- Flow Shop Scheduling with Resource Flexibility
- Flow shop scheduling with partial resource flexibility
- Flexible job-shop scheduling problem under resource constraints
- Maximization of solution flexibility for robust shop scheduling
- scientific article; zbMATH DE number 3882186
- Shop scheduling problems with pliable jobs
- scientific article; zbMATH DE number 7722
- Optimal scheduling for flexible job shop operation
- General flow-shop scheduling with resource constraints
Cites work
- A branch \(\&\) bound algorithm for the open-shop problem
- A hierarchical approach for the FMS scheduling problem
- A user's guide to tabu search
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Job Shop Scheduling by Simulated Annealing
- Job-shop scheduling with multi-purpose machines
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations
- Routing and scheduling in a flexible job shop by tabu search
- Tabu search for the job-shop scheduling problem with multi-purpose machines
Cited in
(25)- Optimization of the integrated problem of employee timetabling and job shop scheduling
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
- Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling
- Local search approaches for the test laboratory scheduling problem with variable task grouping
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
- Surgical case scheduling as a generalized job shop scheduling problem
- Multiobjective optimization for complex flexible job-shop scheduling problems
- Project scheduling with flexible resources: formulation and inequalities
- Activities planning and resources assignment on distinct places: a mathematical model
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- A local search framework for industrial test laboratory scheduling
- Lot sizing and scheduling -- survey and extensions
- Job-shop scheduling with processing alternatives.
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
- A lower bound for the job insertion problem.
- An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- Feasible insertions in job shop scheduling, short cycles and stable sets
- A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
- Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- Reversible-shop scheduling
- Effective neighbourhood functions for the flexible job shop problem
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
This page was built for publication: Multi-resource shop scheduling with resource flexibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296087)
