Benchmarks for basic scheduling problems
From MaRDI portal
Recommendations
- Benchmarks for shop scheduling problems
- New hard benchmark for flowshop scheduling problems minimising makespan
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A computational study of the permutation flow shop problem based on a tight lower bound
- scientific article; zbMATH DE number 3854789
Cites work
- A Computational Study of the Job-Shop Scheduling Problem
- A new heuristic method for the flow shop sequencing problem
- An Algorithm for Solving the Job-Shop Problem
- Constructive heuristic algorithms for the open shop problem
- scientific article; zbMATH DE number 3815002 (Why is no real title available?)
- scientific article; zbMATH DE number 3757695 (Why is no real title available?)
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Tabu Search—Part I
Cited in
(only showing first 100 items - show all)- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- A genetic algorithm for flowshop scheduling with multiple objectives
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- An empirical analysis of the optimality rate of flow shop heuristics
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- The distributed permutation flowshop scheduling problem
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- An integrated tabu search algorithm for the lot streaming problem in job shops
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
- Two branch and bound algorithms for the permutation flow shop problem
- The job shop scheduling problem: Conventional and new solution techniques
- The generalized shifting bottleneck procedure
- A fast tabu search algorithm for the permutation flow-shop problem
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- Classical and new heuristics for the open-shop problem: A computational evaluation
- Some results of the worst-case analysis for flow shop scheduling
- A tabu search approach for the flow shop scheduling problem
- Benchmarks for shop scheduling problems
- Constructive heuristic algorithms for the open shop problem
- A genetic algorithm for flowshop sequencing
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
- A branch \(\&\) bound algorithm for the open-shop problem
- A tabu search algorithm for the open shop problem
- Job-shop scheduling with processing alternatives.
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An ant colony system for permutation flow-shop sequencing
- A hybrid genetic algorithm for the open shop scheduling problem
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine
- Local search with constraint propagation and conflict-based heuristics
- The permutation flow shop with buffers: A tabu search approach
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking
- Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
- Flow shop scheduling with flexible processing times
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- Trade-off balancing in scheduling for flow shop production and perioperative processes
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- A hybrid metaheuristic algorithm to optimise a real-world robotic cell
- An effective heuristic algorithm for the partial shop scheduling problem
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
- Revisiting simulated annealing: a component-based analysis
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
- Task scheduling in distributed real-time systems
- Open shop cyclic scheduling
- Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- On single-walk parallelization of the job shop problem solving algorithms
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- Parallel hybrid heuristics for the permutation flow shop problem
- An efficient local search for minimizing completion time variance in permutation flow shops
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- A comprehensive review and evaluation of permutation flowshop heuristics
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- Deterministic job-shop scheduling: Past, present and future
- Heuristics for permutation flow shop scheduling with batch setup times
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- A multipopulation cultural algorithm for the electrical generator scheduling problem
- An improved shifting bottleneck procedure for the job shop scheduling problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A neuro-tabu search heuristic for the flow shop scheduling problem
- Solving multi-objective production scheduling problems using metaheuristics
- A branch \& bound method for the general-shop problem with sequence dependent setup-times
- A comparison of local search methods for flow shop scheduling
- Local search methods for the flowshop scheduling problem with flowtime minimization
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
- Flowshop scheduling problem with parallel semi-lines and final synchronization operation
- Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- Dynamic programming approach for solving the open shop problem
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- Using solvable real time classes for jitter-minimized planning
- Iterative beam search algorithms for the permutation flowshop
- Cyclic flow-shop scheduling with no-wait constraints and missing operations
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
This page was built for publication: Benchmarks for basic scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366085)
