Online over time scheduling on parallel-batch machines: a survey
From MaRDI portal
Publication:489147
DOI10.1007/s40305-014-0060-0zbMath1306.90060OpenAlexW2004572055MaRDI QIDQ489147
Ji Tian, Jinjiang Yuan, Ruyan Fu
Publication date: 27 January 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-014-0060-0
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Online over time processing of combinatorial problems ⋮ 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 scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine ⋮ 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 ⋮ Competitive project scheduling on two unbounded parallel batch machines ⋮ Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time ⋮ Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities ⋮ Online scheduling of jobs with kind release times and deadlines on a single machine ⋮ A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production ⋮ Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time ⋮ Online batch scheduling with kind release times and incompatible families to minimize makespan ⋮ Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time ⋮ 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 ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Online scheduling on a single machine with linear deteriorating processing times and delivery times ⋮ Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs ⋮ Online algorithms to schedule a proportionate flexible flow shop of batching machines ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- Best semi-online algorithms for unbounded parallel batch scheduling
- Semi-on-line multiprocessor scheduling with given total processing time
- 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
- Online batch scheduling on parallel machines with delivery times
- 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
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- A best online algorithm for scheduling on two parallel batch machines
- On-line scheduling with delivery time on a single batch machine
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Scheduling a batching machine
- Approximation algorithms in batch processing
- Scheduling one batch processor subject to job release dates
- Batching and delivery in semi-online distribution systems
- 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
- Semi-on-line problems on two identical machines with combined partial information
- Minimizing makespan in batch machine scheduling
- 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
- Complexity results for single-machine problems with positive finish-start time-lags
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
- Online unbounded batch scheduling on parallel machines with delivery times
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- On-line algorithms for minimizing makespan on batch processing machines
- Online Scheduling with Known Arrival Times
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Control of a batch-processing machine: A computational approach
- Optimal on-line algorithms for single-machine scheduling
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- Semi-online scheduling with decreasing job sizes
This page was built for publication: Online over time scheduling on parallel-batch machines: a survey
