A simple semi on-line algorithm for P2//C_ with a buffer

DOI10.1016/S0020-0190(97)00006-9zbMATH Open1336.90042OpenAlexW1973636105MaRDI QIDQ290202FDOQ290202

Authors: Guochuan Zhang 

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00006-9

Recommendations

• Semi-online algorithms for parallel machine scheduling problems
• Online scheduling with a buffer on related machines
• Several semi-online scheduling problems on two identical machines with combined information
• Semi-online hierarchical scheduling problems with buffer or rearrangements
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1

zbMATH Keywords

analysis of algorithmsschedulingworst-case ratio

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Bounds for Certain Multiprocessing Anomalies
• Title not available (Why is that?)

Cited In (22)

• Improved semi-online makespan scheduling with a reordering buffer
• Title not available (Why is that?)
• Semi-online scheduling with ``end of sequence information
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• A survey on makespan minimization in semi-online environments
• Several semi-online scheduling problems on two identical machines with combined information
• Semi-online algorithms for parallel machine scheduling problems
• Semi-on-line scheduling problems for maximizing the minimum machine completion time
• A note on on-line scheduling with partial information
• Online minimum makespan scheduling with a buffer
• SEMI-ONLINE MACHINE COVERING
• Online scheduling with reassignment
• Online scheduling with one rearrangement at the end: revisited
• Online scheduling with rearrangement on two related machines
• Optimal algorithms for online scheduling with bounded rearrangement at the end
• Online scheduling with a buffer on related machines
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs
• Semi-online scheduling: a survey
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
• A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• Semi-online scheduling with two GoS levels and unit processing time

This page was built for publication: A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290202)