The following pages link to Mikhail Y. Kovalyov (Q228023):
Displayed 50 items.
- Batch scheduling with deadlines on parallel machines: an NP-hard case (Q287238) (← links)
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Strong NP-hardness of scheduling problems with learning or aging effect (Q363599) (← links)
- Complexity of buffer capacity allocation problems for production lines with unreliable machines (Q367250) (← links)
- Item:Q228023 (redirect page) (← links)
- Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) (← links)
- Scheduling a single server in a two-machine flow shop (Q424733) (← links)
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (Q435728) (← links)
- Internet shopping with price sensitive discounts (Q457290) (← links)
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence (Q490158) (← links)
- Maximization problems in single machine scheduling (Q596446) (← links)
- Scheduling malleable tasks on parallel processors to minimize the makespan (Q596452) (← links)
- A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
- Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary (Q612205) (← links)
- The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
- Minimizing the number of late jobs on a single machine under due date uncertainty (Q657256) (← links)
- Batching decisions for assembly production systems (Q703918) (← links)
- Single machine group scheduling with resource dependent setup and processing times (Q707136) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy (Q856325) (← links)
- Batching deteriorating items with applications in computer communication and reverse logistics (Q884021) (← links)
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- On the approximability of the simplified partial digest problem (Q967421) (← links)
- Item:Q228023 (redirect page) (← links)
- Approximate solution of the control problem of supplies with many intervals and concave cost functions (Q1015342) (← links)
- Item:Q228023 (redirect page) (← links)
- Minimization of the weighted sum of overdue customers in a single-server system (Q1190013) (← links)
- Scheduling a batching machine (Q1268850) (← links)
- Batch scheduling with deadlines on parallel machines (Q1273116) (← links)
- Single machine scheduling with batch deliveries (Q1278307) (← links)
- Single machine scheduling subject to deadlines and resource dependent processing times (Q1278308) (← links)
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness (Q1296374) (← links)
- A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) (Q1376266) (← links)
- Batch scheduling and common due date assignment problem: An NP-hard case (Q1382284) (← links)
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs (Q1388066) (← links)
- Uniform machine scheduling of unit-time jobs subject to resource constraints (Q1392579) (← links)
- Single machine batch scheduling with jointly compressible setup and processing times. (Q1417506) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- Single supplier scheduling for multiple deliveries (Q1599327) (← links)
- Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
- Minimizing the total weighted completion time of deteriorating jobs (Q1603525) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- Optimal workforce assignment to operations of a paced assembly line (Q1694335) (← links)
- Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness (Q1850992) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- The complexity of two group scheduling problems (Q1860372) (← links)
- An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103) (← links)
- Single machine group scheduling with ordered criteria (Q1897384) (← links)