A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
From MaRDI portal
Publication:4943704
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)
Related Items (47)
Lower bounds for on-line single-machine scheduling. ⋮ Online integrated production-distribution scheduling problems without preemption ⋮ Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart ⋮ Optimally competitive list batching ⋮ A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times ⋮ Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness ⋮ A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME ⋮ Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time ⋮ On-line supply chain scheduling problems with preemption ⋮ Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery ⋮ Competitive analysis of preemptive single-machine scheduling ⋮ An on-line scheduling problem of parallel machines with common maintenance time ⋮ An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown ⋮ Online Single Machine Scheduling to Minimize the Maximum Starting Time ⋮ Optimal on-line algorithms for one batch machine with grouped processing times ⋮ An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times ⋮ An improved on-line algorithm for single parallel-batch machine scheduling with delivery times ⋮ A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production ⋮ Online NDP-constraint scheduling of jobs with delivery times or weights ⋮ Semi-online two-level supply chain scheduling problems ⋮ On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time ⋮ 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 scheduling on a single machine with grouped processing times ⋮ Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Best semi-online algorithms for unbounded parallel batch scheduling ⋮ A best on-line algorithm for single machine scheduling with small delivery times ⋮ Integrated production and delivery scheduling on a serial batch machine to minimize the makespan ⋮ On-line scheduling to minimize average completion time revisited. ⋮ Online batch scheduling on parallel machines with delivery times ⋮ An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time ⋮ Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery ⋮ Integrated scheduling of production and distribution with release dates and capacitated deliveries ⋮ Single-machine online scheduling of jobs with non-delayed processing constraint ⋮ 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 ⋮ Online scheduling on a single machine with linear deteriorating processing times and delivery times ⋮ Restarts can help in the on-line minimization of the maximum delivery time on a single machine ⋮ Online Scheduling on Two Parallel Machines with Release Times and Delivery Times ⋮ A new dynamic look-ahead scheduling procedure for batching machines ⋮ A note on on-line scheduling with precedence constraints on identical machines ⋮ Online unbounded batch scheduling on parallel machines with delivery times ⋮ Online scheduling on two parallel machines with release dates and delivery times ⋮ Randomized algorithms for on-line scheduling problems: How low can't you go?
This page was built for publication: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
