Optimal parallel machines scheduling with availability constraints

Authors:
Anis Gharbi;Mohamed Haouari
Affiliations:
Combinatorial Optimization Research Group - ROI, Ecole Polytechnique de Tunisie, BP 743, 2078, La Marsa, Tunisia and Department of Applied Mathematics, Institut Supérieur d'Informatique, Aria ...;Combinatorial Optimization Research Group - ROI, Ecole Polytechnique de Tunisie, BP 743, 2078, La Marsa, Tunisia
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 5
Cited 4

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Parallel machines scheduling with nonsimultaneous machine available time

Discrete Applied Mathematics
A note on “parallel machine scheduling with non-simultaneous machine available time”

Discrete Applied Mathematics
An efficient fully polynomial approximation scheme for the Subset-Sum problem

Journal of Computer and System Sciences
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

Operations Research Letters

A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Genetic branch-and-bound or exact genetic algorithm?

EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Chromatic scheduling of 1- and 2-processor UET tasks on dedicated machines with availability constraints

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Offloading work to mobile devices: an availability-aware data partitioning approach

Proceedings of the First International Workshop on Middleware for Cloud-enabled Sensing

Quantified Score

Hi-index	0.04

Visualization

Abstract

We address a generalization of the classical multiprocessor scheduling problem with non simultaneous machine availability times, release dates, and delivery times. We develop new lower and upper bounds as well as a branching strategy which is based on a representation of a schedule as a permutation of jobs. We show that embedding a semi-preemptive lower bound based on max-flow computations in a branch-and-bound algorithm yields very promising performance. Computational experiments demonstrate that randomly generated instances with up to 700 jobs and 20 machines are solved within moderate CPU time. Moreover, the versatility of the proposed approach is assessed through its ability to solve large instances of two important particular cases P,NC"i"n"c||C"m"a"x and P|r"j,q"j|C"m"a"x.