Online Order Scheduling Problem with the Same Order Size on Two Identical Machines
From MaRDI portal
Publication:4978463
DOI10.1142/S0217595917500063zbMATH Open1372.90043OpenAlexW2594449517MaRDI QIDQ4978463FDOQ4978463
Authors: Qian Cao, Yi Li, Guohua Wan 
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
Recommendations
- scientific article; zbMATH DE number 1696639
- Scheduling problems on two sets of identical machines
- Online scheduling on identical machines using SRPT
- On-line scheduling of jobs with order arrival time and hard deadline on two parallel identical machines
- Semi on-line scheduling on two identical machines
- Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines
- Online scheduling with rearrangement on two related machines
- Online nonpreemptive scheduling of equal-length jobs on two identical machines
- Online scheduling of two uniform machines to minimize total completion times
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
Cites Work
- Bounds for Certain Multiprocessing Anomalies
- Title not available (Why is that?)
- Semi on-line scheduling on two identical machines
- Bin stretching revisited
- Semi-on-line problems on two identical machines with combined partial information
- 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 (2)
This page was built for publication: Online Order Scheduling Problem with the Same Order Size on Two Identical Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978463)
