Pages that link to "Item:Q3760291"
From MaRDI portal
The following pages link to Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions (Q3760291):
Displaying 13 items.
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- Scheduling problems with partially ordered jobs (Q612206) (← links)
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results (Q744660) (← links)
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- Single machine scheduling with precedence constraints and positionally dependent processing times (Q1762097) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
- Methods for optimum and near optimum disassembly sequencing (Q3498871) (← links)
- Optimal Consecutive-k-out-of-n:F Component Sequencing (Q3698029) (← links)
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms (Q3750504) (← links)
- A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem (Q5870371) (← links)
