On-line scheduling algorithms for a batch machine with finite capacity
From MaRDI portal
Publication:1781801
DOI10.1007/S10878-005-6855-5zbMATH Open1079.90060OpenAlexW2083819591MaRDI QIDQ1781801FDOQ1781801
Authors: Chung Keung Poon, Wen-Ci Yu 
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
Recommendations
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- Online scheduling on bounded parallel-batch machines
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
- On-line scheduling on a batch machine to minimize makespan with limited restarts
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- scientific article; zbMATH DE number 761265
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines
- On-line machine scheduling with batch setups
- Online algorithms for batch machines scheduling with delivery times
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Scheduling with batching: A review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a batching machine
- Scheduling one batch processor subject to job release dates
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Approximation algorithms in batch processing
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- 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
- Scheduling Groups of Jobs on a Single Machine
- Efficient scheduling algorithms for a single batch processing machine
- The complexity of one-machine batching problems
- Scheduling a single batch processing machine with non-identical job sizes
- Minimizing makespan in batch machine scheduling
Cited In (41)
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead
- Single machine batch scheduling with release times
- Online unbounded batch scheduling on parallel machines with delivery times
- A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
- Optimal online-list batch scheduling
- Best semi-online algorithms for unbounded parallel batch scheduling
- 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 kind release times and incompatible families to minimize makespan
- Optimal on-line algorithms for one batch machine with grouped processing times
- Online over time scheduling on parallel-batch machines: a survey
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
- An on-line LS algorithm for some \(Q_m|r_j|C_{\max}\) scheduling
- On-line scheduling on a batch machine to minimize makespan with limited restarts
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- On-line integrated production-distribution scheduling problems with capacitated deliveries
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- Optimal semi-online algorithm for scheduling on two parallel batch processing machines
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- On-line scheduling with delivery time on a single batch machine
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- Scheduling an unbounded batching machine with job processing time compatibilities
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- Title not available (Why is that?)
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- Research on the parallel-batch scheduling with linearly lookahead model
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- Algorithms for on-line order batching in an order picking warehouse
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- Approximation algorithms for batch scheduling with processing set restrictions
- Online algorithms to schedule a proportionate flexible flow shop of batching machines
This page was built for publication: On-line scheduling algorithms for a batch machine with finite capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781801)
