Exact Algorithms for Scheduling Problems on Parallel Identical Machines with Conflict Jobs

by   Minh Hoàng Hà, et al.

Machine scheduling problems involving conflict jobs can be seen as a constrained version of the classical scheduling problem, in which some jobs are conflict in the sense that they cannot be proceeded simultaneously on different machines. This conflict constraint naturally arises in several practical applications and has recently received considerable attentions in the research community. In fact, the problem is typically NP-hard (even for approximation) and most of algorithmic results achieved so far have heavily relied on special structures of the underlying graph used to model the conflict-job relation. Our focus is on three objective functions: minimizing the makespan, minimizing the weighted summation of the jobs' completion time, and maximizing the total weights of completed jobs; the first two of which have been intensively studied in the literature. For each objective function considered, we present several mixed integer linear programming models and a constraint programming model, from which we can solve the problems to optimality using dedicated solvers. Binary search-based algorithms are also proposed to solve the makespan problem. The results of numerical experiments performed on randomly generated data sets with up to 32 jobs and 6 machines are reported and analysed to verify the performance of the proposed methods.


page 1

page 2

page 3

page 4


Maximising the total weight of on-time jobs on parallel machines subject to a conflict graph

The paper considers scheduling on parallel machines under the constraint...

Compatibility graphs in scheduling on batch processing machines

We consider the problem of minimizing the makespan on batch processing i...

Total Completion Time Minimization for Scheduling with Incompatibility Cliques

This paper considers parallel machine scheduling with incompatibilities ...

Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines

We consider the problem of scheduling a set of jobs on a set of identica...

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

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

Power of Pre-Processing: Production Scheduling with Variable Energy Pricing and Power-Saving States

This paper addresses a single machine scheduling problem with non-preemp...

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