Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically,one seeks to optimize a multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming.
In graph theory,the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum of the weights of its constituent edges is minimized.
Mathematical optimization or mathematical programming is the selection of a best element,with regard to some criteria,from some set of available alternatives. It is generally divided into two subfields:discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics,and the development of solution methods has been of interest in mathematics for centuries.
A fully polynomial-time approximation scheme (FPTAS) is an algorithm for finding approximate solutions to function problems,especially optimization problems. An FPTAS takes as input an instance of the problem and a parameter ε > 0. It returns as output a value which is at least times the correct value,and at most times the correct value.
Guillotine cutting is the process of producing small rectangular items of fixed dimensions from a given large rectangular sheet,using only guillotine-cuts. A guillotine-cut is a straight bisecting line going from one edge of an existing rectangle to the opposite edge,similarly to a paper guillotine.
Uniform machine scheduling is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. We are given n jobs J1,J2,...,Jn of varying processing times,which need to be scheduled on m different machines. The goal is to minimize the makespan - the total time required to execute the schedule. The time that machine i needs in order to process job j is denoted by pi,j. In the general case,the times pi,j are unrelated,and any matrix of positive processing times is possible. In the specific variant called uniform machine scheduling,some machines are uniformly faster than others. This means that,for each machine i,there is a speed factor si,and the run-time of job j on machine i is pi,j = pj / si.
Single-machine scheduling or single-resource scheduling is an optimization problem in computer science and operations research. We are given n jobs J1,J2,...,Jn of varying processing times,which need to be scheduled on a single machine,in a way that optimizes a certain objective,such as the throughput.
Optimal job scheduling is a class of optimization problems related to scheduling. The inputs to such problems are a list of jobs and a list of machines. The required output is a schedule –an assignment of jobs to machines. The schedule should optimize a certain objective function. In the literature,problems of optimal job scheduling are often called machine scheduling,processor scheduling,multiprocessor scheduling,or just scheduling.
In the field of mathematical optimization,Lagrangian relaxation is a relaxation method which approximates a difficult problem of constrained optimization by a simpler problem. A solution to the relaxed problem is an approximate solution to the original problem,and provides useful information.
Job-shop scheduling,the job-shop problem (JSP) or job-shop scheduling problem (JSSP) is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. In a general job scheduling problem,we are given n jobs J1, J2, ..., Jn of varying processing times,which need to be scheduled on m machines with varying processing power,while trying to minimize the makespan –the total length of the schedule. In the specific variant known as job-shop scheduling,each job consists of a set of operationsO1, O2, ..., On which need to be processed in a specific order. Each operation has a specific machine that it needs to be processed on and only one operation in a job can be processed at a given time. A common relaxation is the flexible job shop,where each operation can be processed on any machine of a given set.
The Coffman–Graham algorithm is an algorithm for arranging the elements of a partially ordered set into a sequence of levels. The algorithm chooses an arrangement such that an element that comes after another in the order is assigned to a lower level,and such that each level has a number of elements that does not exceed a fixed width bound W. When W = 2,it uses the minimum possible number of distinct levels,and in general it uses at most 2 −2/W times as many levels as necessary.
Truthful job scheduling is a mechanism design variant of the job shop scheduling problem from operations research.
Parallel task scheduling is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. In a general job scheduling problem,we are given n jobs J1, J2, ..., Jn of varying processing times,which need to be scheduled on m machines while trying to minimize the makespan - the total length of the schedule. In the specific variant known as parallel-task scheduling,all machines are identical. Each job j has a length parameter pj and a size parameter qj,and it must run for exactly pj time-steps on exactly qj machines in parallel.
Identical-machines scheduling is an optimization problem in computer science and operations research. We are given n jobs J1,J2,...,Jn of varying processing times,which need to be scheduled on m identical machines,such that a certain objective function is optimized,for example,the makespan is minimized.
Unrelated-machines scheduling is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. We need to schedule n jobs J1,J2,...,Jn on m different machines,such that a certain objective function is optimized. The time that machine i needs in order to process job j is denoted by pi,j. The term unrelated emphasizes that there is no relation between values of pi,j for different i and j. This is in contrast to two special cases of this problem:uniform-machines scheduling - in which pi,j = pi / sj,and identical-machines scheduling - in which pi,j = pi.
Longest-processing-time-first (LPT) is a greedy algorithm for job scheduling. The input to the algorithm is a set of jobs,each of which has a specific processing-time. There is also a number m specifying the number of machines that can process the jobs. The LPT algorithm works as follows:
- Order the jobs by descending order of their processing-time,such that the job with the longest processing time is first.
- Schedule each job in this sequence into a machine in which the current load is smallest.
Balanced number partitioning is a variant of multiway number partitioning in which there are constraints on the number of items allocated to each set. The input to the problem is a set of n items of different sizes,and two integers m, k. The output is a partition of the items into m subsets,such that the number of items in each subset is at most k. Subject to this,it is required that the sums of sizes in the m subsets are as similar as possible.
Matroid-constrained number partitioning is a variant of the multiway number partitioning problem,in which the subsets in the partition should be independent sets of a matroid. The input to this problem is a set S of items,a positive integer m,and some m matroids over the same set S. The goal is to partition S into m subsets,such that each subset i is an independent set in matroid i. Subject to this constraint,some objective function should be minimized,for example,minimizing the largest sum item sizes in a subset. In a more general variant,each of the m matroids has a weight function,which assigns a weight to each element of the ground-set. Various objective functions have been considered. For each of the three operators max,min,sum,one can use this operator on the weights of items in each subset,and on the subsets themselves. All in all,there are 9 possible objective functions,each of which can be maximized or minimized.
The configuration linear program (configuration-LP) is a linear programming technique used for solving combinatorial optimization problems. It was introduced in the context of the cutting stock problem. Later,it has been applied to the bin packing and job scheduling problems. In the configuration-LP,there is a variable for each possible configuration - each possible multiset of items that can fit in a single bin. Usually,the number of configurations is exponential in the problem size,but in some cases it is possible to attain approximate solutions using only a polynomial number of configurations.
Fractional job scheduling is a variant of optimal job scheduling in which it is allowed to break jobs into parts and process each part separately on the same or a different machine. Breaking jobs into parts may allow for improving the overall performance,for example,decreasing the makespan. Moreover,the computational problem of finding an optimal schedule may become easier,as some of the optimization variables become continuous. On the other hand,breaking jobs apart might be costly.
