Benchmarks for shop scheduling problems

DOI10.1016/S0377-2217(97)00019-2zbMath0951.90022OpenAlexW2002692271MaRDI QIDQ1296703

Ebru Demirkol, Reha Uzsoy, Sanjay Mehta

Publication date: 2 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00019-2

zbMATH Keywords

schedulingcombinatorial optimizationbenchmarks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (35)

Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ New hard benchmark for flowshop scheduling problems minimising makespan ⋮ Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem ⋮ Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ Allocating job-shop manpower to minimize \(L_{\max}\): optimality criteria, search heuristics, and probabilistic quality metrics ⋮ An exact parallel method for a bi-objective permutation flowshop problem ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ An effective lower bound on \(L_{\max}\) in a worker-constrained job shop ⋮ 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 ⋮ An algorithm for the job shop scheduling problem based on global equilibrium search techniques ⋮ On operators and search space topology in multi-objective flow shop scheduling ⋮ A discrete version of particle swarm optimization for flowshop scheduling problems ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem ⋮ Instance space analysis and algorithm selection for the job shop scheduling problem ⋮ A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem ⋮ Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach ⋮ Energy cost efficient scheduling in flexible job-shop manufacturing systems ⋮ A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem ⋮ Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis ⋮ Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling ⋮ An advanced tabu search algorithm for the job shop problem ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ Parallel metaheuristics: recent advances and new trends ⋮ Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments ⋮ Minimizing L _max for large-scale, job-shop scheduling problems ⋮ Solving job shop scheduling problems utilizing the properties of backbone and ``big valley ⋮ Using dispatching rules for job shop scheduling with due date-based objectives ⋮ Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm ⋮ Optimal scheduling for flexible job shop operation ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Measures of subproblem criticality in decomposition algorithms for shop scheduling ⋮ FLOW SHOP SCHEDULING WITH REINFORCEMENT LEARNING

Uses Software

• JOBSHOP

Cites Work

• Unnamed Item
• Unnamed Item
• Benchmarks for basic scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Job Shop Scheduling by Simulated Annealing
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• A modified shifting bottleneck procedure for job-shop scheduling
• Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

This page was built for publication: Benchmarks for shop scheduling problems