Flow shop-sequencing problem with synchronous transfers and makespan minimization

From MaRDI portal
Revision as of 04:25, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5438669

DOI10.1080/00207540600621672zbMath1128.90502OpenAlexW2064741724MaRDI QIDQ5438669

Banu Soylu, ömer Kirca, Azizoglu, Meral

Publication date: 24 January 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600621672

zbMATH Keywords

schedulingbranch-and-boundmakespanflow shops


Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)


Related Items

Flow shop scheduling with flexible processing times, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, The assignment problem with nearly Monge arrays and incompatible partner indices, Solution algorithms for synchronous flow shop problems with two dominating machines, Open shop scheduling with synchronization, Decomposition algorithms for synchronous flow shop problems with additional resources and setup times, Analysis of flow shop scheduling anomalies, Synchronous flow shop scheduling with pliable jobs, Complexity results for flow shop problems with synchronous movement, The evolution of schematic representations of flow shop scheduling problems, Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5438669&oldid=20204785"
Powered by MediaWiki