Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach

In this paper, we deal with the least distance problem (LDP) in Data Envelopment Analysis (DEA), which is to find a closest efficient target over the whole efficient frontier. To this end, we define the efficient frontier by a linear complementarity system and propose a mixed integer programming (MIP) approach to solve the LDP. Our proposed MIP approach: (1) can solve the LDP based on [Formula: see text]-norm ([Formula: see text]) by using a state-of-the-art solver and obtain the closest efficient target over the whole efficient frontier instead of a subset of it; (2) can be applied for computing the least distance DEA models satisfying the monotonicity; (3) is more user-friendly, because it allows a decision maker to improve the efficiency of a decision making unit (DMU) by setting the affordable input/output level under his/her circumstance. Thus, the efficient target provided by our approach may be more appropriate from the perspective of the decision makers of DMUs.

Testable implications of general equilibrium models: An integer programming approach

The sugarcane transport system is very complex and uses a daily schedule, consisting of a set of locomotives runs, to satisfy the requirements of the mill and harvesters. The total cost of sugarcane transport operations is very high; over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. Producing efficient schedules for sugarcane transport can reduce the cost and limit the negative effects that this system can have on the raw sugar production system. In this paper, the sugarcane rail operations are formulated as a blocking job shop scheduling problem. A mixed integer programming approach is used to formulate the shop job scheduling problem. Mixed integer programming and constraint programming search techniques are integrated for solving the problem. A case study is solved to test the approach.

This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is quite frequent in space engineering and a real-world application deals with the Automated Transfer Vehicle project (funded by the European Space Agency), at present under development. A Mixed Integer Programming (MIP) approach is proposed. The three-dimensional single bin packing problem is considered. It consists of orthogonally placing, with possibility of rotation, the maximum number of parallelepipeds into a given parallelepiped. A MIP formulation of the problem is reported together with a MIP-based heuristic approach. Balancing conditions are furthermore examined, as well as the orthogonal placement (with rotation) of tetris-like items into a rectangular domain.

Purpose – This paper aims to address the problem of optimal allocation of demand of items among candidate suppliers to maximize the purchase value of items. The purchase value of the items directly relates to cost and quality of raw materials purchased from the supplier. In an increasingly competitive environment, firms are paying more attention to selecting the right suppliers for procurement of raw materials and component parts for their products. The present research work focuses on this issue of supply chain management. Design/methodology/approach – This present research work devises a hybrid algorithm for multi-period demand allocation among the suppliers. The customer demand is allocated by using a hybrid algorithm based on the technique for order preference by similarity to ideal solution (TOPSIS), fuzzy set theory and the mixed linear integer programming (MILP) approaches. Findings – The supply chain network is witnessing a changing business environment due to government policies aimed at promoting new small manufacturing enterprises (small and medium-sized enterprises) for intermediate parts and components. Hence, the managers have an option to select a new group of suppliers and allocate the optimal multi-period demand among the new group of suppliers to maximize their purchase value. In this context, the proposed hybrid model would be beneficial for the managers to operate their supply chain effectively and efficiently. The present research work will be helpful for the managers who are interested to reconfigure their supply chain under the failure of any supply chain partner or in a changing business environment. The model provides flexibility to the managers for evaluation of the different available alternatives to take a decision of optimal demand allocation among the suppliers. The proposed hybrid (fuzzy, TOPSIS and MILP) model provides more objective information for supplier evaluation and demand allocation among suppliers in a supply chain. The managers can use the proposed model to the analysis of other management decision-making problems. Originality/value – This present research work devises a hybrid algorithm for multi-period demand allocation among the suppliers. This hybrid algorithm prioritizes the suppliers and then allocates the multi-period demand among the suppliers. The customer demand is allocated by using a hybrid algorithm based on the technique for order preference by similarity to ideal solution (TOPSIS), fuzzy set theory and the mixed linear integer programming (MILP) approaches.

Integer programming models for the q-mode problem

