Flow shop scheduling problems under machine-dependent precedence constraints
From MaRDI portal
Publication:1768595
DOI10.1023/B:JOCO.0000021935.66577.09zbMath1136.90349OpenAlexW1986041168MaRDI QIDQ1768595
Publication date: 15 March 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:joco.0000021935.66577.09
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage ⋮ Minimizing the makespan in a two-machine cross-docking flow shop problem
This page was built for publication: Flow shop scheduling problems under machine-dependent precedence constraints
