Jackson's pseudo-preemptive schedule and cumulative scheduling problems
From MaRDI portal
(Redirected from Publication:705501)
Recommendations
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- scientific article; zbMATH DE number 1059311
- Jackson's semi-preemptive scheduling on a single machine
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Une méthode arborescente pour résoudre les problèmes cumulatifs
Cites work
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- scientific article; zbMATH DE number 3780551 (Why is no real title available?)
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- A branch and bound algorithm for the job-shop scheduling problem
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Adjustment of heads and tails for the job-shop problem
- An Algorithm for Solving the Job-Shop Problem
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Minimizing maximum lateness on one machine: computational experience and some applications
- Nearly on line scheduling of preemptive independent tasks
- Optimal Preemptive Scheduling on Two-Processor Systems
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Some simple scheduling algorithms
- The one-machine sequencing problem
- Une méthode arborescente pour résoudre les problèmes cumulatifs
Cited in
(11)- Explaining the \texttt{cumulative} propagator
- Jackson's semi-preemptive scheduling on a single machine
- Measuring the slack between lower bounds for scheduling on parallel machines
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
- Lower bounds for the event scheduling problem with consumption and production of resources
- Redundant cumulative constraints to compute preemptive bounds
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
This page was built for publication: Jackson's pseudo-preemptive schedule and cumulative scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705501)
