An Efficient Proactive-Reactive Scheduling Approach to Hedge Against Shop Floor Disturbances

Aloulou, Mohamed Ali; Portmann, Marie-Claude

doi:10.1007/0-387-27744-7_11

Cited by 22 publications

(41 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As already considered in previous studies [1,2,3,4,5,6,7], this can be achieved by providing sequential flexibility. Sequential flexibility lies in defining only a partial order of the operations on each machine, leaving to the end-user the possibility to make the remaining sequencing decisions.…”

Section: Introductionmentioning

confidence: 99%

Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case

Aloulou

Artigues

2010

Computers & Operations Research

Self Cite

View full text Add to dashboard Cite

We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work is to provide the decision-maker a characterization of possible modifications of the predictive schedule while preserving optimality. In the context of machine scheduling, the anticipated modifications are changes in the predictive order of operations on the machines. To achieve this goal, a flexible solution feasible w.r.t to operations deadlines, is provided instead of a single predictive schedule. A flexible solution represents a set of semi-active schedules and is characterized by a partial order on each machine, so that the total order can be set on-line, as required by the decision maker. A flexible solution is feasible if all the complete schedules that can be obtained by extension are also feasible.In this paper we develop two main issues. The first one concerns the evaluation of a flexible solution in the worst case allowing to certify if the solution is feasible. The second issue is the computation of feasible (w.r.t deadlines) flexible solutions of maximal flexibility imposed by the decision maker. Under an epsilon-constraint framework, solving this problem allows to find compromise solutions for the flexibility criterion and any minmax regular scheduling criterion. The special case of the flow-shop scheduling problem is studied and computational experiments are carried out.

show abstract

Section: Introductionmentioning

confidence: 99%

Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case

Aloulou

Artigues

2010

Computers & Operations Research

Self Cite

View full text Add to dashboard Cite

show abstract

“…Cesta et al [19], Schwindt [85], Herroelen & Leus [42], Lambrechts et al [62] utilizan medidas relacionadas con la holgura libre de las actividades como medida surrogada de la robustez de la solución. Otro enfoque es el de Policella [80] o Aloulou & Portmann [5] que calculan la flexibilidad de la solución por medio de la cantidad de actividades no relacionadas entre si.…”

Section: Tipos De Robustez Y Medidasunclassified

“…En todos casos, los problemas con valores inferiores de la complejidad de la red permiten la generación de secuencias estables. Este resultado es el esperado, al tener en cuenta que entre menos relacionadas estén las actividades más flexible pueden ser las programaciones, tal como se plantea en la medida de flexibilidad de Aloulu & Portman (2003) [5] presentada en la sección 2.4.1.…”

Section: Complejidad De La Redunclassified

Nuevos métodos meta heurísticos para la asignación eficiente, optimizada y robusta de recursos limitados

Posada¹,

Margarita²

View full text Add to dashboard Cite

“…All objective functions are the completion times of the activities. Let us consider additional precedence constraints {(1, 3), (1,5), (1, 7), (3,7), (2,4), (2,6), (6,8)}. We obtain the disjunctive graph G displayed in Figure 1.…”

Section: Problem Settingmentioning

confidence: 99%

“…This paper addresses the problem of providing more flexibility than the classical temporal one in disjunctive scheduling problems where the objective is to minimize a regular minmax objective function. As already considered in previous studies [2,3,5,6,7,12], this can be achieved by defining only a partial order of the operations on each machine, leaving to the end-user the possibility to make the remaining sequencing decisions. This is the principle of the groups of permutable operations model that has been studied by several authors [3,5,6,7,12].…”

Section: Introductionmentioning

confidence: 99%

Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems

Aloulou

Artigues

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we consider the problem of evaluating the worst case performance of flexible solutions in non-preemptive disjunctive scheduling. A flexible solution represents a set of semi-active schedules and is characterized by a partial order on each machine. A flexible solution can be used on-line to absorb the impact of some data disturbances related for example to job arrival, tool availability and machine breakdowns. Providing a flexible solution is useful in practice only if it can be assorted with an evaluation of the complete schedules that can be obtained by extension. For this purpose, we suggest to use only the best case and the worst case performance. The best case performance is an ideal performance that can be achieved only if the on-line conditions allow to implement the best schedule among the set of schedules characterized by the flexible solution. In contrast, the worst case performance indicates how poorly the flexible solution may perform. These performances can be obtained by solving corresponding minimization and maximization problems. We focus here on maximization problems when a regular minmax objective function is considered. In this case, the worse objective function value can be determined by computing the worse completion time of each operation separately. We show that this problem can be solved by finding an elementary longest path in the disjunctive graph representing the problem with additional constraints. In the special case of the flow-shop problem with release dates and additional precedence constraints, we give a polynomial algorithm that determines the worst case performance of a flexible solution.

show abstract

An Efficient Proactive-Reactive Scheduling Approach to Hedge Against Shop Floor Disturbances

Cited by 22 publications

References 13 publications

Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case

Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case

Nuevos métodos meta heurísticos para la asignación eficiente, optimizada y robusta de recursos limitados

Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems

Contact Info

Product

Resources

About