An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
From MaRDI portal
Publication:423933
DOI10.1016/J.DAM.2011.12.002zbMATH Open1252.68051OpenAlexW2080477217MaRDI QIDQ423933FDOQ423933
Jinjiang Yuan, T. C. Edwin Cheng, Ji Tian, Chi To Ng
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.002
Recommendations
- Online batch scheduling on parallel machines with delivery times
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- On-line scheduling with delivery time on a single batch machine
- Online algorithms for batch machines scheduling with delivery times
Cites Work
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Title not available (Why is that?)
- Approximation algorithms in batch processing
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- On-line scheduling algorithms for a batch machine with finite capacity
- On-line algorithms for minimizing makespan on batch processing machines
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- 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 with delivery time on a single batch machine
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
Cited In (17)
- An improved approximation algorithm for single machine scheduling with job delivery
- Single-machine online scheduling of jobs with non-delayed processing constraint
- Online unbounded batch scheduling on parallel machines with delivery times
- Online over time scheduling on parallel-batch machines: a survey
- On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- On-line scheduling with delivery time on a single batch machine
- An optimal online algorithm for single machine scheduling with bounded delivery times
- Online scheduling on a parallel batch machine with delivery times and limited restarts
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
- Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery
- Online batch scheduling on parallel machines with delivery times
- Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery
- Online NDP-constraint scheduling of jobs with delivery times or weights
- Online scheduling on a single machine with linear deteriorating processing times and delivery times
- A best on-line algorithm for single machine scheduling with small delivery times
This page was built for publication: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423933)
