Multi-resource shop scheduling with resource flexibility
From MaRDI portal
Publication:1296087
DOI10.1016/S0377-2217(97)00341-XzbMath0943.90028OpenAlexW2061929703MaRDI QIDQ1296087
William Roux, Stéphane Dauzère-Pérès, Jean-Bernard Lasserre
Publication date: 11 July 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00341-x
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem, Feasible insertions in job shop scheduling, short cycles and stable sets, Optimization of the integrated problem of employee timetabling and job shop scheduling, Solving the flexible job shop scheduling problem with sequence-dependent setup times, Local search approaches for the test laboratory scheduling problem with variable task grouping, An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints, A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems, Insertion techniques for static and dynamic resource-constrained project scheduling., Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times, Job-shop scheduling with processing alternatives., Project scheduling with flexible resources: formulation and inequalities, Effective neighbourhood functions for the flexible job shop problem, Surgical case scheduling as a generalized job shop scheduling problem, Multiobjective optimization for complex flexible job-shop scheduling problems, A local search framework for industrial test laboratory scheduling, An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria, Mathematical models for job-shop scheduling problems with routing and process plan flexibility, A lower bound for the job insertion problem., Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP, Lot sizing and scheduling -- survey and extensions, A tabu search algorithm for scheduling pharmaceutical packaging operations, Activities planning and resources assignment on distinct places: a mathematical model, A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
Uses Software
Cites Work
- Job-shop scheduling with multi-purpose machines
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- A branch \(\&\) bound algorithm for the open-shop problem
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A hierarchical approach for the FMS scheduling problem
- A user's guide to tabu search
- Routing and scheduling in a flexible job shop by tabu search
- Job Shop Scheduling by Simulated Annealing
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations
