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

DOI10.1016/J.EJOR.2022.03.024MaRDI QIDQ2158014zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

schedulingpermutation schedulesconstant processing times

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

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

• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Flexible flow shop with dedicated buffers
• Flowshop scheduling with limited temporary storage
• On non-permutation solutions to some two machine flow shop scheduling problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Permutation schedules for a two-machine flow shop with storage
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• 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

Cited in

(5)

• 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
• The two-machine permutation flow shop with state-dependent processing times
• Impact of finite buffers on the optimal scheduling of a single-machine two-part-type manufacturing system
• Permutation schedules for a two-machine flow shop with storage

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)