On-line scheduling with delivery time on a single batch machine

DOI10.1016/J.TCS.2006.12.001zbMath1162.90405OpenAlexW1980077610MaRDI QIDQ1022586

Jinjiang Yuan, Ji Tian, Ruyan Fu

Publication date: 22 June 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.001

zbMATH Keywords

single machinecompetitive ratioon-line algorithmdelivery timeparallel batching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Queues and service in operations research (90B22)

Related Items (18)

A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times ⋮ Online scheduling with delivery time on a bounded parallel batch machine with limited restart ⋮ Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ 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 ⋮ Online NDP-constraint scheduling of jobs with delivery times or weights ⋮ Semi-online two-level supply chain scheduling problems ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ 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 ⋮ Single-machine online scheduling of jobs with non-delayed processing constraint ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ On-line integrated production-distribution scheduling problems with capacitated deliveries ⋮ Online scheduling on a single machine with linear deteriorating processing times and delivery times ⋮ Online unbounded batch scheduling on parallel machines with delivery times

Cites Work

• Unnamed Item
• Scheduling a batching machine
• Approximation algorithms in batch processing
• Scheduling one batch processor subject to job release dates
• On-line scheduling algorithms for a batch machine with finite capacity
• On-line algorithms for minimizing makespan on batch processing machines
• PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine

This page was built for publication: On-line scheduling with delivery time on a single batch machine