Several semi-online scheduling problems on two identical machines with combined information
DOI10.1016/J.TCS.2012.07.005zbMATH Open1252.68045OpenAlexW2034109383MaRDI QIDQ714838FDOQ714838
Authors: Qian Cao, Guohua Wan, Yi Li, T. C. Edwin Cheng 
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.005
Recommendations
- Semi-online scheduling with combined information on two identical machines in parallel
- Semi-online scheduling with known partial information about job sizes on two identical machines
- A semi-online scheduling problem with the combined partial information on two identical machines with non-simultaneous machine available times
- Semi-online algorithms for parallel machine scheduling problems
- Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Bounds for Certain Multiprocessing Anomalies
- Title not available (Why is that?)
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Semi on-line scheduling on two identical machines
- Bin stretching revisited
- Semi on-line algorithms for the partition problem
- Semi-on-line problems on two identical machines with combined partial information
- Semi-online algorithms for parallel machine scheduling problems
- Semi-online scheduling with decreasing job sizes
- On-line bin-stretching
- Semi-online scheduling with known partial information about job sizes on two identical machines
Cited In (12)
- Semi-online scheduling with combined information on two identical machines in parallel
- Semi-online scheduling with ``end of sequence information
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
- Semi-online scheduling with known partial information about job sizes on two identical machines
- A survey on makespan minimization in semi-online environments
- Semi-on-line problems on two identical machines with combined partial information
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- A semi-online scheduling problem with the combined partial information on two identical machines with non-simultaneous machine available times
- A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
- Optimal Semi-online Scheduling Algorithms on a Small Number of Machines
- Semi-online scheduling: a survey
This page was built for publication: Several semi-online scheduling problems on two identical machines with combined information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714838)