An optimization procedure is described that can serve to identify attractive regionalization plans for large wastewater treatment and collection systems. Potential expansion of facilities in Western Suffolk County, Long Island, New York is considered. A mixed integer programming approach is utilized. Each system element cost, taken as a function of wastewater flow, is represented by a linear variable cost plus a fixed cost. The objective is to minimize total cost while ensuring that all wastewater flow generated is treated. Political and administrative feasibility and the location of effluent discharge constrain the model. The Long Island problem is too large to be solved with a standard formulation of wastewater network as a mixed integer programming problem. To improve computational efficiency, additional constraints are introduced on the minimum flow in each pipe and on the number of pipes leaving each node. Network configurations obtained for Western Suffolk County show that limiting development plans to 201 regions is not cost effective. Regional solutions indicate a general trade‐off between lower costs for coastal discharge and increased groundwater recharge.

Appointment schedules for outpatient clinics have great influence on efficiency and timely access to health care services. The number of new patients per week fluctuates, and capacity at the clinic varies because physicians have other obligations. However, most outpatient clinics use static appointment schedules, which reserve capacity for each patient type. In this paper, we aim to optimise appointment scheduling with respect to access time, taking fluctuating patient arrivals and unavailabilities of physicians into account. To this end, we formulate a stochastic mixed integer programming problem, and approximate its solution invoking two different approaches: (1) a mixed integer programming approach that results in a static appointment schedule, and (2) Markov decision theory, which results in a dynamic scheduling strategy. We apply the methodologies to a case study of the surgical outpatient clinic of the Jeroen Bosch Hospital. We evaluate the effectiveness and limitations of both approaches by discrete event simulation; it appears that allocating only 2% of the capacity flexibly already increases the performance of the clinic significantly.

Dynamic hoist scheduling problem with multi-capacity reentrant machines: A mixed integer programming approach

The paper presents a modeling framework to analyze some important issues associated with operation planning of a power system. Major activities involved in operations planning of large integrated power systems are considered simultaneously to ensure optimal utilization of generation and transmission capacity. The model also examines optimal transmission expansion plans vis‐à‐vis fuel supply issues. A mixed integer programming model is developed for this purpose and the Indian power system considered. Specific emphasis is on spatial transmission expansion plan for the existing Indian inter‐state transmission grid and new transmission links, coordinated operation of the isolated regional grids and system benefits accruing from transmission expansion, enhanced fuel production and supply rescheduling to ensure efficient operation of various generating stations.

The aim of this paper is to point out that the mixed nonlinear integer programming model proposed by Toksari and Guner (Int J Adv Manuf Technol 38:801–808, 2008) is incorrect. We present a mixed nonlinear 0–1 programming model for the same scheduling problem based on their model.

In the Multileaf Collimator (MLC) problem one faces the task to generate a 2 dimensional intensity modulated beam using a sequence of shape matrices formed by MLCs. We use (0,1) variables to characterize the set of all MLC setups in which interleaf motion and tongue-and-groove effects are avoided. Among the various options of finding a ”good“ MLC setup we show, how a mixed integer programming formulation can be used to minimize the treatment time. An optimal solution is obtained using column generation techniques. A reformulation of the problem allows the use of procedures for the partitioning problem.

Recently, we compared the performance of mixed-integer programming (MIP), constraint programming (CP), and constraint integer programming (CIP) to a state-of-the-art logic-based Benders manual decomposition (LBBD) for a resource allocation/scheduling problem. For a simple linear relaxation, the LBBD and CIP models deliver comparable performance with MIP also performing well. Here we show that algorithmic developments in CIP plus the use of an existing tighter relaxation substantially improve one of the CIP approaches. Furthermore, the use of the same relaxation in LBBD and MIP models significantly improves their performance. While such a result is known for LBBD, to the best of our knowledge, the other results are novel. Our experiments show that both CIP and MIP approaches are competitive with LBBD in terms of the number of problems solved to proven optimality, though MIP is about three times slower on average. Further, unlike the LBBD and CIP approaches, the MIP model is able to obtain provably high-quality solutions for all problem instances.KeywordsSchedule ProblemConstraint ProgrammingMaster ProblemLinear Programming RelaxationPrimal HeuristicThese 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.

New mixed integer approach to solve a multi-level capacitated disassembly lot-sizing problem with defective items and backlogging

Type-2 fuzzy mixed-integer bi-level programming approach for multi-source multi-user water allocation under future climate change