scholarly journals Incorporating batching decisions and operational constraints into the scheduling problem of multisite manufacturing environments

2021 ◽  
Vol 12 (3) ◽  
pp. 345-364
Author(s):  
Sergio Ackermann ◽  
Yanina Fumero ◽  
Jorge M. Montagna
Keyword(s):  
Customer Service ◽  
Programming Model ◽  
Mixed Integer ◽  
Scheduling Problems ◽  
Efficient Operation ◽  
Batch Plants ◽  
Entire Complex ◽  
Operational Constraints ◽  
Manufacturing Environments ◽  
The Impact

In multisite production environments, the appropriate management of production resources is an activity of fundamental relevance to optimally respond to market demands. In particular, each production facility can operate with different policies according to its objectives, prioritizing the quality and standardization of the product, customer service, or the overall efficiency of the system; goals which must be taken into account when planning the production of the entire complex. At the operational level, in order to achieve an efficient operation of the production system, the integrated problem of batching and scheduling must be solved over all facilities, instead of doing it for each plant separately, as has been usual so far. Then, this paper proposes a mixed-integer linear programming model for the multisite batching and scheduling problems, where different operational policies are considered for multiple batch plants. Through two examples, the impact of policies on the decision-making process is shown.

scholarly journals Efficient Operative Cost Reduction in Distribution Grids Considering the Optimal Placement and Sizing of D-STATCOMs Using a Discrete-Continuous VSA

2021 ◽  
Vol 11 (5) ◽  
pp. 2175
Author(s):  
Oscar Danilo Montoya ◽  
Walter Gil-González ◽  
Jesus C. Hernández
Keyword(s):  
Objective Function ◽  
Reactive Power ◽  
Programming Model ◽  
Search Algorithm ◽  
Solution Space ◽  
Distribution Networks ◽  
Optimal Placement ◽  
Mixed Integer ◽  
Solution Vector ◽  
The Impact

The problem of reactive power compensation in electric distribution networks is addressed in this research paper from the point of view of the combinatorial optimization using a new discrete-continuous version of the vortex search algorithm (DCVSA). To explore and exploit the solution space, a discrete-continuous codification of the solution vector is proposed, where the discrete part determines the nodes where the distribution static compensator (D-STATCOM) will be installed, and the continuous part of the codification determines the optimal sizes of the D-STATCOMs. The main advantage of such codification is that the mixed-integer nonlinear programming model (MINLP) that represents the problem of optimal placement and sizing of the D-STATCOMs in distribution networks only requires a classical power flow method to evaluate the objective function, which implies that it can be implemented in any programming language. The objective function is the total costs of the grid power losses and the annualized investment costs in D-STATCOMs. In addition, to include the impact of the daily load variations, the active and reactive power demand curves are included in the optimization model. Numerical results in two radial test feeders with 33 and 69 buses demonstrate that the proposed DCVSA can solve the MINLP model with best results when compared with the MINLP solvers available in the GAMS software. All the simulations are implemented in MATLAB software using its programming environment.

Modeling and scheduling hybrid open shops for makespan minimization

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Kennedy Anderson Guimarães de Araújo ◽  
Tiberius Oliveira e Bonates ◽  
Bruno de Athayde Prata
Keyword(s):  
Programming Model ◽  
Computing Time ◽  
Iterated Local Search ◽  
Mixed Integer ◽  
Scheduling Problems ◽  
Priority Rules ◽  
Production Flow ◽  
Solution Quality ◽  
Content Type ◽  
Constructive Heuristics

Purpose This study aims to address the hybrid open shop problem (HOSP) with respect to the minimization of the overall finishing time or makespan. In the HOSP, we have to process n jobs in stages without preemption. Each job must be processed once in every stage, there is a set of mk identical machines in stage k and the production flow is immaterial. Design/methodology/approach Computational experiments carried out on a set of randomly generated instances showed that the minimal idleness heuristic (MIH) priority rule outperforms the longest processing time (LPT) rule proposed in the literature and the other proposed constructive methods on most instances. Findings The proposed mathematical model outperformed the existing model in the literature with respect to computing time, for small-sized instances, and solution quality within a time limit, for medium- and large-sized instances. The authors’ hybrid iterated local search (ILS) improved the solutions of the MIH rule, drastically outperforming the models on large-sized instances with respect to solution quality. Originality/value The authors formalize the HOSP, as well as argue its NP-hardness, and propose a mixed integer linear programming model to solve it. The authors propose several priority rules – constructive heuristics based on priority measures – for finding feasible solutions for the problem, consisting of adaptations of classical priority rules for scheduling problems. The authors also propose a hybrid ILS for improving the priority rules solutions.

scholarly journals A Mixed Integer Linear Programming Method for Simultaneous Multi-Periodic Train Timetabling and Routing on a High-Speed Rail Network

