A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
From MaRDI portal
Publication:958450
DOI10.1016/j.cor.2008.01.002zbMath1162.90460OpenAlexW2017441403MaRDI QIDQ958450
Bertrand M. T. Lin, Jen-Shin Hong, Feng-Cheng Lin
Publication date: 4 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.01.002
Related Items (10)
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements ⋮ On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine ⋮ Flexible flow shop with dedicated buffers ⋮ Two-machine flow shop total tardiness scheduling problem with deteriorating jobs ⋮ An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine ⋮ Two-machine flow shops with an optimal permutation schedule under a storage constraint ⋮ Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications ⋮ A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements ⋮ Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements ⋮ Permutation schedules for a two-machine flow shop with storage
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for two-machine flow-shop sequencing with precedence constraints
- A two-machine permutation flow shop scheduling problem with buffers
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- Shop scheduling problems under precedence constraints
- Flow-shop problems with intermediate buffers
- Flow shop scheduling problems under machine-dependent precedence constraints
- The two-machine flow shop problem with arbitrary precedence relations
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Optimal two- and three-stage production schedules with setup times included
- Flowshop sequencing problems with limited buffer storage
- Sequencing to Minimize the Maximum Job Cost
- The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
- Sequencing with Series-Parallel Precedence Constraints
- Flowshop scheduling with limited temporary storage
- The Recognition of Series Parallel Digraphs
- Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
- TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
- Complexity of Scheduling under Precedence Constraints
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
