Flowshop sequencing problems with limited buffer storage

DOI10.1080/00207549008942855zbMath0707.90054OpenAlexW2046140730MaRDI QIDQ3489782

Rainer Leisten

Publication date: 1990

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549008942855

zbMATH Keywords

heuristicsSequencingflowshop sequencinglimited buffer storage

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (34)

Job-shop scheduling with limited capacity buffers ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ Simple heuristics for scheduling with limited intermediate storage ⋮ Hybrid variable neighborhood search for automated warehouse scheduling ⋮ Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness ⋮ A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ Flow shop scheduling with heterogeneous workers ⋮ Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion ⋮ A three-phase algorithm for flowshop scheduling with blocking to minimize makespan ⋮ Scheduling flexible flow lines with no in-process buffers ⋮ An effective hybrid genetic algorithm for flow shop scheduling with limited buffers ⋮ Scheduling in flowshops to minimize total tardiness of jobs ⋮ An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ A study on the performance of scheduling rules in buffer-constrained dynamic flowshops ⋮ A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE ⋮ Heuristic for scheduling in a Kanban system with dual blocking mechanisms ⋮ A two-machine permutation flow shop scheduling problem with buffers ⋮ A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems ⋮ A note of using effective immune based approach for the flow shop scheduling with buffers ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time ⋮ Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1 ⋮ The permutation flow shop with buffers: A tabu search approach ⋮ A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking

Cites Work

• New directions in scheduling theory
• An adaptive branching rule for the permutation flow-shop problem
• Optimal two- and three-stage production schedules with setup times included
• A survey and evaluation of static flowshop scheduling heuristics
• Flowshop scheduling with limited temporary storage
• Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
• Note—Sequencing with Finite Intermediate Storage
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†

This page was built for publication: Flowshop sequencing problems with limited buffer storage