On the job rotation problem
From MaRDI portal
Publication:2467127
Recommendations
Cites work
- scientific article; zbMATH DE number 6118218 (Why is no real title available?)
- scientific article; zbMATH DE number 3906559 (Why is no real title available?)
- scientific article; zbMATH DE number 3786527 (Why is no real title available?)
- scientific article; zbMATH DE number 1277120 (Why is no real title available?)
- scientific article; zbMATH DE number 627763 (Why is no real title available?)
- scientific article; zbMATH DE number 1142299 (Why is no real title available?)
- scientific article; zbMATH DE number 5019906 (Why is no real title available?)
- Calculating essential terms of a characteristic maxpolynomial
- Finding all essential terms of a characteristic maxpolynomial.
- Linear and combinatorial optimization in ordered algebraic structures
- Max algebra and the linear assignment problem
- Minimax algebra and applications
- Network flows. Theory, algorithms, and applications.
- On the coefficients of the max-algebraic characteristic polynomial and equation
- On the linear assignment problem for special matrices
- Selected topics on assignment problems
- The characteristic maxpolynomial of a matrix
Cited in
(10)- Job rotation using the multi-period assignment model
- A methodology to create robust job rotation schedules
- The art and science of designing rotating schedules
- A market design approach to job rotation
- Designing rotation programs: limits and possibilities
- A quantitative method for determining proper job rotation intervals
- Tropical bounds for eigenvalues of matrices
- How many Boolean polynomials are irreducible?
- On two mechanisms in job rotation problems
- Reducing ergonomic risks by job rotation scheduling
This page was built for publication: On the job rotation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467127)