Approximation Algorithms for the Assembly Line Crew Scheduling Problem

DOI10.1287/MOOR.9.3.376MaRDI QIDQ3220332zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

approximation algorithmsassembly line crew schedulingassignmentedge matching algorithmheuristic proceduresmatrix permutationminimization of maximum row summultiprocessor schedulingNP-hardness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation algorithms for simple assembly line balancing problems
• A branch-and-bound algorithm for assembly line worker assignment and balancing problems
• Approximation algorithms for problems in scheduling with set-ups
• Approximation Algorithms for Fixed Job Schedule Problems
• Approximation algorithms for scheduling and packing problems
• scientific article; zbMATH DE number 4162637
• On approximating a scheduling problem
• scientific article; zbMATH DE number 1560337
• scientific article; zbMATH DE number 1418275
• Algorithms for real-time scheduling of jobs on mixed model assembly lines

Cited in

(19)

• Complexity of workforce scheduling in transfer lines
• Block rearranging elements within matrix columns to minimize the variability of the row sums
• Joint mixability of some integer matrices
• Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm
• Scheduling with a common due-window: polynomially solvable cases
• Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
• Stronger upper and lower bounds for a hard batching problem to feed assembly lines
• On the matrix permutation problem
• scientific article; zbMATH DE number 4059101 (Why is no real title available?)
• Approximating the multi-level bottleneck assignment problem
• A heuristic hybrid framework for vector job scheduling
• scientific article; zbMATH DE number 7387532 (Why is no real title available?)
• Algorithms for finding copulas minimizing convex functions of sums
• Minmax earliness-tardiness costs with unit processing time jobs
• Workface planning in synchronous production systems
• Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
• Negative dependence in matrix arrangement problems
• Improved block rearrangement algorithm
• On the approximability of train routing and the min-max disjoint paths problem

This page was built for publication: Approximation Algorithms for the Assembly Line Crew Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220332)