TITLE

A 0–1 integer linear programming approach to schedule outages of nuclear power plants

AUTHOR(S)
Jost, V.; Savourey, D.
PUB. DATE
December 2013
SOURCE
Journal of Scheduling;Dec2013, Vol. 16 Issue 6, p551
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
We address the problem of planning outages of nuclear power plants submitted by EDF (Électricité De France) as the challenge EURO/ROADEF 2010. As our team won the first prize of the contest in the senior category, our approach may be of interest: it is conceptually simple, easy to program and computationally relatively fast. We present both our method and some ideas to improve it.
ACCESSION #
91944214

 

Related Articles

  • A genetic algorithm for the simultaneous lot sizing and scheduling problem in capacitated flow shop with complex setups and backlogging. Babaei, M.; Mohammadi, M.; Ghomi, S. // International Journal of Advanced Manufacturing Technology;Jan2014, Vol. 70 Issue 1-4, p125 

    In this paper the capacitated lot sizing and scheduling problem with sequence-dependent setups, setup carryover, and backlogging has been studied. The problem can be formulated as a mixed-integer program. Most lot sizing problems are hard to solve, especially in medium and large scale. In recent...

  • MineLib: a library of open pit mining problems. Espinoza, Daniel; Goycoolea, Marcos; Moreno, Eduardo; Newman, Alexandra // Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p93 

    Similar to the mixed-integer programming library (MIPLIB), we present a library of publicly available test problem instances for three classical types of open pit mining problems: the ultimate pit limit problem and two variants of open pit production scheduling problems. The ultimate pit limit...

  • Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP). Pinto, Gaby; Ben-Dov, Yariv; Rabinowitz, Gad // Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p311 

    The main motivation of this study is to provide, for the first time, a formulation and solution for a class of production scheduling problems (as in cluster tools) characterized mainly by resource collaboration to perform an operation and while allowing batches and considering alternative...

  • Robust Optimization of Schedules Affected by Uncertain Events. Vujanic, Robin; Goulart, Paul; Morari, Manfred // Journal of Optimization Theory & Applications;Dec2016, Vol. 171 Issue 3, p1033 

    In this paper, we present a new method for finding robust solutions to mixed-integer linear programs subject to uncertain events. We present a new modeling framework for such events that result in uncertainty sets that depend parametrically on the decision taken. We also develop results that can...

  • Tight MIP formulations of the power-based unit commitment problem. Morales-España, Germán; Gentile, Claudio; Ramos, Andres // OR Spectrum;Oct2015, Vol. 37 Issue 4, p929 

    This paper provides the convex hull description for the basic operation of slow- and quick-start units in power-based unit commitment (UC) problems. The basic operating constraints that are modeled for both types of units are (1) generation limits and (2) minimum up and down times. Apart from...

  • Task Rescheduling Model for Resource Disruption Problem in Unrelated Parallel Processor System. Nordina, Syarifah Zyurina; Caccettab, Lou // AIP Conference Proceedings;2014, Vol. 1605, p1086 

    In this paper, we concentrate on the scheduling problem with interruption occurs in the parallel processor system. The situation happens when the availability of the unrelated parallel processors in the time slot decreases in certain time periods and its define as resource disruption. Our...

  • Minimizing makespan in a group shop with fuzzy release dates and processing times. Ahmadizar, Fardin; Zarei, Alireza // International Journal of Advanced Manufacturing Technology;Jun2013, Vol. 66 Issue 9-12, p2063 

    This paper deals with a fuzzy group shop scheduling problem. The group shop scheduling problem is a general formulation that includes the flow shop, the job shop, and the open shop scheduling problems. Job release dates and processing times are considered to be triangular fuzzy numbers. The...

  • Mixed integer programming models for two identical parallel machines with a single server. Yong Zhan; Haitao Zhu; Yuguang Zhong // Advanced Materials Research;2014, Vol. 945-949, p3344 

    This paper addresses the problem of scheduling jobs on two identical parallel machines with a single server such that the makespan is minimized. Each job can be processed by either one of the two parallel machines, but before processing, a setup operation must be done by a single server. Two...

  • An Efficient Mathematical Model for a Generalized Production Process. Wei Weng; Cheng Chen; Gang Rong; Shigeru Fujimura // AIP Conference Proceedings;2015, Vol. 1648 Issue 1, p1 

    This study proposes an efficient mixed integer linear programming (MILP) model for a generalized job shop production process. In the process, a workstation contains one or multiple machines and each job visits some of the workstations in a specific sequence. It is allowed that a job visits the...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics