Metaheuristics for the Online Printing Shop Scheduling Problem

by   Willian T. Lunardi, et al.

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.


page 1

page 2

page 3

page 4


Job Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods

We introduce an open-source GitHub repository containing comprehensive b...

Large-Scale Benchmarks for the Job Shop Scheduling Problem

This report contains the description of two novel job shop scheduling be...

Dominance inequalities for scheduling around an unrestrictive common due date

The problem considered in this work consists in scheduling a set of task...

Models and Strategies for Variants of the Job Shop Scheduling Problem

Recently, a variety of constraint programming and Boolean satisfiability...

Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP

Many complex activities of production cycles, such as quality control or...

Tramp Ship Scheduling Problem with Berth Allocation Considerations and Time-dependent Constraints

This work presents a model for the Tramp Ship Scheduling problem includi...

Mixed-model Sequencing with Stochastic Failures: A Case Study for Automobile Industry

In the automotive industry, the sequence of vehicles to be produced is d...

Please sign up or login with your details

Forgot password? Click here to reset