A practical use of Jackson's preemptive schedule for solving the job shop problem
From MaRDI portal
Recommendations
- An optimal method for the preemptive job shop scheduling problem
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems
- Preemptive job-shop scheduling problems with a fixed number of jobs
- Resource constraints for preemptive job-shop scheduling
- Job shop scheduling with setup times, deadlines and precedence constraints
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
- Shop scheduling problems under precedence constraints
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- A Computational Study of the Job-Shop Scheduling Problem
- A new approach to computing optimal schedules for the job-shop scheduling problem
Cited in
(54)- Hybrid rollout approaches for the job shop scheduling problem
- Non-binary quantified CSP: Algorithms and modelling
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
- Two branch and bound algorithms for the permutation flow shop problem
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling
- The job shop scheduling problem: Conventional and new solution techniques
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- A branch and bound algorithm for the job-shop scheduling problem
- The job-shop problem and immediate selection
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
- Adjustment of heads and tails for the job-shop problem
- Evolution based learning in a job shop scheduling environment
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Constraint propagation techniques for the disjunctive scheduling problem
- On not-first/not-last conditions in disjunctive scheduling
- A new LP-based lower bound for the cumulative scheduling problem
- Constraint programming and operations research
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Deterministic job-shop scheduling: Past, present and future
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- Job-shop scheduling with blocking and no-wait constraints
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A branch \& bound method for the general-shop problem with sequence dependent setup-times
- Flow shop scheduling with heterogeneous workers
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- A hybrid genetic algorithm for the job shop scheduling problem
- Sweep synchronization as a global propagation mechanism
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
- Modeling with metaconstraints and semantic typing of variables
- Immersed NURBS for CFD applications
- Depth-first heuristic search for the job shop scheduling problem
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- A new approach to computing optimal schedules for the job-shop scheduling problem
- An optimal method for the preemptive job shop scheduling problem
- Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- Inequality-sum: a global constraint capturing the objective function
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A job-shop problem with one additional resource type
- Scheduling and constraint propagation
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems
- Solving an integrated job-shop problem with human resource constraints
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- Exact method for the two-machine flow-shop problem with time delays
- Energetic reasoning revisited: Application to parallel machine scheduling
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
- Arc-B-consistency of the inter-distance constraint
- New single machine and job-shop scheduling problems with availability constraints
- Jackson's semi-preemptive scheduling on a single machine
This page was built for publication: A practical use of Jackson's preemptive schedule for solving the job shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922282)
