0-1 Quadratic programming approach for optimum solutions of two scheduling problems
From MaRDI portal
Publication:4286574
Recommendations
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
- Two-machine shop scheduling with zero and unit processing times
- Maximizing set function formulation of two scheduling problems
- scientific article; zbMATH DE number 4164535
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
Cites work
- A Graph-Theoretic Equivalence for Integer Programs
- A global optimization approach for solving the maximum clique problem
- A note on allocating jobs to two machines
- Algorithms for Scheduling Independent Tasks
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- An algorithm for the CON due-date determination and sequencing problem
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Maximizing set function formulation of two scheduling problems
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Order‐preserving allocation of jobs to two machines
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Scheduling independent tasks to reduce mean finishing time
- Sequencing with Earliness and Tardiness Penalties: A Review
- Unconstrained quadratic bivalent programming problem
Cited in
(26)- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Bounds for random binary quadratic programs
- \(f\)-flip strategies for unconstrained binary quadratic programming
- Aspects of stability for multicriteria quadratic problems of Boolean programming
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- The unconstrained binary quadratic programming problem: a survey
- Maximizing set function formulation of two scheduling problems
- A global continuation algorithm for solving binary quadratic programming problems
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Building an iterative heuristic solver for a quantum annealer
- ``Miniaturized linearizations for quadratic 0/1 problems
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- A tight lower bound for a special case of quadratic 0-1 programming
- An evolutionary heuristic for quadratic 0-1 programming
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- A continuation approach for solving binary quadratic program based on a class of NCP-functions
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A hybrid metaheuristic approach to solving the UBQP problem
- Applications and computational advances for solving the QUBO model
- On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date
- Parameter-free filled function method for nonlinear integer program
- An improved linearization strategy for zero-one quadratic programming problems
This page was built for publication: 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286574)
