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

DOI10.1080/00207729408928968zbMATH Open0795.90031OpenAlexW2057162710MaRDI QIDQ4286574FDOQ4286574

Authors: Bahram Alidaee, Gary A. Kochenberger, Ahmad Ahmadian 

Publication date: 14 September 1994

Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

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
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties

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)

Cites Work

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

Cited In (26)

• Maximizing set function formulation of two scheduling problems
• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
• An improved linearization strategy for zero-one quadratic programming problems
• Solving unconstrained binary quadratic programming problem by global equilibrium search
• \(f\)-flip strategies for unconstrained binary quadratic programming
• An unconstrained quadratic binary programming approach to the vertex coloring problem
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• The unconstrained binary quadratic programming problem: a survey
• A tight lower bound for a special case of quadratic 0-1 programming
• Global optimality conditions for quadratic \(0-1\) optimization problems
• One-pass heuristics for large-scale unconstrained binary quadratic problems
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem
• A global continuation algorithm for solving binary quadratic programming problems
• Parameter-free filled function method for nonlinear integer program
• A hybrid metaheuristic approach to solving the UBQP problem
• Diversification-driven tabu search for unconstrained binary quadratic problems
• A continuation approach for solving binary quadratic program based on a class of NCP-functions
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
• Applications and Computational Advances for Solving the QUBO Model
• Bounds for random binary quadratic programs
• Aspects of stability for multicriteria quadratic problems of Boolean programming
• On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date
• Building an iterative heuristic solver for a quantum annealer
• An evolutionary heuristic for quadratic 0-1 programming
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
• ``Miniaturized linearizations for quadratic 0/1 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)