-
Chapter and Conference Paper
Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness
We study the single machine scheduling problem under uncertain parameters, with the aim of minimizing the maximum lateness. More precisely, the processing times, the release dates and the delivery times of the...
-
Chapter and Conference Paper
Mixed-Integer Programming and Constraint Programming Models for the Flexible Job Shop Scheduling Problem
The flexible job-shop scheduling problem (FJSP) is considered as an important problem in the modern manufacturing system. It is one of the most difficult problems in this area. In fact, this problem is a gener...
-
Article
Exact algorithms for scheduling programs with shared tasks
We study a scheduling problem where the jobs we have to perform are composed of one or more tasks. If two jobs sharing a non-empty subset of tasks are scheduled on the same machine, then these shared tasks hav...
-
Article
Optimal solutions for online conversion problems with interrelated prices
We consider various online conversion problems with interrelated prices. The first variant is the online time series search problem with unknown bounds on the relative price change factors. We design the optim...
-
Article
Preface: New trends on combinatorial optimization for network and logistical applications
-
Article
Preface: Recent advances in multiple objective optimization and goal programming
-
Chapter and Conference Paper
Deep Hybrid Neural Networks with Improved Weighted Word Embeddings for Sentiment Analysis
Deep learning models such as Convolutional Neural Network (CNN) and Long Short-Term Memory (LSTM) models have recently emerged as effective solutions to various NLP tasks with comparatively remarkable results....
-
Article
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
We consider a multiobjective scheduling problem, with the aim of minimizing the maximum lateness and the makespan on two identical machines. In this problem, we are given a set J of n jobs to be scheduled on two ...
-
Chapter and Conference Paper
Exact Algorithms for Scheduling Programs with Shared Tasks
We study a scheduling problem where the jobs we have to perform are composed of one or more tasks. If two jobs sharing a non-empty subset of tasks are scheduled on the same machine, then these shared tasks hav...
-
Chapter and Conference Paper
Scheduling on Hybrid Platforms: Improved Approximability Window
Modern platforms are using accelerators in conjunction with standard processing units in order to reduce the running time of specific operations, such as matrix operations, and improve their performance. Sched...
-
Article
Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems
Public bicycle-sharing systems have been implemented in many big cities around the world to face many public transport problems. The exploitation and the management of such transportation systems imply crucial...
-
Article
Open AccessApproximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints
In this paper, we consider four single-machine scheduling problems with release times, with the aim of minimizing the maximum lateness. In the first problem we have a common deadline for all the jobs. The seco...
-
Article
On the m-clique free interval subgraphs polytope: polyhedral analysis and applications
In this paper we study the m-clique free interval subgraphs. We investigate the facial structure of the polytope defined as the convex hull of the incidence vectors associated with these subgraphs. We also presen...
-
Article
Industry Applications of Computational Intelligence
-
Chapter and Conference Paper
Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval
In this paper we consider the single machine scheduling problem with one non-availability interval to minimize the maximum lateness where jobs have positive tails. Two cases are considered. In the first one, t...
-
Chapter and Conference Paper
PSO for Job-Shop Scheduling with Multiple Operating Sequences Problem - JS
This paper focus on a complex problem of job shop scheduling where each jobs have a multiple possible operations sequences. The resolution of this type of problem has not been treated in the literature. To so...
-
Article
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
In this paper we deal with the single machine scheduling problem with one non-availability interval to minimize the maximum lateness where jobs have positive tails. Two cases are considered. In the first one, ...
-
Chapter and Conference Paper
Visual Interactive Approach for Mining Twitter’s Networks
Understanding the semantic behind relational data is very challenging, especially, when it is tricky to provide efficient analysis at scale. Furthermore, the complexity is also driven by the dynamical nature o...
-
Chapter and Conference Paper
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut
We consider the problem of unrelated parallel machines with precedence constraints (UPMPC), with the aim of minimizing the makespan. Each task has to be assigned to a unique machine and no preemption is allowe...
-
Chapter and Conference Paper
On the Community Identification in Weighted Time-Varying Networks
The community detection play an important role in understanding the information underlying to the graph structure, especially, when the graph structure or the weights between the linked entities change over ti...
