On-line scheduling of small open shops

DOI10.1016/S0166-218X(00)00268-7zbMath1074.90525OpenAlexW2098280248MaRDI QIDQ5936457

Bo Chen, Dong-lei Du, Jianjun Wen, Ji-ye Han

Publication date: 31 October 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00268-7

zbMATH Keywords

SchedulingCompetitive analysisOn-lineOpen shopPreemption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ On-line two-machine open shop scheduling with time lags ⋮ OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines

Cites Work

• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• An optimal algorithm for preemptive on-line scheduling
• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: On-line scheduling of small open shops