On-line algorithms for minimizing makespan on batch processing machines
From MaRDI portal
Recommendations
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line scheduling with delivery time on a single batch machine
- Optimal on-line algorithms for one batch machine with grouped processing times
Cited in
(80)- On-line scheduling with delivery time on a single batch machine
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- On-line integrated production-distribution scheduling problems with capacitated deliveries
- Approximation algorithms in batch processing
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- The medical laboratory scheduling for weighted flow-time
- Online batch scheduling with kind release times and incompatible families to minimize makespan
- Algorithms for on-line order batching in an order picking warehouse
- On-line scheduling a batch processing system to minimize total weighted job completion time
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- On-line scheduling algorithms for a batch machine with finite capacity
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- Online algorithms to schedule a proportionate flexible flow shop of batching machines
- Online scheduling of two-machine flowshop with lookahead and incompatible job families
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
- Online scheduling of incompatible unit-length job families with lookahead
- Stochastic scheduling on parallel machines to minimize discounted holding costs
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- Online unbounded batch scheduling on parallel machines with delivery times
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
- Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
- Research on the parallel-batch scheduling with linearly lookahead model
- Semi-online scheduling: a survey
- scientific article; zbMATH DE number 1629977 (Why is no real title available?)
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
- Online batch scheduling with known information in advance
- Optimal semi-online algorithm for scheduling on two parallel batch processing machines
- On-line batch scheduling with real time on two parallel machines
- An on-line algorithm for the bounded P-batch scheduling with chain precedence constraints and unit processing time
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- A note on an on-line algorithm for the parallel-batching scheduling to minimize makespan
- Optimal on-line algorithms for one batch machine with grouped processing times
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
- scientific article; zbMATH DE number 2081006 (Why is no real title available?)
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
- Online single machine scheduling to minimize the maximum starting time
- Online over time scheduling on parallel-batch machines: a survey
- An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart
- A coordination mechanism for a scheduling game with parallel-batching machines
- Online batch scheduling problem on uniform machines with agreeable processing times
- Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- Best semi-online algorithms for unbounded parallel batch scheduling
- On-line machine scheduling with batch setups
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
- Dynamic batching of online arrivals to leverage economies of scale
- Online scheduling on a bounded batch machine with same-length-job families
- Online scheduling on a parallel-batch machine with pulse interruptions
- A best possible online algorithm for parallel-batch scheduling with kind release times and job compatibilities
- Picking operations in warehouses with dynamically arriving orders: how good is reoptimization?
- Optimal algorithms for online batch scheduling with all possible equal-processing times under periodic pulse interruptions
- Submodular batch scheduling on parallel machines
- Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
- Online batch scheduling on parallel machines with delivery times
- The online-scheduling problems with the bounded batch and incompatible job families on the unit flowshop machines
- Single machine batch scheduling with release times
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- On-line scheduling on a batch machine to minimize makespan with limited restarts
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
- Optimal online-list batch scheduling
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
This page was built for publication: On-line algorithms for minimizing makespan on batch processing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741218)
