Jackson's pseudo-preemptive schedule and cumulative scheduling problems
From MaRDI portal
Publication:705501
DOI10.1016/j.dam.2003.09.009zbMath1058.90023MaRDI QIDQ705501
Publication date: 31 January 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.09.009
90B35: Deterministic scheduling theory in operations research
Related Items
Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates, Explaining the \texttt{cumulative} propagator, Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem, Redundant cumulative constraints to compute preemptive bounds, Lower bounds for the event scheduling problem with consumption and production of resources
Cites Work
- Unnamed Item
- Unnamed Item
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- The one-machine sequencing problem
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- A branch and bound algorithm for the job-shop scheduling problem
- Adjustment of heads and tails for the job-shop problem
- Nearly on line scheduling of preemptive independent tasks
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Une méthode arborescente pour résoudre les problèmes cumulatifs
- An Algorithm for Solving the Job-Shop Problem
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Minimizing maximum lateness on one machine: computational experience and some applications
- Some simple scheduling algorithms
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Optimal Preemptive Scheduling on Two-Processor Systems
