On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
From MaRDI portal
Publication:2158014
DOI10.1016/J.EJOR.2022.03.024OpenAlexW4220869951WikidataQ114184312 ScholiaQ114184312MaRDI QIDQ2158014FDOQ2158014
Authors: Philine Geser, Hoang Thanh Le, Tom Hartmann, Martin Middendorf 
Publication date: 22 July 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.03.024
Recommendations
- Permutation schedules for a two-machine flow shop with storage
- Two-machine flow shops with an optimal permutation schedule under a storage constraint
- A two-machine permutation flow shop scheduling problem with buffers
- On non-permutation solutions to some two machine flow shop scheduling problems
- Permutation vs. non-permutation flow shop schedules
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Flowshop scheduling with limited temporary storage
- Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- On non-permutation solutions to some two machine flow shop scheduling problems
- Permutation schedules for a two-machine flow shop with storage
- Two-machine flow shops with an optimal permutation schedule under a storage constraint
- Flexible flow shop with dedicated buffers
Cited In (5)
- The two-machine permutation flow shop with state-dependent processing times
- Permutation schedules for a two-machine flow shop with storage
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- Impact of finite buffers on the optimal scheduling of a single-machine two-part-type manufacturing system
- An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
This page was built for publication: On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158014)
