Unrelated parallel machine scheduling using local search
From MaRDI portal
Recommendations
- A comparison of local search methods for flow shop scheduling
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
Cites work
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A new heuristic method for the flow shop sequencing problem
- Algorithms for Scheduling Tasks on Unrelated Processors
- An improved annealing scheme for the QAP
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Applying tabu search to the job-shop scheduling problem
- Approximation algorithms for scheduling unrelated parallel machines
- Convergence of an annealing algorithm
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Future paths for integer programming and links to artificial intelligence
- Genetic algorithms: Foundations and applications
- Genetic local search in combinatorial optimization
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Heuristics for scheduling unrelated parallel machines
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- Job Shop Scheduling by Simulated Annealing
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Simulated annealing: A tool for operational research
- Some efficient heuristic methods for the flow shop sequencing problem
- Tabu Search—Part I
- Tabu Search—Part II
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- The tabu search metaheuristic: How we used it
- Worst-case analysis of a scheduling algorithm
Cited in
(32)- The job shop scheduling problem: Conventional and new solution techniques
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
- Lexicographic local search and the \(p\)-center problem.
- The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
- Exploiting process plan flexibility in production scheduling: A multi-objective approach
- Workload balancing and loop layout in the design of a flexible manufacturing system
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- A comparison of local search methods for flow shop scheduling
- Metaheuristics: A bibliography
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Exact makespan minimization of unrelated parallel machines
- Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing
- A comparative study of solution representations for the unrelated machines environment
- Decomposition methods for the parallel machine scheduling problem with setups
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
- scientific article; zbMATH DE number 1054928 (Why is no real title available?)
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
- Unrelated parallel machine scheduling -- perspectives and progress
- Global Search Method for Parallel Machine Scheduling
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Scheduling unrelated parallel machines with sequence-dependent setups
- Iterated greedy local search methods for unrelated parallel machine scheduling
This page was built for publication: Unrelated parallel machine scheduling using local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341398)
