Several semi-online scheduling problems on two identical machines with combined information
From MaRDI portal
(Redirected from Publication:714838)
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
Cites work
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Bin stretching revisited
- Bounds for Certain Multiprocessing Anomalies
- On-line bin-stretching
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- 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
- Semi-online scheduling with known partial information about job sizes on two identical machines
Cited in
(12)- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Semi-online scheduling with ``end of sequence information
- Semi-online scheduling with combined information on two identical machines in parallel
- 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)