Benchmarks for basic scheduling problems

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

scientific article; zbMATH DE number 3815002 (Why is no real title available?)
scientific article; zbMATH DE number 3757695 (Why is no real title available?)
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
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)

The representation of partially-concurrent open shop problems
A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
An advanced tabu search algorithm for the job shop problem
A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
On some lower bounds for the permutation flowshop problem
Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
Permutation, no-wait, no-idle flow shop problems
On the heuristic solution of the permutation flow shop problem by path algorithms
A new lower bound for the job-shop scheduling problem
Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
A hybrid metaheuristic algorithm to optimise a real-world robotic cell
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
Genetic local search for multi-objective flowshop scheduling problems
Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
Permutation-induced acyclic networks for the job shop scheduling problem
The path-repair algorithm
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
Problem difficulty for tabu search in job-shop scheduling
A new particle swarm optimization for the open shop scheduling problem
A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
A genetic algorithm for scheduling open shops with sequence-dependent setup times
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
Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
The generalized shifting bottleneck procedure
On the open-shop problem with preemption and minimizing the average completion time
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production
Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
Scheduling in flowshops to minimize total tardiness of jobs
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
Makespan distribution of permutation flowshop schedules
A heuristic hybrid framework for vector job scheduling
Local search with constraint propagation and conflict-based heuristics
Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
An optimal constraint programming approach to the open-shop problem
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
Revisiting simulated annealing: a component-based analysis
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
The total completion time open shop scheduling problem with a given sequence of jobs on one machine
Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
Trade-off balancing in scheduling for flow shop production and perioperative processes
Permutation flow shop scheduling with earliness and tardiness penalties
Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty
Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions
Open shop cyclic scheduling
An ALNS to optimize makespan subject to total completion time for no-wait flow shops with sequence-dependent setup times
An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
Flow shop scheduling problem with position-dependent processing times
A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling
Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)
Synchronous flow shop scheduling with pliable jobs
\(N\)-NEH+ algorithm for solving permutation flow shop problems
New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
A scatter search algorithm for the distributed permutation flowshop scheduling problem
New hard benchmark for flowshop scheduling problems minimising makespan
Firefly-Inspired Algorithm for Job Shop Scheduling
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
Heuristics for scheduling with inventory: Dynamic focus via constraint criticality
Learning from planner performance
A review on integrated scheduling and outbound vehicle routing problems
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
An exact parallel method for a bi-objective permutation flowshop problem
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
Using solvable real time classes for jitter-minimized planning
On single-walk parallelization of the job shop problem solving algorithms
Parallel hybrid heuristics for the permutation flow shop problem
An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
A deep multi-agent reinforcement learning approach to solve dynamic job shop scheduling problem
A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
Ant colony optimization combined with taboo search for the job shop scheduling problem
Cooperative metaheuristics for the permutation flowshop scheduling problem
Hybrid simulated annealing with memory: an evolution-based diversification approach
Solving multi-objective production scheduling problems using metaheuristics
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
Simple heuristics for scheduling with limited intermediate storage

Describes a project that uses

Uses Software

JOBSHOP
OR-Library

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)