The operating theater layout problem (OTLP) in a hospital aims to determine for a set of facilities their positions and orientations on the floor-layout of departments in a hospital subject to a set of constraints on distances, available areas, and non-overlapping facilities according to international medical standards and specifications. The OTLP has two main objectives: a quantitative objecti...

In the seventies, Balas introduced intersection cuts for a Mixed Integer Linear Program (MILP), and showed that these cuts can be obtained by a closed form formula from a basis of the standard linear programming relaxation. In the early nineties, Cook, Kannan and Schrijver introduced the split closure of an MILP, and showed that the split closure is a polyhedron. In this paper, we show that the...

A new method of sensitivity analysis for mixed integer linear programming MILP is derived from the idea of inference duality The inference dual of an optimization problem asks how the optimal value can be deduced from the constraints In MILP a deduction based on the resolution method of theorem proving can be obtained from the branch and cut tree that solves the primal problem One can then inve...

in this paper, we consider a flow shop scheduling problem with availability constraints (fsspac) for the objective of minimizing the makespan. in such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. we proposed a mixed-integer linear programming (milp) model for this problem which can generate non-permutation schedules. furthermor...

This paper studies the Graph-Connected Clique-Partitioning Problem (GCCP), a clustering optimization model in which units are characterized by both individual and relational data. problem, introduced Benati, Puerto, Rodríguez-Chía (2017) under name of Connected Partitioning Problem, shows that combination two data types improves quality comparison with other methodologies. Nevertheless, resulti...

ij ij Q P , CONCLUSIONS A general purpose MILP model for allocation problems in any given number of dimensions is presented. The model is concerned with the allocation of items in an N-dimensional space. To demonstrate the formulation, a number of illustrative examples in different number of dimensions are solved. 1, 2, 3 and 4-dimensional problems are presented and solved using the proposed mo...

This paper analyzes a consumption scheduling mechanism for domestic appliances within a home area network. The aim of the proposed scheduling is to minimize the total energy price paid by the consumer and to reduce power peaks in order to achieve a balanced daily load schedule. An exact and computationally efficient mixed-integer linear programming (MILP) formulation of the problem is presented...

This work addresses the large-scale crude oil scheduling problem of China’s SINOPEC Maoming refinery importing various types of crude oil from two terminals via long-distance pipelines. A hierarchical decomposition approach is employed to construct a two-stage MILP model of the practical refinery operations. In the upper level model, storage and charging tanks are aggregated to determine the in...

In this paper we present a new scheduling problem and describe a shortest path based heuristic as well as a dynamic programming based exact optimization algorithm to solve it. The Selective Multi-Category Parallel-Servicing Problem (SMCPSP) arises when a set of jobs has to be scheduled on a server (machine) with limited capacity. Each job requests service in a prespecified time window and belon...

This paper considers a dairy industry problem on integrated planning and scheduling of set yoghurt production. A mixed integer linear programming formulation is introduced to integrate tactical and operational decisions and a heuristic approach is proposed to decompose time buckets of the decisions. The decomposition heuristic improves computational efficiency by solving big bucket planning and...