A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine

DOI10.1137/S0895480196296823zbMath0944.90020MaRDI QIDQ4943704

No author found.

Publication date: 19 March 2000

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

single-machine scheduling; on-line algorithm; worst-case analysis

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

An on-line scheduling problem of parallel machines with common maintenance time, Optimal on-line algorithms for one batch machine with grouped processing times, An improved on-line algorithm for single parallel-batch machine scheduling with delivery times, Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs, Optimal algorithms for online single machine scheduling with deteriorating jobs, Online over time scheduling on parallel-batch machines: a survey, Best semi-online algorithms for unbounded parallel batch scheduling, Competitive analysis of preemptive single-machine scheduling, On-line scheduling to minimize average completion time revisited., Online batch scheduling on parallel machines with delivery times, Optimally competitive list batching, A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times, On-line supply chain scheduling problems with preemption, An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time, On-line scheduling with delivery time on a single batch machine, Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead, An optimal online algorithm for single machine scheduling with bounded delivery times, On-line integrated production-distribution scheduling problems with capacitated deliveries, Restarts can help in the on-line minimization of the maximum delivery time on a single machine, A new dynamic look-ahead scheduling procedure for batching machines, A note on on-line scheduling with precedence constraints on identical machines, Randomized algorithms for on-line scheduling problems: How low can't you go?, Lower bounds for on-line single-machine scheduling., An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times, Integrated production and delivery scheduling on a serial batch machine to minimize the makespan, Online unbounded batch scheduling on parallel machines with delivery times, Online scheduling on two parallel machines with release dates and delivery times, Semi-online two-level supply chain scheduling problems, On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time, 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, A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME