Decision Making in Manufacturing and Services
Loading...
ISSN 1896-8325
e-ISSN: 2300-7087
Issue Date
2017
Volume
Vol. 11
Number
No. 1-2
Description
Journal Volume
Decision Making in Manufacturing and Services
Vol. 11 (2017)
Projects
Pages
Articles
Mixed integer programming approaches to planning and scheduling in electronics supply chains
(AGH University of Science and Technology Press, 2017) Sawik, Tadeusz
This paper discusses mixed-integer programming (MIP) approaches to planning and scheduling in electronics supply chains. First, the short-term detailed scheduling of wafer fabrication in semiconductor manufacturing and detailed scheduling of printed wiring board assembly in surface mount technology lines are discussed. Then, the medium-term aggregate production planning in a production/assembly facility of a consumer electronics supply chain is described, and finally, the coordinated aggregate planning and scheduling of the manufacturing and supply of parts and production of the finished products is presented. The decision variables are defined, and the MIP modeling frameworks are provided. Two decisionmaking approaches are discussed and compared: an integrated (simultaneous) approach, in which all required decisions are made simultaneously using a complex, large monolithic MIP model, and a hierarchical (sequential) approach, in which the required decisions are made successively using the hierarchies of simpler and smaller-sized MIP models. The paper also highlights the research on stochastic MIP applications to the planning and scheduling in electronics supply chains with disrupted material and information flows due to natural or man-made disasters.
The effect of environmental criteria on locating a biorefinery: a green facility location problem
(AGH University of Science and Technology Press, 2017) Serrano-Hernández, Adrián; Faulin, Javier; Belloso, Javier; Sawik, Bartosz
Underestimating facility location decisions may penalize business performance over the time. These penalties have usually been studied from the economic point of view, analyzing its impact on profitability. Additionally, the concern about obtaining sustainability is gaining importance, leading to a search for renewable energy sources to reduce greenhouse gas emissions. However, little attention has been paid to choosing a location considering environmental criteria. Thus, this work aims at determining a biorefinery location considering its impacts on natural resources. Therefore, a mixed integer linear programming (MILP) model has been developed, taking into account crop location and biomass production seasonality to obtain a proper location that minimizes environmental impact. The initial version of this paper was presented at the ICIL Conference in 2016.
Indirect control of corporations: analysis and simulations
(AGH University of Science and Technology Press, 2017) Stach, Izabella
This paper is devoted to the concept of indirect control in corporate shareholding networks. This topic is important in financial economics. Since shareholding size does not actually reflect an investor's power-control in corporate shareholding networks, diverse approaches to measuring the control-power of investors has been proposed. We focus in particular on a game-theoretical approach, specifically the model of Denti and Prati (2001) and its implementation to control sharing analysis and simulation in shareholding networks thanks to the computer program »Control Sharing Simulation«.
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
(AGH University of Science and Technology Press, 2017) Duraj, Szymon; Kopeć, Paweł; Kubale, Marek; Pikies, Tytus
In this paper, we consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard, we show that our problem can be solved to optimality in polynomial time under some restrictions imposed on the number of machines, their speeds, and the structure of the incompatibility graph. The theoretical considerations are accompanied by computer experiments with a certain model of scheduling.