2020 ◽  
Vol 12 (3) ◽  
pp. 1131
Author(s):  
Wenliang Zhou ◽  
Xiaorong You ◽  
Wenzhuang Fan
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
High Speed ◽  
Programming Model ◽  
Mixed Integer ◽  
High Speed Rail ◽  
Train Timetabling ◽  
Train Timetable ◽  
The Impact

To avoid conflicts among trains at stations and provide passengers with a periodic train timetable to improve service level, this paper mainly focuses on the problem of multi-periodic train timetabling and routing by optimizing the routes of trains at stations and their entering time and leaving time on each chosen arrival–departure track at each visited station. Based on the constructed directed graph, including unidirectional and bidirectional tracks at stations and in sections, a mixed integer linear programming model with the goal of minimizing the total travel time of trains is formulated. Then, a strategy is introduced to reduce the number of constraints for improving the solved efficiency of the model. Finally, the performance, stability and practicability of the proposed method, as well as the impact of some main factors on the model are analyzed by numerous instances on both a constructed railway network and Guang-Zhu inter-city railway; they are solved using the commercial solver WebSphere ILOG CPLEX (International Business Machines Corporation, New York, NY, USA). Experimental results show that integrating multi-periodic train timetabling and routing can be conducive to improving the quality of a train timetable. Hence, good economic and social benefits for high-speed rail can be achieved, thus, further contributing to the sustained development of both high-speed railway systems and society.

scholarly journals Impact of demand response on BIPV and district multi-energy systems design in Singapore and Switzerland

2021 ◽  
Vol 2042 (1) ◽  
pp. 012096
Author(s):  
Christoph Waibel ◽  
Shanshan Hsieh ◽  
Arno Schlüter
Keyword(s):  
Demand Response ◽  
Programming Model ◽  
Systems Design ◽  
Energy Systems ◽  
Mixed Integer ◽  
Peak Shaving ◽  
Climate Conditions ◽  
Building Integrated Photovoltaics ◽  
Energy Hub ◽  
The Impact

Abstract This paper demonstrates the impact of demand response (DR) on optimal multi-energy systems (MES) design with building integrated photovoltaics (BIPV) on roofs and façades. Building loads and solar potentials are assessed using bottom-up models; the MES design is determined using a Mixed-Integer Linear Programming model (energy hub). A mixed-use district of 170,000 m2 floor area including office, residential, retail, education, etc. is studied under current and future climate conditions in Switzerland and Singapore. Our findings are consistent with previous studies, which indicate that DR generally leads to smaller system capacities due to peak shaving. We further show that in both the Swiss and Singapore context, cost and emissions of the MES can be reduced significantly with DR. Applying DR, the optimal area for BIPV placement increases only marginally for Singapore (~1%), whereas for Switzerland, the area is even reduced by 2-8%, depending on the carbon target. In conclusion, depending on the context, DR can have a noticeable impact on optimal MES and BIPV capacities and should thus be considered in the design of future, energy efficient districts.

scholarly journals Centralized Ambulance Diversion Policy Using Rolling-Horizon Optimization Framework to Minimize Patient Tardiness

Healthcare ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 266
Author(s):  
Sohye Baek ◽  
Young Hoon Lee ◽  
Seong Hyeon Park
Keyword(s):  
Programming Model ◽  
Mixed Integer ◽  
Time Interval ◽  
Rolling Horizon ◽  
Decentralized Optimization ◽  
Hospital System ◽  
Ambulance Diversion ◽  
Optimization Framework ◽  
The Impact ◽  
Rolling Horizon Optimization

Ambulance diversion (AD) is a common method for reducing crowdedness of emergency departments by diverting ambulance-transported patients to a neighboring hospital. In a multi-hospital system, the AD of one hospital increases the neighboring hospital’s congestion. This should be carefully considered for minimizing patients’ tardiness in the entire multi-hospital system. Therefore, this paper proposes a centralized AD policy based on a rolling-horizon optimization framework. It is an iterative methodology for coping with uncertainty, which first solves the centralized optimization model formulated as a mixed-integer linear programming model at each discretized time, and then moves forward for the time interval reflecting the realized uncertainty. Furthermore, the decentralized optimization, decentralized priority, and No-AD models are presented for practical application, which can also show the impact of using the following three factors: centralization, mathematical model, and AD strategy. The numerical experiments conducted based on the historical data of Seoul, South Korea, for 2017, show that the centralized AD policy outperforms the other three policies by 30%, 37%, and 44%, respectively, and that all three factors contribute to reducing patients’ tardiness. The proposed policy yields an efficient centralized AD management strategy, which can improve the local healthcare system with active coordination between hospitals.

COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS

