Improved bounded dynamic programming algorithm for solving the blocking flow shop problem

DOI10.1007/s10100-017-0488-5OpenAlexW2756095485MaRDI QIDQ1725819

Ansis Ozolins

Publication date: 15 February 2019

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-017-0488-5

zbMATH Keywords

schedulingblocking flow shopexact methodbounded dynamic programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (4)

CEJOR special issue: dynamic optimization in management and economics ⋮ Dynamic programming approach for solving the open shop problem ⋮ Special issue: engineering digital transformation ⋮ Mixed integer linear programming models for flow shop scheduling with a demand plan of job types

Cites Work

• Unnamed Item
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• Solving the job-shop scheduling problem optimally by dynamic programming
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
• A genetic algorithm for flowshop sequencing
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming
• Benchmarks for basic scheduling problems
• Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
• Flowshop scheduling with limited temporary storage
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Improved bounded dynamic programming algorithm for solving the blocking flow shop problem