Benchmarks for basic scheduling problems

Related Items

Makespan distribution of permutation flowshop schedules, Learning from planner performance, A scatter search algorithm for the distributed permutation flowshop scheduling problem, New hard benchmark for flowshop scheduling problems minimising makespan, Clustered enhanced differential evolution for the blocking flow shop scheduling problem, New effective MILP models for PFSPs arising from real applications, MILP models for the optimization of real production lines, Permutation-induced acyclic networks for the job shop scheduling problem, Compiling finite linear CSP into SAT, Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem, Principles for the design of large neighborhood search, Refined ranking relations for selection of solutions in multi objective metaheuristics, Job-shop production scheduling with reverse flows, On heuristic solutions for the stochastic flowshop scheduling problem, A real-time order acceptance and scheduling approach for permutation flow shop problems, A multi-agent based cooperative approach to scheduling and routing, Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems, Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm, A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem, Optimizing blocking flow shop scheduling problem with total completion time criterion, An exact parallel method for a bi-objective permutation flowshop problem, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem, Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion, A new set of high-performing heuristics to minimise flowtime in permutation flowshops, Genetic tabu search for the fuzzy flexible job shop problem, Variability of completion time differences in permutation flow shop scheduling, Battery swap station location-routing problem with capacitated electric vehicles, A discrete inter-species cuckoo search for flowshop scheduling problems, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness, A generalized constructive algorithm using insertion-based heuristics, A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective, Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics, Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops, Mixed integer programming models for job shop scheduling: A computational analysis, New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem, A biased random key genetic algorithm for the field Technician scheduling problem, Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis), An algorithm for the job shop scheduling problem based on global equilibrium search techniques, On optimizing a bi-objective flowshop scheduling problem in an uncertain environment, Simple heuristics for scheduling with limited intermediate storage, Parallel partitioning method (PPM): A new exact method to solve bi-objective problems, Depth-first heuristic search for the job shop scheduling problem, On operators and search space topology in multi-objective flow shop scheduling, Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times, A discrete version of particle swarm optimization for flowshop scheduling problems, A cooperative hyper-heuristic search framework, A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms, Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, A general approach for optimizing regular criteria in the job-shop scheduling problem, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, Restart strategies in optimization: parallel and serial cases, An improved NEH-based heuristic for the permutation flowshop problem, Exact resolution of the two-stage hybrid flow shop with dedicated machines, Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems, OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises, Ant colony optimization combined with taboo search for the job shop scheduling problem, Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics, General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach, A proposal for a hybrid meta-strategy for combinatorial optimization problems, Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date, An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, Fitness landscape analysis for the no-wait flow-shop scheduling problem, On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems, Cooperative metaheuristics for the permutation flowshop scheduling problem, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, On the heuristic solution of the permutation flow shop problem by path algorithms, The museum visitor routing problem, Minimizing total weighted flow time of a set of jobs with interval processing times, On the open-shop problem with preemption and minimizing the average completion time, Setting a common due date in a constrained flowshop: a variable neighbourhood search approach, A parallel multiple reference point approach for multi-objective optimization, Solving job shop scheduling problems utilizing the properties of backbone and ``big valley, A library of local search heuristics for the vehicle routing problem, An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production, Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness, A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria, Synchronous flow shop scheduling with pliable jobs, Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems, Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness, A contribution and new heuristics for open shop scheduling, 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, Two branch and bound algorithms for the permutation flow shop problem, 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, Problem difficulty for tabu search in job-shop scheduling, Looking ahead with the pilot method, A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking, 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, An improved shifting bottleneck procedure for the job shop scheduling problem, Flow shop scheduling with flexible processing times, Constraint guided accelerated search for mixed blocking permutation flowshop scheduling, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Using solvable real time classes for jitter-minimized planning, A neuro-tabu search heuristic for the flow shop scheduling problem, Solving multi-objective production scheduling problems using metaheuristics, Trade-off balancing in scheduling for flow shop production and perioperative processes, A genetic algorithm for flowshop sequencing, Iterative beam search algorithms for the permutation flowshop, Cyclic flow-shop scheduling with no-wait constraints and missing operations, 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., An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, New efficient heuristics for scheduling open shops with makespan minimization, Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness, 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, A branch \(\&\) bound algorithm for the open-shop problem, A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates, \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance, A landscape-based analysis of fixed temperature and simulated annealing, A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times, A comparison of local search methods for flow shop scheduling, A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem, A tabu search algorithm for the open shop problem, Local search methods for the flowshop scheduling problem with flowtime minimization, A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times, A cutoff time strategy based on the coupon collector's problem, Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times, 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., Revisiting simulated annealing: a component-based analysis, Improved bounded dynamic programming algorithm for solving the blocking flow shop problem, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, An ant colony system for permutation flow-shop sequencing, 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, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, Efficient primal heuristic updates for the blocking job shop problem, Four decades of research on the open-shop scheduling problem to minimize the makespan, Task scheduling in distributed real-time systems, The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem, Open shop cyclic scheduling, Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem, 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, 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, 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, A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion, 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, Dynamic programming approach for solving the open shop problem, Deterministic job-shop scheduling: Past, present and future, The job shop scheduling problem: Conventional and new solution techniques, The generalized shifting bottleneck procedure, Heuristics for permutation flow shop scheduling with batch setup times, 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, Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning, A hybrid genetic algorithm for the open shop scheduling problem, Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the 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, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, A multipopulation cultural algorithm for the electrical generator scheduling problem, Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems, Constructive heuristic algorithms for the open shop problem, 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, Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling, A new lower bound for the job-shop scheduling problem, Hybrid simulated annealing with memory: an evolution-based diversification approach, A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling, Job-shop local-search move evaluation without direct consideration of the criterion's value, Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems, Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times, \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems, Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers, Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem, An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem, Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem, A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS, A very fast TS/SA algorithm for the job shop scheduling problem, Experimental comparison of heuristics for flow shop scheduling, Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search, Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, Schedule execution for two-machine flow-shop with interval processing times, The representation of partially-concurrent open shop problems, Unnamed Item, Accelerating the calculation of makespan used in scheduling improvement heuristics, \(N\)-NEH+ algorithm for solving permutation flow shop problems, New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems, Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion, Instance space analysis and algorithm selection for the job shop scheduling problem, Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective, Assembly flowshop scheduling problem: speed-up procedure and computational evaluation, MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem, A branch-and-cut approach for the distributed no-wait flowshop scheduling problem, A deep multi-agent reinforcement learning approach to solve dynamic job shop scheduling problem, On some lower bounds for the permutation flowshop problem, A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions, A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization, A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem, A review and classification on distributed permutation flowshop scheduling problems, Clingo goes linear constraints over reals and integers, Expansion-based hill-climbing, Partial neighborhood local searches, Evaluating the impact of grammar complexity in automatic algorithm design, Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness, An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions, Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem, A study on open shop scheduling to minimise total tardiness, Unnamed Item, A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem, Pareto optima for total weighted completion time and maximum lateness on a single machine, Minimizing makespan on an \(m\)-machine re-entrant flowshop, An advanced tabu search algorithm for the job shop problem, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem, An improved NEH heuristic to minimize makespan in permutation flow shops, Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments, Flow shop scheduling with heterogeneous workers, An effective new heuristic algorithm for solving permutation flow shop scheduling problem, A new particle swarm optimization for the open shop scheduling problem, Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments, Flexible process plans: their value in flexible automation systems, Comparison of heuristics for flowtime minimisation in permutation flowshops, A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, Solving the open shop scheduling problem, A simulation-based genetic algorithm for inventory optimization in a serial supply chain, Scheduling in flowshops to minimize total tardiness of jobs, A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness, Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers, Flow shop scheduling problem with position-dependent processing times, Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem, Scheduling job shop problems with sequence-dependent setup times, Permutation flow shop scheduling with earliness and tardiness penalties, P2P B&B and GA for the Flow-Shop Scheduling Problem, Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm, Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling, Train Scheduling with Hybrid Answer Set Programming, A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion, Flowshop-scheduling problems with makespan criterion: a review, An Optimal Constraint Programming Approach to the Open-Shop Problem, Mixed integer linear programming models for flow shop scheduling with a demand plan of job types, Permutation, no-wait, no-idle flow shop problems, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM, Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues, Forward Backward Transformation, Discrete Set Handling, A heuristic hybrid framework for vector job scheduling, Genetic local search for multi-objective flowshop scheduling problems, A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling, Some aspects of scatter search in the flow-shop problem, A genetic algorithm for scheduling open shops with sequence-dependent setup times, Unnamed Item, Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach, A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs, Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm, Complex Network Analysis of Discrete Self-organising Migrating Algorithm, An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine, An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents, Research trends in combinatorial optimization, An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time, Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates, Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization, Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users, Firefly-Inspired Algorithm for Job Shop Scheduling, A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan, A review on integrated scheduling and outbound vehicle routing problems, Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling, A memetic algorithm for restoring feasibility in scheduling with limited makespan, The seeds of the NEH algorithm: an overview using bibliometric analysis, A branch-and-bound approach to the no-idle flowshop scheduling problem

Uses Software

Cites Work