A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times

DOI10.1007/S10878-007-9108-YMaRDI QIDQ841603zbMATH OpenOpenAlexFDO

Authors Jinjiang Yuan, Shisheng Li, Ji Tian, Ruyan Fu

Publication date 18 September 2009

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-007-9108-y

zbMATH Keywords

delivery timeon-line algorithmparallel-batchingscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
• An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
• A best on-line algorithm for single machine scheduling with small delivery times
• 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
• Online scheduling with delivery time on a bounded parallel batch machine with limited restart
• Online batch scheduling on parallel machines with delivery times
• A best possible on-line algorithm for scheduling on uniform parallel-batch machines
• Online algorithms for batch machines scheduling with delivery times
• An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart

Cites work

• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
• Approximation algorithms in batch processing
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• On-line algorithms for minimizing makespan on batch processing machines
• On-line scheduling algorithms for a batch machine with finite capacity
• On-line scheduling with delivery time on a single batch machine
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling a batching machine
• Scheduling one batch processor subject to job release dates
• Separating online scheduling algorithms with the relative worst order ratio

Cited in

(25)

• 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 with delivery time on a bounded parallel batch machine with limited restart
• Online scheduling on a single machine with grouped processing times
• Parallel-batch scheduling with two models of deterioration to minimize the makespan
• An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
• Single-machine online scheduling of jobs with non-delayed processing constraint
• Online scheduling on a single machine with linear deteriorating processing times and delivery times
• Online scheduling on a parallel batch machine with delivery times and limited restarts
• Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery
• Online unbounded batch scheduling on parallel machines with delivery times
• Online scheduling on two parallel machines with release dates and delivery times
• A best on-line algorithm for single machine scheduling with small 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
• On-line algorithms for minimizing makespan and maximum delivery time on a single serial batch machine
• On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost
• Online scheduling on bounded parallel-batch machines
• 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 incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery
• Online over time scheduling on parallel-batch machines: a survey
• Online algorithms for batch machines scheduling with delivery times
• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
• Dynamic batching of online arrivals to leverage economies of scale

This page was built for publication: A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841603)