References of "Ronconi, Débora P"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailMixed Integer Linear Programming and Constraint Programming Models for the Online Printing Shop Scheduling Problem
Tessaro Lunardi, Willian UL; Birgin, Ernesto G.; Laborie, Philippe et al

in Computers and Operations Research (2020)

In this work, the online printing shop scheduling problem is considered. This challenging real problem, that appears in the nowadays printing industry, can be seen as a flexible job shop scheduling ... [more ▼]

In this work, the online printing shop scheduling problem is considered. This challenging real problem, that appears in the nowadays printing industry, can be seen as a flexible job shop scheduling problem with sequence flexibility in which precedence constraints among operations of a job are given by an arbitrary directed acyclic graph. In addition, several complicating particularities such as periods of unavailability of the machines, resumable operations, sequence-dependent setup times, partial overlapping among operations with precedence constraints, release times, and fixed operations are also present in the addressed problem. In the present work, mixed integer linear programming and constraint programming models for the minimization of the makespan are presented. Modeling the problem is twofold. On the one hand, the problem is precisely defined. On the other hand, the capabilities and limitations of a commercial software for solving the models are analyzed. Extensive numerical experiments with small- , medium-, and large-sized instances are presented. Numerical experiments show that the commercial solver is able to optimally solve only a fraction of the small-sized instances when considering the mixed integer linear programming model; while all small-sized and a fraction of the medium-sized instances are optimally solved when considering the constraint programming formulation of the problem. Moreover, the commercial solver is able to deliver feasible solutions for the large-sized instances that are of the size of the instances that appear in practice. [less ▲]

Detailed reference viewed: 69 (9 UL)
Full Text
See detailMetaheuristics for the Online Printing Shop Scheduling Problem - Supplementary Material
Tessaro Lunardi, Willian UL; Birgin, Ernesto G.; Ronconi, Débora P. et al

Report (2020)

This document presents further numerical results of the experiments concerning the classical instances of the flexible job shop scheduling problem, performed in (Lunardi et al., Metaheuristics for the ... [more ▼]

This document presents further numerical results of the experiments concerning the classical instances of the flexible job shop scheduling problem, performed in (Lunardi et al., Metaheuristics for the Online Printing Shop Scheduling Problem, submitted). Additionally, this document gathers the best makespan values (upper bounds and lower bounds) found by state-of-the-art algorithms. [less ▲]

Detailed reference viewed: 126 (32 UL)
Full Text
Peer Reviewed
See detailMetaheuristics for the Online Printing Shop Scheduling Problem
Tessaro Lunardi, Willian UL; Birgin, Ernesto G.; Ronconi, Débora P. et al

in European Journal of Operational Research (2020)

In this work, the online printing shop scheduling problem introduced in (Lunardi et al., Mixed Integer Linear Programming and Constraint Programming Models for the Online Printing Shop Scheduling Problem ... [more ▼]

In this work, the online printing shop scheduling problem introduced in (Lunardi et al., Mixed Integer Linear Programming and Constraint Programming Models for the Online Printing Shop Scheduling Problem, Computers & Operations Research, to appear) is considered. This challenging real scheduling problem, that emerged in the nowadays printing industry, corresponds to a flexible job shop scheduling problem with sequencing flexibility; and it presents several complicating specificities such as resumable operations, periods of unavailability of the machines, sequence-dependent setup times, partial overlapping between operations with precedence constraints, and fixed operations, among others. A local search strategy and metaheuristic approaches for the problem are proposed and evaluated. Based on a common representation scheme, trajectory and populational metaheuristics are considered. Extensive numerical experiments with large-sized instances show that the proposed methods are suitable for solving practical instances of the problem; and that they outperform a half-heuristic-half-exact off-the-shelf solver by a large extent. Numerical experiments with classical instances of the flexible job shop scheduling problem show that the introduced methods are also competitive when applied to this particular case. [less ▲]

Detailed reference viewed: 156 (14 UL)