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:1018930406487zbMath0890.90097OpenAlexW159012016MaRDI QIDQ1374441
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
Related Items (64)
A variable neighbourhood search algorithm for the flexible job-shop scheduling problem ⋮ A disjunctive graph model and framework for constructing new train schedules ⋮ List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times ⋮ A simulated multi-objective model for flexible job shop transportation scheduling ⋮ Feasible insertions in job shop scheduling, short cycles and stable sets ⋮ An integrated search heuristic for large-scale flexible job shop scheduling problems ⋮ 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 ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ A multi-objective production scheduling case study solved by simulated annealing ⋮ Tabu-search for the multi-mode job-shop problem ⋮ A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times ⋮ A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem ⋮ Solving the serial batching problem in job shop manufacturing systems ⋮ Solving the flexible job shop scheduling problem with sequence-dependent setup times ⋮ An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ A hierarchical approach for the FMS scheduling problem ⋮ Immersed NURBS for CFD Applications ⋮ A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem ⋮ Novel model and solution method for flexible job shop scheduling problem with batch processing machines ⋮ Flexible job-shop scheduling with transportation resources ⋮ Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem ⋮ A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem ⋮ Energy cost efficient scheduling in flexible job-shop manufacturing systems ⋮ Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ A general approach for optimizing regular criteria in the job-shop scheduling problem ⋮ A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem ⋮ Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem ⋮ Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem ⋮ Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times ⋮ Adaptive multimeme algorithm for flexible job shop scheduling problem ⋮ Job-shop scheduling with processing alternatives. ⋮ An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems ⋮ Theorem proving for pointwise metric temporal logic over the naturals via translations ⋮ 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 novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems ⋮ A genetic 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 ⋮ Flexible job shop scheduling with overlapping in operations ⋮ A sequencing approach for creating new train timetables ⋮ A heuristic to schedule flexible job-shop in a glass factory ⋮ Mathematical models for job-shop scheduling problems with routing and process plan flexibility ⋮ Discrepancy search for the flexible job shop scheduling problem ⋮ Metaheuristics for the online printing shop scheduling problem ⋮ Double layer ACO algorithm for the multi-objective FJSSP ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ A research survey: review of flexible job shop scheduling techniques ⋮ A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system ⋮ A lower bound for the job insertion problem. ⋮ Flexible job-shop scheduling problem under resource constraints ⋮ An improved genetic algorithm for the distributed and flexible job-shop scheduling problem ⋮ Multi-resource shop scheduling with resource flexibility ⋮ Local search algorithms for the multiprocessor flow shop scheduling problem ⋮ Concurrent operations can be parallelized in scheduling multiprocessor job shop ⋮ Tabu search for resource-constrained scheduling
This page was built for publication: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
