A two-machine permutation flow shop scheduling problem with buffers

DOI10.1007/BF01539740zbMath0917.90201OpenAlexW2030527516MaRDI QIDQ1286775

Czesław Smutnicki

Publication date: 29 April 1999

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01539740

zbMATH Keywords

heuristicsflexible manufacturing systemsschedulingtabu searchjust-in-timebuffertwo-machine flow-shopminimum makespantwo-machine permutation flow-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (12)

Cyclic flow-shop scheduling with no-wait constraints and missing operations ⋮ Job-shop scheduling with limited capacity buffers ⋮ 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 ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited 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 ⋮ Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion ⋮ An effective hybrid genetic algorithm for flow shop scheduling with limited buffers ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times ⋮ The permutation flow shop with buffers: A tabu search approach

Uses Software

• Tabu search

Cites Work

• New results in the worst-case analysis for flow-shop scheduling
• Some efficient heuristic methods for the flow shop sequencing problem
• A block approach for single-machine scheduling with release dates and due dates
• A fast tabu search algorithm for the permutation flow-shop problem
• Flowshop sequencing problems with limited buffer storage
• On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
• Flowshop scheduling with limited temporary storage
• Tabu Search—Part I
• Tabu Search—Part II
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: A two-machine permutation flow shop scheduling problem with buffers