Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
From MaRDI portal
Recommendations
- Theoretical expectation versus practical performance of Jackson's heuristic
- A 1. 47-approximation for a preemptive single-machine scheduling problem
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Jackson's semi-preemptive scheduling on a single machine
Cited in
(58)- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- Machine scheduling with deliveries to multiple customer locations
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Scheduling a single machine with primary and secondary objectives
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- Machine scheduling with transportation considerations
- Scheduling Algorithms for Single Machine Problem with Release and Delivery Times
- Heuristics for parallel machine scheduling with delivery times
- A sequencing problem with family setup times
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Jackson's semi-preemptive scheduling on a single machine
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- Machine scheduling with job delivery coordination
- Coordinating multi-location production and customer delivery
- Integrated scheduling of production and distribution with release dates and capacitated deliveries
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
- A new structural parameter on single machine scheduling with release dates and deadlines
- Parallel shifting bottleneck algorithms for non-permutation flow shop scheduling
- An open shop scheduling problem with a non-bottleneck machine
- Integration of finished goods batch delivery into production scheduling via total tardiness minimization
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- A linear time approximation scheme for makespan minimization in an open shop with release dates
- On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- Approximation algorithms for single machine scheduling with one unavailability period
- Flow shop scheduling problems with transportation constraints revisited
- Flow shop scheduling problems with transportation constraints revisited
- A survey of scheduling with controllable processing times
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
- Online scheduling on two parallel machines with release times and delivery times
- A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
- Theoretical expectation versus practical performance of Jackson's heuristic
- Resource leveling in a machine environment
- Scheduling with job release dates, delivery times and preemption penalties
- Minimizing maximum tardiness and delivery costs with batch delivery and job release times
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times
- Minimizing the maximum lateness for scheduling with release times and job rejection
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
- A note on generalizing the maximum lateness criterion for scheduling
- Theoretical and practical issues in single-machine scheduling with two job release and delivery times
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
- Approximability of flow shop scheduling
- Preemptive scheduling with release dates, delivery times and sequence independent setup times
- Parallel machine scheduling with nested processing set restrictions and job delivery times
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
- Single-machine time-dependent scheduling with proportional and delivery times
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times
- Online scheduling on two parallel machines with release dates and delivery times
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
- A best on-line algorithm for single machine scheduling with small delivery times
- Approximation algorithms for scheduling a single machine to minimize total late work
This page was built for publication: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016707)
