Scheduling a single server in a two-machine flow shop
From MaRDI portal
Publication:424733
DOI10.1007/s00607-002-1467-8zbMath1239.90047OpenAlexW2035406304MaRDI QIDQ424733
Mikhail Y. Kovalyov, Cheng, T. C. Edwin
Publication date: 4 June 2012
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-002-1467-8
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Scheduling jobs with equal processing times and a single server on parallel identical machines, Unrelated parallel machine scheduling with new criteria: complexity and models, A survey of scheduling problems with setup times or costs, Minimizing flowtime for paired tasks, Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic, Parallel Machine Scheduling with a Single Server: Loading and Unloading, Single-server parallel-machine scheduling with loading and unloading times
