References of "Computers and Operations Research"
     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
Peer Reviewed
See detailAchieving super-linear performance in parallel multi-objective evolutionary algorithms by means of cooperative coevolution
Dorronsoro, Bernabé UL; Danoy, Grégoire UL; Nebro, Antonio J. et al

in Computers and Operations Research (2013), 40(6), 1552-1563

Detailed reference viewed: 130 (16 UL)
Full Text
Peer Reviewed
See detailSorting multiattribute alternatives: The TOMASO method
Marichal, Jean-Luc UL; Meyer, Patrick; Roubens, Marc

in Computers and Operations Research (2005), 32(4), 861-877

We analyze a recently proposed ordinal sorting procedure (Tomaso) for the assignment of alternatives to graded classes and we present a freeware constructed from this procedure. We illustrate it by two ... [more ▼]

We analyze a recently proposed ordinal sorting procedure (Tomaso) for the assignment of alternatives to graded classes and we present a freeware constructed from this procedure. We illustrate it by two examples, and do some testing in order to show its usefulness. [less ▲]

Detailed reference viewed: 127 (4 UL)
Peer Reviewed
See detailSingle Point Stochastic Search Algorithms for the Multi Level Lot Sizing Problem
Jeunet, Jully; Jonard, Nicolas UL

in Computers and Operations Research (2005), 32

Detailed reference viewed: 154 (4 UL)
Full Text
Peer Reviewed
See detailLogical foundation of fuzzy preferential systems with application to the electre decision aid methods
Bisdorff, Raymond UL

in Computers and Operations Research (2000), 27(7-8), 673-687

Detailed reference viewed: 70 (5 UL)