0-1 Quadratic programming approach for optimum solutions of two scheduling problems

DOI10.1080/00207729408928968zbMath0795.90031OpenAlexW2057162710MaRDI QIDQ4286574

Gary A. Kochenberger, Ahmad Ahmadian, Bahram Alidaee

Publication date: 14 September 1994

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729408928968

zbMATH Keywords

single machineparallel identical processorstotal weighted earliness and tardinessweighted mean flow time

Mathematics Subject Classification ID

Quadratic programming (90C20) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items

\(f\)-flip strategies for unconstrained binary quadratic programming ⋮ Applications and Computational Advances for Solving the QUBO Model ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ Unnamed Item ⋮ Probabilistic GRASP-tabu search algorithms for the UBQP problem ⋮ Diversification-driven tabu search for unconstrained binary quadratic problems ⋮ A hybrid metaheuristic approach to solving the UBQP problem ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models ⋮ Bounds for Random Binary Quadratic Programs ⋮ Parameter-free filled function method for nonlinear integer program ⋮ Solving unconstrained binary quadratic programming problem by global equilibrium search ⋮ An improved linearization strategy for zero-one quadratic programming problems ⋮ 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 ⋮ Global optimality conditions for quadratic \(0-1\) optimization problems ⋮ Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem ⋮ Global equilibrium search applied to the unconstrained binary quadratic optimization problem ⋮ An evolutionary heuristic for quadratic 0-1 programming ⋮ A global continuation algorithm for solving binary quadratic programming problems ⋮ A continuation approach for solving binary quadratic program based on a class of NCP-functions ⋮ One-pass heuristics for large-scale unconstrained binary quadratic problems ⋮ An unconstrained quadratic binary programming approach to the vertex coloring problem ⋮ ``Miniaturized linearizations for quadratic 0/1 problems

Cites Work

• Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
• Unconstrained quadratic bivalent programming problem
• An algorithm for the CON due-date determination and sequencing problem
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• An algorithm for finding a maximum weighted independent set in an arbitrary graph
• Sequencing with Earliness and Tardiness Penalties: A Review
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• A global optimization approach for solving the maximum clique problem
• Maximizing set function formulation of two scheduling problems
• A note on allocating jobs to two machines
• Algorithms for Scheduling Independent Tasks
• Order‐preserving allocation of jobs to two machines
• Scheduling independent tasks to reduce mean finishing time
• A Graph-Theoretic Equivalence for Integer Programs