Pages that link to "Item:Q865749"
From MaRDI portal
The following pages link to Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749):
Displayed 14 items.
- Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- The cyclical scheduling problem (Q744050) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm (Q2514834) (← links)
- Group control for consent rules with consecutive qualifications (Q2682019) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- Solution approaches to large shift scheduling problems (Q3539809) (← links)