Single-machine online scheduling of jobs with non-delayed processing constraint
From MaRDI portal
Publication:2045026
DOI10.1007/s10878-021-00722-4zbMath1473.90069OpenAlexW3137929948MaRDI QIDQ2045026
Publication date: 11 August 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00722-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single machine scheduling with two competing agents and equal job processing times
- 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 over time scheduling on parallel-batch machines: a survey
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- On no-wait and no-idle flow shops with makespan criterion
- On-line scheduling with delivery time on a single batch machine
- An optimal online algorithm for single machine scheduling with bounded delivery times
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- A survey of scheduling problems with no-wait in process
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- A best on-line algorithm for single machine scheduling with small delivery times
- Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
This page was built for publication: Single-machine online scheduling of jobs with non-delayed processing constraint
