Pages that link to "Item:Q1772845"
From MaRDI portal
The following pages link to Positive half-products and scheduling with controllable processing times (Q1772845):
Displaying 29 items.
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
- Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
- Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
- Considering manufacturing cost and scheduling performance on a CNC turning machine (Q856225) (← links)
- Single machine scheduling problem with controllable processing times and resource dependent release times (Q877039) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- FPTAS for half-products minimization with scheduling applications (Q1005250) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Min-max controllable risk problems (Q2040608) (← links)
- Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
- Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- Optimal testing and repairing a failed series system (Q2369986) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- Single machine scheduling with controllable release and processing parameters (Q2433805) (← links)
- Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN (Q3052719) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
- Min‐sum controllable risk problems with concave risk functions of the same value range (Q6065855) (← links)
