An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
From MaRDI portal
Publication:1374441
DOI10.1023/A:1018930406487zbMATH Open0890.90097OpenAlexW159012016MaRDI QIDQ1374441FDOQ1374441
Stèphane Dauzère-Pérès, Jan Paulli
Publication date: 6 July 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018930406487
Recommendations
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- scientific article; zbMATH DE number 2221465
- Solving a job-shop scheduling problem based on a tabu search algorithm
- Tabu-search for the multi-mode job-shop problem
- Applying tabu search to the job-shop scheduling problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
- A tabu search approach for proportionate multiprocessor open shop scheduling
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- An integrated tabu search algorithm for the lot streaming problem in job shops
Cited In (70)
- Flexible job-shop scheduling problem under resource constraints
- Concurrent operations can be parallelized in scheduling multiprocessor job shop
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- A research survey: review of flexible job shop scheduling techniques
- Feasible insertions in job shop scheduling, short cycles and stable sets
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- Multiple machine JIT scheduling: a tabu search approach
- A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times
- A batch-oblivious approach for complex job-shop scheduling problems
- Metaheuristics for the online printing shop scheduling problem
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- Tabu-search for the multi-mode job-shop problem
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
- An integrated search heuristic for large-scale flexible job shop scheduling problems
- A taxonomy of flexible flow line scheduling procedures
- Theorem proving for pointwise metric temporal logic over the naturals via translations
- A simulated multi-objective model for flexible job shop transportation scheduling
- A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
- Job-shop scheduling with processing alternatives.
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- Genetic tabu search for the fuzzy flexible job shop problem
- Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times
- A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system
- A multi-objective production scheduling case study solved by simulated annealing
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- Energy cost efficient scheduling in flexible job-shop manufacturing systems
- Multi-resource shop scheduling with resource flexibility
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Double layer ACO algorithm for the multi-objective FJSSP
- A hierarchical approach for the FMS scheduling problem
- Tabu search for resource-constrained scheduling
- Flexible job shop scheduling with overlapping in operations
- Solving the serial batching problem in job shop manufacturing systems
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
- Multiobjective optimization for complex flexible job-shop scheduling problems
- Discrepancy search for the flexible job shop scheduling problem
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- A heuristic to schedule flexible job-shop in a glass factory
- A sequencing approach for creating new train timetables
- Effective neighbourhood functions for the flexible job shop problem
- Surgical case scheduling as a generalized job shop scheduling problem
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
- A lower bound for the job insertion problem.
- Local search algorithms for the multiprocessor flow shop scheduling problem
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
- Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
- A genetic algorithm for the flexible job-shop scheduling problem
- A disjunctive graph model and framework for constructing new train schedules
- An improved MOEA/D for multi-objective flexible job shop scheduling by considering efficiency and cost
- Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
- Solving a real-life multi-skill resource-constrained multi-project scheduling problem
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines
- Novel model and solution method for flexible job shop scheduling problem with batch processing machines
- Immersed NURBS for CFD Applications
- Adaptive multimeme algorithm for flexible job shop scheduling problem
- A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem
- Flexible job-shop scheduling with transportation resources
- Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
- Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem
- A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time
This page was built for publication: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374441)
