Approximation Algorithms for the Assembly Line Crew Scheduling Problem
From MaRDI portal
Publication:3220332
DOI10.1287/moor.9.3.376zbMath0555.90054OpenAlexW2031018952MaRDI QIDQ3220332
No author found.
Publication date: 1984
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.9.3.376
multiprocessor schedulingassignmentapproximation algorithmsNP-hardnessmatrix permutationheuristic proceduresassembly line crew schedulingedge matching algorithmminimization of maximum row sum
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (11)
On the matrix permutation problem ⋮ Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations ⋮ Unnamed Item ⋮ Approximating the multi-level bottleneck assignment problem ⋮ Block rearranging elements within matrix columns to minimize the variability of the row sums ⋮ Joint mixability of some integer matrices ⋮ Minmax earliness-tardiness costs with unit processing time jobs ⋮ Scheduling with a common due-window: polynomially solvable cases ⋮ Workface planning in synchronous production systems ⋮ A heuristic hybrid framework for vector job scheduling ⋮ Algorithms for Finding Copulas Minimizing Convex Functions of Sums
This page was built for publication: Approximation Algorithms for the Assembly Line Crew Scheduling Problem
