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

Recommendations

Online algorithms for batch machines scheduling with delivery times
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
Online batch scheduling on parallel machines with delivery times
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
Online unbounded batch scheduling on parallel machines with delivery times

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
scientific article; zbMATH DE number 44978 (Why is no real title available?)
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
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
Scheduling a batching machine
Scheduling one batch processor subject to job release dates

Cited in

(30)

On-line integrated production-distribution scheduling problems with capacitated deliveries
Online scheduling with delivery time on a bounded parallel batch machine with limited restart
Batching and delivery in semi-online distribution systems
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
Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
Online unbounded batch scheduling on parallel machines with delivery times
Semi-online two-level supply chain scheduling problems
On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
Online NDP-constraint scheduling of jobs with delivery times or weights
On-line algorithms for minimizing makespan on batch processing machines
Online batch scheduling with known information in advance
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
Single batch machine scheduling with deliveries
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
Online Single Machine Batch Scheduling
On-Line Scheduling In Assembly Processes
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
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time

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

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