Parallel shifting bottleneck algorithms for non-permutation flow shop scheduling

DOI10.1007/S10479-024-06329-2MaRDI QIDQ7030996zbMATH OpenFDO

Authors Hossein Badri, Tayebeh Bahreini, D. Grosu

Publication date 7 February 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-024-06329-2

zbMATH Keywords

flow shop schedulingparallel algorithmshifting bottleneck heuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A computational study of shifting bottleneck procedures for shop scheduling problems
• A fast tabu search algorithm for the permutation flow-shop problem
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A modified shifting bottleneck procedure for job-shop scheduling
• A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
• A rollout metaheuristic for job shop scheduling problems
• An approximation algorithm for a single-machine scheduling problem with release times and delivery times
• An improved shifting bottleneck procedure for the job shop scheduling problem
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
• Benchmarks for basic scheduling problems
• Deterministic job-shop scheduling: Past, present and future
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
• On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost
• Optimal two- and three-stage production schedules with set-up time included
• Scheduling. Theory, algorithms, and systems
• The Complexity of Flowshop and Jobshop Scheduling
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• The one-machine sequencing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling

This page was built for publication: Parallel shifting bottleneck algorithms for non-permutation flow shop scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030996)