Pages that link to "Item:Q5961609"
From MaRDI portal
The following pages link to Algorithms for minclique scheduling problems (Q5961609):
Displaying 20 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)
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
- A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Job scheduling methods for reducing waiting time variance (Q878584) (← links)
- FPTAS for half-products minimization with scheduling applications (Q1005250) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249) (← links)
- Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance (Q2434334) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
