The following pages link to M. Y. Kovalyov (Q228023):
Displaying 50 items.
- Improving the complexities of approximation algorithms for optimization problems (Q1904613) (← links)
- Single machine batch scheduling with deadlines and resource dependent processing times (Q1924618) (← links)
- Soft due window assignment and scheduling of unit-time jobs on parallel machines (Q1935552) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation (Q2029277) (← links)
- Min-max controllable risk problems (Q2040608) (← links)
- Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
- Lot-size scheduling of a single product on unrelated parallel machines (Q2174901) (← links)
- Maximum diversity problem with squared Euclidean distance (Q2181789) (← links)
- Erratum to: ``Internet shopping with price-sensitive discounts'' (Q2257102) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity (Q2286437) (← links)
- Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) (Q2326400) (← links)
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem'' (Q2357384) (← links)
- Knapsack problem with objective value gaps (Q2361124) (← links)
- Optimal testing and repairing a failed series system (Q2369986) (← links)
- Comments on ``Proportionate flowshops with general position dependent processing times'' and ``Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection'' (Q2414034) (← links)
- Scheduling with controllable release dates and processing times: Makespan minimization (Q2433440) (← links)
- Scheduling with controllable release dates and processing times: total completion time minimization (Q2433441) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- Batch scheduling of deteriorating reworkables (Q2482803) (← links)
- Scheduling in a contaminated area: a model and polynomial algorithms (Q2491774) (← links)
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672) (← links)
- Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs (Q2510197) (← links)
- Batch scheduling and common due-date assignment on a single machine (Q2563922) (← links)
- Batching work and rework processes with limited deterioration of reworkables (Q2581601) (← links)
- Two faster algorithms for coordination of production and batch delivery: a note (Q2629739) (← links)
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines (Q2668758) (← links)
- Fleet and charging infrastructure decisions for fast-charging city electric bus service (Q2669545) (← links)
- (Q2712370) (← links)
- Minimizing total completion time on a batching machine with job processing time compatibilities (Q2861568) (← links)
- Batch Scheduling of Deteriorating Products (Q3011181) (← links)
- (Q3033547) (← links)
- (Q3123417) (← links)
- (Q3161287) (← links)
- Two-Agent Scheduling on an Unbounded Serial Batching Machine (Q3167645) (← links)
- An FPTAS for a supply scheduling problem with non-monotone cost functions (Q3169250) (← links)
- (Q3362479) (← links)
- (Q3417375) (← links)
- (Q3477568) (← links)
- Scheduling jobs in a contaminated area: a model and heuristic algorithms (Q3519368) (← links)
- Internet shopping optimization problem (Q3587068) (← links)
- Lot-Sizing and Sequencing on a Single Imperfect Machine (Q3627683) (← links)
- (Q3686512) (← links)
- The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets (Q3765559) (← links)
- (Q3783065) (← links)
- (Q3801579) (← links)
- (Q3973085) (← links)
- (Q4012342) (← links)