A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications

by   Arnaud Malapert, et al.

This paper considers the scheduling of job families on parallel machines with time constraints on machine qualifications. In this problem, each job belongs to a family and a family can only be executed on a subset of qualified machines. In addition, machines can lose their qualifications during the schedule. Indeed, if no job of a family is scheduled on a machine during a given amount of time, the machine loses its qualification for this family. The goal is to minimize the sum of job completion times, i.e. the flow time, while maximizing the number of qualifications at the end of the schedule. The paper presents a new Constraint Programming (CP) model taking more advantages of the CP feature to model machine disqualifications. This model is compared with two existing models: an Integer Linear Programming (ILP) model and a Constraint Programming model. The experiments show that the new CP model outperforms the other model when the priority is given to the number of disqualifications objective. Furthermore, it is competitive with the other model when the flow time objective is prioritized.


page 1

page 2

page 3

page 4


Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem

This paper studies the scheduling of jobs of different families on paral...

Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations

This paper considers the integrated problem of quay crane assignment, qu...

A Constraint Programming-based Job Dispatcher for Modern HPC Systems and Applications

Constraint Programming (CP) is a well-established area in AI as a progra...

A Constraint Programming Approach for Non-Preemptive Evacuation Scheduling

Large-scale controlled evacuations require emergency services to select ...

Solving the Extended Job Shop Scheduling Problem with AGVs – Classical and Quantum Approaches

The subject of Job Scheduling Optimisation (JSO) deals with the scheduli...

Constraint Programming and Constructive Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setups and Common Servers

This paper examines scheduling problem denoted as P|seq, ser|C_max in Gr...

Joint Machine-Transporter Scheduling for Multistage Jobs with Adjustable Computation Time

This paper presents a scalable solution with adjustable computation time...

Please sign up or login with your details

Forgot password? Click here to reset