A two-machine permutation flow shop scheduling problem with buffers
From MaRDI portal
Recommendations
Cites work
- 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
- 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 scheduling with limited temporary storage
- Flowshop sequencing problems with limited buffer storage
- New results in the worst-case analysis for flow-shop scheduling
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Some efficient heuristic methods for the flow shop sequencing problem
- Tabu Search—Part I
- Tabu Search—Part II
Cited in
(22)- The permutation flow shop with buffers: A tabu search approach
- scientific article; zbMATH DE number 4209899 (Why is no real title available?)
- scientific article; zbMATH DE number 764416 (Why is no real title available?)
- Cyclic flow-shop scheduling with no-wait constraints and missing operations
- 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
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- The two-machine permutation flow shop with state-dependent processing times
- Flow-shop problems with intermediate buffers
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- Impact of finite buffers on the optimal scheduling of a single-machine two-part-type manufacturing system
- An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
- 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
- Job-shop scheduling with limited capacity buffers
- Permutation schedules for a two-machine flow shop with storage
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
- scientific article; zbMATH DE number 4076953 (Why is no real title available?)
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)
