On-line scheduling of small open shops
From MaRDI portal
Publication:5936457
DOI10.1016/S0166-218X(00)00268-7zbMath1074.90525MaRDI 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
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING, An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Four decades of research on the open-shop scheduling problem to minimize the makespan, On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines, On-line two-machine open shop scheduling with time lags
Cites Work