The more efficient use of by-product gas has always been a hot issue in the iron and steel making process. The gas generated during production process is stochastic and hardly predicted accurately. Specifically, how to regulate the supply of by-product gas from gas holder to power plant in the scheduling period to maximize the total profit of gas reutilization is present work. In response to this objective, online algorithm will be applied here to analyses the optimal strategy, which manages the by-product gas supply scheduling in term of online strategy and competitive analysis. We give the competitive ratio’s lower bound of the problem, and analyze the properties of algorithms, then give the QEW-algorithm with a competitive ratio equals to γ/(γ-β). The results of the study have guiding significance and reference value to decision makers facing the actual production process.
This paper studies two parallel machine scheduling with a non-clairvoyantdisruption such that there happens one disruption on one machine at time 0 and its du-ration length can only be known at its end. As in [1], we introduce transportation timein the environment of disruption, aiming to minimize the maximum deviation of jobs'planned and actual completion times. We adopt online theory to describe the problemand focus on the case of unit length of job. We rst show that a greedily waiting strategyis 2-competitive. Our main result is a 3/2-competitive strategy BD which makes useof job transportation. We also prove a matching lower bound, implying that BD is anoptimal strategy.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.