Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
From MaRDI portal
Publication:1273117
DOI10.1023/A:1018968332237zbMath0911.90203OpenAlexW2337842618MaRDI QIDQ1273117
Publication date: 6 December 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018968332237
makespanlower boundparallel processorsresource constrained project schedulingJackson's pseudo preemptive scheduleparallel and identical processor scheduling
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Energetic reasoning revisited: Application to parallel machine scheduling, Theoretical expectation versus practical performance of Jackson's heuristic, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem, An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem, Lower bounds for the event scheduling problem with consumption and production of resources, Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods, An approximate decomposition algorithm for scheduling on parallel machines with heads and tails, An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem, Search tree based approaches for parallel machine scheduling, Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem, Scheduling with tails and deadlines, Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines., A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, A simulated annealing approach to minimize the maximum lateness on uniform parallel machines, Jackson's pseudo-preemptive schedule and cumulative scheduling problems, Optimal parallel machines scheduling with availability constraints, A new LP-based lower bound for the cumulative scheduling problem, Concurrent operations can be parallelized in scheduling multiprocessor job shop, Minimizing makespan on parallel machines subject to release dates and delivery times, An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