2009 ◽  
Vol 26 (03) ◽  
pp. 421-443 ◽  
Author(s):  
JOSÉ ROBERTO DALE LUCHE ◽  
REINALDO MORABITO ◽  
VITÓRIA PUREZA
Keyword(s):  
Customer Service ◽  
Production Scheduling ◽  
Programming Model ◽  
Lot Sizing ◽  
Mixed Integer ◽  
Due Dates ◽  
Process Selection ◽  
Simple Task ◽  
Model Combining ◽  
Constructive Heuristic

This work presents an optimization model to support decisions in the production planning and control of the electrofused grain industry. A case study was carried out in a Brazilian company with the aim of helping to increase productivity and improve customer service concerning meeting deadlines. A mixed integer linear programming model combining known models of process selection and single-stage lot sizing were applied to the production scheduling of electrofused grains. Optimizing this scheduling is not a simple task mainly because of the scale of the equipment setup times, the diversity of the products and the deadlines of the order due dates. A constructive heuristic is also proposed as an alternative solution method, particularly for large-sized instances. The results show that the model and the heuristic can produce better solutions than the ones currently used by the company.

scholarly journals A Multi-Objective Mathematical Model for Real-Time Employee Assignment in the Service Industry

2021 ◽  
Author(s):  
Gercek Budak ◽  
Xin Chen
Keyword(s):  
Mathematical Model ◽  
Real Time ◽  
Customer Service ◽  
Service Industry ◽  
Programming Model ◽  
Manufacturing Sector ◽  
Mixed Integer ◽  
Multi Objective ◽  
Service Rates ◽  
The Mathematical Model

Abstract The American economy has shifted toward services since the 1980s. The service industry is an important part of economy and is growing quickly in the last three decades. It is more human-capital intensive than the manufacturing sector and there is a shortage of highly-skilled workforce. One solution to this problem is to improve the efficiency through optimization. Because demand in the service industry changes constantly, it is a great challenge to determine the number of employees and their tasks to improve customer service while reducing cost. This article develops a multi-objective mixed-integer linear programming model to dynamically assign employees to different workstations in real time. A case study of the model is solved in less than one second and its pareto optimal solutions determine the number of employees who are assigned to each workstation and the expected customer service times. The mathematical model is robust and provides optimal employee assignment and service rates for workstations in many situations.

A Multi-Objective Model for Taiwan Notebook Computer Distribution Problem

2006 ◽  
pp. 171-182
Author(s):  
Ling-Lang Tang ◽  
Yei-Chun Kuo ◽  
E. Stanley Lee
Keyword(s):  
Customer Service ◽  
Mixed Integer Linear Programming ◽  
Programming Model ◽  
Performance Criteria ◽  
Mixed Integer ◽  
Analytic Hierarchy ◽  
Multi Objective ◽  
Notebook Computer ◽  
Objective Model ◽  
Hierarchy Process

A multi-objective model of global distribution for the Taiwan notebook computer industry is proposed. The proposed two-stage approach involves a mixed integer linear programming model and the fuzzy analytic hierarchy process (AHP) approach. The analytic method provides quantitative assessment of the relationships between manufacturers and customer service. To show the effectiveness of the proposed approach, a Taiwan notebook computer model is solved. The results of this multi-objective model show some dynamic characteristics among various performance criteria of the outbound logistics.

scholarly journals Emission-Intensity-Based Carbon Tax and Its Impact on Generation Self-Scheduling

Energies ◽  
2019 ◽  
Vol 12 (5) ◽  
pp. 777 ◽  
Author(s):  
Ping Che ◽  
Yanyan Zhang ◽  
Jin Lang
Keyword(s):  
Electricity Market ◽  
Emission Intensity ◽  
Tax Policy ◽  
Programming Model ◽  
Carbon Tax ◽  
Electric Power Industry ◽  
Decomposition Algorithm ◽  
Mixed Integer ◽  
Tax Rate ◽  
The Impact

We propose an emission-intensity-based carbon-tax policy for the electric-power industry and investigate the impact of the policy on thermal generation self-scheduling in a deregulated electricity market. The carbon-tax policy is designed to take a variable tax rate that increases stepwise with the increase of generation emission intensity. By introducing a step function to express the variable tax rate, we formulate the generation self-scheduling problem under the proposed carbon-tax policy as a mixed integer nonlinear programming model. The objective function is to maximize total generation profits, which are determined by generation revenue and the levied carbon tax over the scheduling horizon. To solve the problem, a decomposition algorithm is developed where the variable tax rate is transformed into a pure integer linear formulation and the resulting problem is decomposed into multiple generation self-scheduling problems with a constant tax rate and emission-intensity constraints. Numerical results demonstrate that the proposed decomposition algorithm can solve the considered problem in a reasonable time and indicate that the proposed carbon-tax policy can enhance the incentive for generation companies to invest in low-carbon generation capacity.

Sign in / Sign up

Export Citation Format

Share Document