Algorithms for minclique scheduling problems
From MaRDI portal
Recommendations
- A clique search problem and its application to machine scheduling
- Algorithms for solving minimax scheduling problem
- Minimizing completion time for a class of scheduling problems
- scientific article; zbMATH DE number 3893237
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
Cites work
- `` Strong NP-Completeness Results
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A projection technique for partitioning the nodes of a graph
- A user's guide to tabu search
- An Algorithm for Partitioning the Nodes of a Graph
- Completion time variance minimization on a single machine is difficult
- CON due-date determination and sequencing
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- scientific article; zbMATH DE number 3871421 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- Matrix Analysis
- Minimizing Variation of Flow Time in Single Machine Systems
- New results on the completion time variance minimization
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
Cited in
(20)- FPTAS for half-products minimization with scheduling applications
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minimization of ordered, symmetric half-products
- Positive half-products and scheduling with controllable processing times
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- Machine scheduling with earliness, tardiness and non-execution penalties
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- A clique search problem and its application to machine scheduling
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
- Maximizing total tardiness on a single machine in O(n^2) time via a reduction to half-product minimization
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Just-in-time scheduling with equal-size jobs
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- Introduction to QUBO
- Complexity and polynomially solvable special cases of QUBO
- Fast heuristics and approximation algorithms
- A generic approach to proving NP-hardness of partition type problems
- Pseudo-Boolean optimization
- Job scheduling methods for reducing waiting time variance
This page was built for publication: Algorithms for minclique scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961609)
