A Probe-Based Algorithm for Piecewise Linear Optimization in Scheduling

It may be very difficult to achieve the optimal shift schedule in call centers which have highly uncertain and peaked demand during short time periods. Overlapping shift systems are usually designed for such cases. This paper studies shift scheduling and rostering problems for inbound call centers where overlapping shift systems are used. An integer programming model that determines which shifts to be opened and how many operators to be assigned to these shifts is proposed for the shift scheduling problem. For the rostering problem both integer programming and constraint programming models are developed to determine assignments of operators to all shifts, weekly days-off, and meal and relief break times of the operators. The proposed models are tested on real data supplied by an outsource call center and optimal results are found in an acceptable computation time. An improvement of 15% in the objective function compared to the current situation is observed with the proposed model for the shift scheduling problem. The computational performances of the proposed integer and constraint programming models for the rostering problem are compared using real data observed at a call center and simulated test instances. In addition, benchmark instances are used to compare our Constraint Programming (CP) approach with the existing models. The results of the comprehensive computational study indicate that the constraint programming model runs more efficiently than the integer programming model for the rostering problem. The originality of this research can be attributed to two contributions: (a) a model for shift scheduling problem and two models for rostering problem are presented in detail and compared using real data and (b) the rostering problem is considered as a task-resource allocation and considerably shorter computation times are obtained by modeling this new problem via CP.

In this paper, we introduce the concept of trade-off ratio function, which is closely related to the well-known Geoffrion’s proper efficiency for multi-objective optimization problems, and investigate its boundedness property. For linear multi-objective optimization problems, we show that the trade-off ratio function is bounded on the efficient solution set. For piecewise linear multi-objective optimization problems, we show that all efficient solutions are always properly efficient in Borwein’s sense, and moreover, all efficient solutions are properly efficient in Geoffrion’s sense if and only if a recession condition holds. Finally, we provide an example to illustrate that the trade-off ratio function may be unbounded on the efficient solution set to piecewise linear multi-objective optimization problems, even if the recession condition holds, while it is bounded on the supported efficient solution set.

We introduce the Oven Scheduling Problem (OSP), a new parallel batch scheduling problem that arises in the area of electronic component manufacturing. Jobs need to be scheduled to one of several ovens and may be processed simultaneously in one batch if they have compatible requirements. The scheduling of jobs must respect several constraints concerning eligibility and availability of ovens, release dates of jobs, setup times between batches as well as oven capacities. Running the ovens is highly energy-intensive and thus the main objective, besides finishing jobs on time, is to minimize the cumulative batch processing time across all ovens. This objective distinguishes the OSP from other batch processing problems which typically minimize objectives related to makespan, tardiness or lateness. We propose to solve this NP-hard scheduling problem via constraint programming (CP) and integer linear programming (ILP) and present corresponding CP- and ILP-models. For an experimental evaluation, we introduce a multi-parameter random instance generator to provide a diverse set of problem instances. Using state-of-the-art solvers, we evaluate the quality and compare the performance of our CP- and ILP-models, which could find optimal solutions for many instances. Furthermore, using our models we are able to provide upper bounds for the whole benchmark set including large-scale instances.

An essential challenge in generation scheduling (GS) problems of hydrothermal power systems is the inclusion of adequate modeling of the hydroelectric production function (HPF). The HPF is a nonlinear and nonconvex function that depends on the head and turbined outflow. Although the hydropower plants have multiple generating units (GUs), due to a series of complexities, the most attractive modeling practice is to represent one HPF per plant, i.e., a single function is built for representing the plant generation instead of the generation of each GU. Furthermore, due to the computation time constraints and representation of nonlinearities, the HPF must be given by a piecewise linear (PWL) model. This paper presented some continuous PWL models to include the HPF per plant in GS problems of hydrothermal systems. Depending on the type of application, the framework allows a choice between the concave PWL for HPF modeled with one or two variables and the nonconvex (more accurate) PWL for HPF dependent only on the turbined outflow. Basically, in both PWL models, offline, mixed-integer linear (or quadratic) programming techniques are used with an optimized pre-selection of the original HPF dataset obtained through the Ramer-Douglas-Peucker algorithm. As a highlight, the framework allows the control of the number of hyperplanes and, consequently, the number of variables and constraints of the PWL model. To this end, we offer two possibilities: (i) minimizing the error for a fixed number of hyperplanes, or (ii) minimizing the number of hyperplanes for a given error. We assessed the performance of the proposed framework using data from two large hydropower plants of the Brazilian system. The first has 3568 MW distributed in 50 Bulb-type GUs and operates as a run-of-river hydro plant. In turn, the second, which can vary the reservoir volume by up to 1000 hm3, possesses 1140 MW distributed in three Francis-type units. The results showed a variation from 0.040% to 1.583% in terms of mean absolute error and 0.306% to 6.356% regarding the maximum absolute error even with few approximations.

