Online NDP-constraint scheduling of jobs with delivery times or weights
From MaRDI portal
Publication:2693783
DOI10.1007/S11590-022-01889-3OpenAlexW4280513424MaRDI QIDQ2693783FDOQ2693783
Authors: Hailing Liu, Wenjie Li 
Publication date: 24 March 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-022-01889-3
Recommendations
- Single-machine online scheduling of jobs with non-delayed processing constraint
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Optimal on-line algorithms for single-machine scheduling
- An optimal online algorithm for single machine scheduling with bounded delivery times
- A best on-line algorithm for single machine scheduling with small delivery times
Cites Work
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- Optimal on-line algorithms for one batch machine with grouped processing times
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- On-line scheduling on a single machine: Maximizing the number of early jobs
- Online scheduling with reassignment
- On-line scheduling with delivery time on a single batch machine
- An optimal online algorithm for single machine scheduling with bounded delivery times
- A best on-line algorithm for single machine scheduling with small delivery times
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- Title not available (Why is that?)
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- Single-machine online scheduling of jobs with non-delayed processing constraint
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
This page was built for publication: Online NDP-constraint scheduling of jobs with delivery times or weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693783)
