PRODUCTION PLANNING OF OIL-REFINERY UNITS FOR THE FUTURE FUEL MARKET IN BRAZILAlkis Vazacopoulos
The oil industry in Brazil has accounted for US$ 300 billion in investments over the last 10 years and further expansions are planned in order to supply the needs of the future fuel market in terms of both quantity and quality. This work analyzes the Brazilian fuel production and market scenarios considering the country’s planned investments to prevent fuel deficit of around 30% in 2020. A nonlinear (NLP) operational planning model and a mixed-integer nonlinear (MINLP) investment planning model are proposed to predict the national overall capacity for different oil-refinery units aggregated in one hypothetical large refinery considering four possible future market scenarios. For the multi-refinery case, a phenomenological decomposition heuristic (PDH) method solves separated the quantity and logic variables in a mixed-integer linear (MILP) model, and the quantity and quality variables in an NLP model. Iteratively, the NLP model is restricted by the MILP results.
PRODUCTION PLANNING OF OIL-REFINERY UNITS FOR THE FUTURE FUEL MARKET IN BRAZILAlkis Vazacopoulos
The oil industry in Brazil has accounted for US$ 300 billion in investments over the last 10 years and further expansions are planned in order to supply the needs of the future fuel market in terms of both quantity and quality. This work analyzes the Brazilian fuel production and market scenarios considering the country’s planned investments to prevent fuel deficit of around 30% in 2020. A nonlinear (NLP) operational planning model and a mixed-integer nonlinear (MINLP) investment planning model are proposed to predict the national overall capacity for different oil-refinery units aggregated in one hypothetical large refinery considering four possible future market scenarios. For the multi-refinery case, a phenomenological decomposition heuristic (PDH) method solves separated the quantity and logic variables in a mixed-integer linear (MILP) model, and the quantity and quality variables in an NLP model. Iteratively, the NLP model is restricted by the MILP results.
Chronological Decomposition Heuristic: A Temporal Divide-and-Conquer Strateg...Alkis Vazacopoulos
The chronological decomposition heuristic (CDH) is a simple divide-and-conquer strategy intended to find rapidly, integer-feasible solutions to production scheduling optimization problems of practical scale. It is not an exact algorithm in that it will not find the global optimum although it does use either branch-and-bound or branch-and-cut. The CDH is specifically designed for production scheduling optimization problems which are formulated using a uniform discretization of time where a time grid is pre-specified with fixed time-period spacing. The basic premise of the CDH is to slice the scheduling time horizon into aggregate time-intervals or “time-chunks” which are some multiple of the base time-period. Each time-chunk is solved using mixed-integer linear programming (MILP) techniques starting from the first time-chunk and moving forward in time using the technique of chronological backtracking if required (Marriott and Stuckey, 1998; for more details see the extensive literature on constraint logic programming). The efficiency of the heuristic is that it decomposes the temporal dimension into smaller size time-chunks which are solved in succession instead of solving one large problem over the entire scheduling horizon. The basic idea of such a decomposition strategy was partially presented in Bassett et. al. (1996) whereby they provided a hierarchical interaction or collaboration between a planning layer and a temporally decomposed scheduling layer. For the CDH, we focus on the time-based decomposition of the scheduling layer without the need for a higher-level coordinating or planning layer.
For many industrial size problems, solving the MILP using commercial branch-and-bound or branch-and-cut optimization can be a somewhat futile exercise even for well-formulated problems of practical interest. Instead, many researchers such as Kudva et. al. (1994), Wolsey (1998), Nott and Lee (1999), Blomer and Gunther (2000) and Kelly (2002) have devised elaborate primal heuristic techniques to enable the solution of problems of large scale and complexity; these techniques can also be augmented by other decomposition strategies such as Lagrangean and Bender’s relaxation. Unfortunately with these heuristics global optimality or even global feasibility cannot be guaranteed, however these methods and others not mentioned, have proven useful for problems which are sometimes too large to be solved using conventional methods alone. Therefore, the CDH should be considered as a step in the direction of aiding the scheduling user in finding integer-feasible solutions of reasonable quality quickly.
Greece luxury hotel lichnos beach pargaDiana George
Greece Luxury Hotels: Parga, Lichnos Beach Hotel - http://www.lichnosbeach.gr - an Ionian sea destination between Ionian Islands. Parga's charm is that it's a very traditional town, but surrounded by spectacular landscapes and green nature. Lichnos Beach Hotel Resort on the beach, offers luxury accommodation and apartments-bungalows for any visitors: from couples for romantic holidays to families, who can enjoy children-friendly swimming pool in the green area and experience fine dinning, providing high quality of Greek cuisine. Discover Parga, discover Greece in the most beautiful surroundings!
Software project management and quality control
- A quality management framework based on statistic process control
- This framework transform social process into engineering process to leverage existing engineering process control tool and technique
- There are more than for ERP project backlog sample attached.
2017/01/23【F2E&RGBA Meetup】所分享的內容
簡介:
PWA (Progressive Web App) 是 Google 在 2015 年所提出的概念,2016 年我們開始看到許多 PWA 應用像是 The Washington Post、Flipkart、Gmail、AliExpress、Wikipedia、Flipboard、Booking 等實務案例,本次分享將介紹 PWA 與 HTML5 Offline API 搭配 Service Worker,讓我們的網站在離線的時候還能夠進行瀏覽,打造出更好的用戶體驗。
活動網址:
http://f2e.kktix.cc/events/f2e6-56d17c-0f9e5b-3997b7-a9203f-d684fd-886f38