Optimized solvers for the Boolean satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, and so forth. Further uses are complicated by the need to express "counting constraints" in conjunctive normal form (CNF). Expressing such constraints by pure CNF leads to more complex SAT instances. Alternatively, those constraints can be handled by integer linear programming (ILP), but generic ILP solvers may ignore the Boolean nature of 0-1 variables. Therefore, specialized 0-1 ILP solvers extend SAT solvers to handle these so-called "pseudo-Boolean" (PB) constraints. This work provides an update on the on-going competition between generic ILP techniques and specialized 0-1 ILP techniques. To make a fair comparison, we generalize recent ideas for fast SAT-solving to more general 0-1 ILP problems that may include counting constraints and optimization. This generalization is embodied in our PB constraint solver and optimizer PBS, which is compared with state-of-the-art CNF and generic ILP solvers. Another aspect of our comparison is the evaluation on 0-1 ILP benchmarks that originate in electronic design automation (EDA) but that cannot be directly solved by an SAT solver. Specifically, we solve instances of the max-SAT and max-ONEs optimization problems, which seek to maximize the number of satisfied clauses and the "true" values over all satisfying assignments, respectively. Those problems have straightforward applications to SAT-based routing and are additionally important due to reductions from max-cut, max-clique, and min vertex cover. Our experimental results show that specialized 0-1 techniques implemented in PBS tend to outperform generic ILP techniques on Boolean optimization problems, as well as on general EDA SAT problems.

The infinite relaxations in integer programming were introduced by Gomory and Johnson to provide a general framework for the theory of cutting planes: the so-called valid functions, and in particular the minimal and extreme functions, can be seen as automatic rules for the generation of cuts. However, while many extreme functions are piecewise linear and therefore easy to describe, the set of extreme functions turns out to have a very complicated mathematical structure, as several extreme functions are known that exhibit a somewhat pathological behavior. In this paper we show that if some smoothness assumption is imposed on an extreme function $$\pi $$, then $$\pi $$ is necessarily piecewise linear. More precisely, we show that if a continuous extreme function for the Gomory–Johnson one-dimensional infinite group relaxation is a piecewise $${\mathcal {C}}^2$$ function, then it is a piecewise linear function.

This paper addresses an optimization problem concerning the purchase and subsequent material processing in a meat processing company. Unlike the majority of existing papers, we do not concentrate on how this problem concerns supply chain management, but we focus on the production stage, primarily the meat cutting. Specifically, we study the operational level of production management, where the company responds to fluctuations in demand and controls the flow of materials, as this level of management significantly affects its profit. The problem involves the concept of alternative ways of material processing, stock of material with different expiration dates, and extra constraints widely neglected in the current literature addressing meat cutting and processing, namely, the minimum order quantity and the minimum percentage in alternatives. We prove that each of these two constraints makes the problem ‐hard, and we design an exact iterative approach based on integer linear programming that allows us to solve real‐life instances even using an open‐source integer linear programming solver. Another advantage of this approach is that it mitigates numerical issues, caused by the extensive range of data values, we experienced with a commercial solver. The results obtained using real data from the meat processing company showed that our algorithm can find the optimum solution in a few seconds for all considered use cases.

