Permutation schedules for a two-machine flow shop with storage

DOI10.1016/j.orl.2015.12.012zbMath1408.90126OpenAlexW2216432406MaRDI QIDQ1785731

Joey Fung, Yakov Zinder

Publication date: 1 October 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.12.012

zbMATH Keywords

makespanflow shopbufferpermutation schedule

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

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 ⋮ 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 ⋮ 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

Cites Work

• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• Permutation vs. non-permutation flow shop schedules
• Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications
• Scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item