Benchmarks for shop scheduling problems
From MaRDI portal
Recommendations
- Benchmarks for basic scheduling problems
- New hard benchmark for flowshop scheduling problems minimising makespan
- scientific article; zbMATH DE number 3854789
- A computational study of shifting bottleneck procedures for shop scheduling problems
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- A modified shifting bottleneck procedure for job-shop scheduling
- An Algorithm for Solving the Job-Shop Problem
- Benchmarks for basic scheduling problems
- Job Shop Scheduling by Simulated Annealing
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(36)- An advanced tabu search algorithm for the job shop problem
- Flow shop scheduling with reinforcement learning
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- Parallel metaheuristics: recent advances and new trends
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- New hard benchmark for flowshop scheduling problems minimising makespan
- An exact parallel method for a bi-objective permutation flowshop problem
- Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach
- Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling
- 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
- An effective heuristic algorithm for the partial shop scheduling problem
- Minimizing L max for large-scale, job-shop scheduling problems
- A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem
- Measures of subproblem criticality in decomposition algorithms for shop scheduling
- Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- On operators and search space topology in multi-objective flow shop scheduling
- Instance space analysis and algorithm selection for the job shop scheduling problem
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
- Energy cost efficient scheduling in flexible job-shop manufacturing systems
- Using dispatching rules for job shop scheduling with due date-based objectives
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Optimal scheduling for flexible job shop operation
- Deterministic job-shop scheduling: Past, present and future
- Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem
- An adapted constraint-programming formulation of the resource-constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
This page was built for publication: Benchmarks for shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296703)
