A two-machine permutation flow shop scheduling problem with buffers

DOI10.1007/BF01539740zbMATH Open0917.90201OpenAlexW2030527516MaRDI QIDQ1286775FDOQ1286775

Authors: 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

Recommendations

• The permutation flow shop with buffers: A tabu search approach
• Flow-shop problems with intermediate buffers
• Permutation schedules for a two-machine flow shop with storage
• A fast tabu search algorithm for the permutation flow-shop problem
• The flow shop with parallel machines: A tabu search approach

zbMATH Keywords

heuristicsschedulingjust-in-timetabu searchflexible manufacturing systemstwo-machine flow-shopbufferminimum makespantwo-machine permutation flow-shop

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (22)

• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
• Title not available (Why is that?)
• Job-shop scheduling with limited capacity buffers
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• Title not available (Why is that?)
• Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
• Cyclic flow-shop scheduling with no-wait constraints and missing operations
• The two-machine permutation flow shop with state-dependent processing times
• Permutation schedules for a two-machine flow shop with storage
• An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
• The evolution of schematic representations of flow shop scheduling problems
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
• An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
• Impact of finite buffers on the optimal scheduling of a single-machine two-part-type manufacturing system
• Title not available (Why is that?)
• The permutation flow shop with buffers: A tabu search approach
• An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
• Flow-shop problems with intermediate buffers

Uses Software

• Tabu search

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

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