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
Operations Research Letters
Computers and Industrial Engineering
Energetic reasoning revisited: application to parallel machine scheduling
Journal of Scheduling
Discrete Applied Mathematics
An effective heuristic for flexible job-shop scheduling problem with maintenance activities
Computers and Industrial Engineering
Hi-index | 0.04 |
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, NCinc||Cmax and P|rj,qj|Cmax.