On-line scheduling algorithms for a batch machine with finite capacity
From MaRDI portal
Publication:1781801
DOI10.1007/s10878-005-6855-5zbMath1079.90060OpenAlexW2083819591MaRDI QIDQ1781801
Publication date: 8 June 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-6855-5
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (37)
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 ⋮ 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 ⋮ Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines ⋮ A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES ⋮ Online scheduling with delivery time on a bounded parallel batch machine with limited restart ⋮ Research on the parallel-batch scheduling with linearly lookahead model ⋮ Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval ⋮ 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 ⋮ Approximation algorithms for batch scheduling with processing set restrictions ⋮ 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 ⋮ An improved on-line algorithm for single parallel-batch machine scheduling with delivery times ⋮ Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs ⋮ A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan ⋮ On-line scheduling on a batch machine to minimize makespan with limited restarts ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Online batch scheduling with kind release times and incompatible families to minimize makespan ⋮ Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart ⋮ Online scheduling on unbounded parallel-batch machines with incompatible job families ⋮ Best semi-online algorithms for unbounded parallel batch scheduling ⋮ Algorithms for on-line order batching in an order picking warehouse ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ Optimal online-list batch scheduling ⋮ Online scheduling on unbounded parallel-batch machines to minimize the makespan ⋮ Single machine batch scheduling with release times ⋮ On-line scheduling with delivery time on a single batch machine ⋮ Online scheduling in a parallel batch processing system to minimize makespan using restarts ⋮ OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ Scheduling an unbounded batching machine with job processing time compatibilities ⋮ Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead ⋮ Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead ⋮ On-line integrated production-distribution scheduling problems with capacitated deliveries ⋮ Online unbounded batch scheduling on parallel machines with delivery times
Cites Work
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a batching machine
- The complexity of one-machine batching problems
- Approximation algorithms in batch processing
- Scheduling one batch processor subject to job release dates
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- Minimizing makespan in batch machine scheduling
- Scheduling with batching: A review
- On-line algorithms for minimizing makespan on batch processing machines
- Batching and Scheduling Jobs on Batch and Discrete Processors
- 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
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling Groups of Jobs on a Single Machine
This page was built for publication: On-line scheduling algorithms for a batch machine with finite capacity