The Oven Scheduling Problem (OSP) is a new parallel batch scheduling problem that arises in the area of electronic component manufacturing. Jobs need to be scheduled to one of several ovens and may be processed simultaneously in one batch if they have compatible requirements. The scheduling of jobs must respect several constraints concerning eligibility and availability of ovens, release dates of jobs, setup times between batches as well as oven capacities. Running the ovens is highly energy-intensive and thus the main objective, besides finishing jobs on time, is to minimize the cumulative batch processing time across all ovens. This objective distinguishes the OSP from other batch processing problems which typically minimize objectives related to makespan, tardiness or lateness. We propose to solve this NP-hard scheduling problem using exact techniques and present two different modelling approaches, one based on batch positions and another on representative jobs for batches. These models are formulated as constraint programming (CP) and integer linear programming (ILP) models and implemented both in the solver-independent modeling language MiniZinc and using interval variables in CP Optimizer. An extensive experimental evaluation of our solution methods is performed on a diverse set of problem instances. We evaluate the performance of several state-of-the-art solvers on the different models and on three variants of the objective function that reflect different real-life scenarios. We show that our models can find feasible solutions for instances of realistic size, many of those being provably optimal or nearly optimal solutions.

An Iterative local-search framework for solving constraint satisfaction problem

We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers. Examples of such problems are feasibility of linear programs, integer linear programming, the max-atoms problem, Hilbert's tenth problem, and many more. Our particular focus is to identify those CSPs that can be solved in polynomial time, and to distinguish them from CSPs that are NP-hard. A very helpful tool for obtaining complexity classifications in this context is the concept of a polymorphism from universal algebra.

In recent years, with the advent of robust solvers such as Cplex and Gurobi, constraint programing (CP) has been widely applied to a variety of scheduling problems. This paper presents CP models for formulating four scheduling problems with minimal makespan and complex constraints: the no‐wait hybrid flow shop scheduling problem, the hybrid flow shop scheduling problem with sequence‐dependent setup times, the flexible job shop scheduling problem with worker flexibility and the semiconductor final testing problem. The advantages of CP method in solving these four complex scheduling problems are explored. Finally, a set of benchmark instances are adopted to demonstrate the effectiveness and efficiency of the CP method. Experiment results show that the proposed CP models outperform existing algorithms; in particular, several best‐known solutions of benchmark instances are improved by our CP method.

Nonlinear constraint satisfaction or optimisation models need to be reduced to equivalent linear forms before they can be solved by (Integer) Linear Programming solvers. A choice of linearisation methods exist. There are generic linearisations and constraint-specific, user-defined linearisations. Hence a model reformulation system needs to be flexible and open to allow complex and novel linearisations to be specified. In this paper we show how the declarative model reformulation system Cadmium can be used to effectively transform constraint problems to different linearisations, allowing easy exploration of linearisation possibilities.KeywordsModelling LanguageModel TransformationConstraint MarkParameter SubstitutionNegation Normal FormThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This paper studies a new scheduling problem in a steel plant, referring to continuous casting (CC), reheating furnace, and hot rolling (HR) processes, which is meaningful and important to the production efficiency and energy saving. First, the problem is modeled as a combination of two coupled subproblems: one assigns casts to continuous casting (CC) machines, decides sequence and start time for casts and rolling units; and another assigns furnaces and decides start time for rolling slabs in a reheating furnace. The objectives are to maximize the number of slabs processed in a mode of hot charge rolling or direct hot charge rolling so as to reduce the energy requirement and the temperature drop of slabs and minimize the residence time of slabs in a reheating furnace to save energy. Then, based on a Benders decomposition strategy, a hybrid algorithm that combines mixed-integer programming and constraint programming is designed to solve each subproblem. An effective cut-generation scheme based on a priority relationship is developed for resolving resource conflicts and unsatisfied setup time constraints. Finally, extensive experiments are conducted to verify the effectiveness of the proposed approach. Note to Practitioners —This paper deals with a scheduling problem arising from CC to HR process in steel manufacturing. It decomposes the original problem into a CC–HR scheduling problem and a reheating furnace scheduling problem. Previously, such a problem is handled, respectively, which always cause energy waste and mismatching plan. This paper takes complex technology constraints into full account to minimize energy waste and energy requirement and establishes nonlinear mathematical models for studied problems. Then, it designs a hybrid algorithm combined mixed-integer programming and constraint programming. The results demonstrate that the proposed approach can solve them effectively. The obtained solution gives decision makers some desired reference to determine a right schedule when actual production tasks are executed.

Learning with continuous piecewise linear decision trees

Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth