On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine

DOI10.1016/j.ejor.2022.03.024OpenAlexW4220869951WikidataQ114184312 ScholiaQ114184312MaRDI QIDQ2158014

Tom Hartmann, Hoang Thanh Le, Philine Geser, 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

zbMATH Keywords

schedulingpermutation schedulesconstant processing times

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• Permutation schedules for a two-machine flow shop with storage
• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
• Two-machine flow shops with an optimal permutation schedule under a storage constraint
• Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
• Flexible flow shop with dedicated buffers
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
• Flowshop scheduling with limited temporary storage
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On non-permutation solutions to some two machine flow shop scheduling problems
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem

This page was built for publication: On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine