Online Order Scheduling Problem with the Same Order Size on Two Identical Machines
From MaRDI portal
Publication:4978463
DOI10.1142/S0217595917500063zbMath1372.90043OpenAlexW2594449517MaRDI QIDQ4978463
Publication date: 10 August 2017
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595917500063
Cites Work
- Unnamed Item
- Semi-online scheduling with known partial information about job sizes on two identical machines
- Semi on-line scheduling on two identical machines
- Bin stretching revisited
- Semi-on-line problems on two identical machines with combined partial information
- Bounds for Certain Multiprocessing Anomalies
- Semi-online scheduling with decreasing job sizes
- On-line bin-stretching