The following pages link to Evgeny R. Gafarov (Q367637):
Displayed 20 items.
- Single machine total tardiness maximization problems: complexity and algorithms (Q367638) (← links)
- A graphical approach to solve an investment optimization problem (Q483269) (← links)
- Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine (Q492474) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- Graphical method to solve combinatorial optimization problems (Q517329) (← links)
- Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491) (← links)
- Algorithms for some maximization scheduling problems on a single machine (Q612210) (← links)
- Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- Item:Q367637 (redirect page) (← links)
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine (Q827995) (← links)
- A hybrid algorithm for the single-machine total tardiness problem (Q954025) (← links)
- On project scheduling problem (Q1003084) (← links)
- Transformation of the network graph of scheduling problems with precedence constraints to a planar graph (Q1760920) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)
- A special case of the single-machine total tardiness problem is NP-hard (Q1946412) (← links)
- A note on the paper `Single machine scheduling problems with financial resource constraints: some complexity results and properties' by E.R. Gafarov et al. (Q1950246) (← links)
- On lower and upper bounds for single machine parallel batch scheduling (Q2091210) (← links)
- Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211) (← links)
- Two Dedicated Parallel Machines Scheduling Problem with Precedence Relations (Q5171821) (← links)