Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
From MaRDI portal
Publication:4016707
DOI10.1287/moor.17.1.22zbMath0781.90052MaRDI QIDQ4016707
David B. Shmoys, Leslie A. Hall
Publication date: 16 January 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2092a7e80e805bb7211c8b6b979887c799ff90d8
release dates; precedence constraints; delivery times; one machine; polynomial approximation schemes
90B35: Deterministic scheduling theory in operations research
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times, Machine scheduling with transportation considerations, Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination, Resource leveling in a machine environment, Machine scheduling with deliveries to multiple customer locations, Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval, Jackson's semi-preemptive scheduling on a single machine, Approximation algorithms for single machine scheduling with one unavailability period, Approximation algorithms for scheduling a single machine to minimize total late work, Approximability of flow shop scheduling, An approximation algorithm for a single-machine scheduling problem with release times and delivery times, A note on generalizing the maximum lateness criterion for scheduling, Preemptive scheduling with release dates, delivery times and sequence independent setup times, Heuristics for parallel machine scheduling with delivery times, An open shop scheduling problem with a non-bottleneck machine, A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\), Scheduling with job release dates, delivery times and preemption penalties, A linear time approximation scheme for makespan minimization in an open shop with release dates, Machine scheduling with job delivery coordination, A sequencing problem with family setup times, Coordinating multi-location production and customer delivery, The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine, Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints, A survey of scheduling with controllable processing times, An approximate decomposition algorithm for scheduling on parallel machines with heads and tails, Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times, A best on-line algorithm for single machine scheduling with small delivery times, Online Scheduling on Two Parallel Machines with Release Times and Delivery Times, Integration of finished goods batch delivery into production scheduling via total tardiness minimization, SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
