On Scheduling with Ready Times to Minimize Mean Flow Time
From MaRDI portal
Publication:3674053
DOI10.1093/comjnl/26.4.320zbMath0523.68029MaRDI QIDQ3674053
Publication date: 1983
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/26.4.320
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation, A mixed integer programming approach for the single machine problem with unequal release dates, A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times, Efficient heuristics to minimize total flow time with release dates, A look-ahead heuristic for scheduling jobs with release dates on a single machine, Scheduling a single machine to minimize a regular objective function under setup constraints, Single-machine scheduling with no idle time and release dates to~minimize a regular criterion, Effective heuristics for the single machine sequencing problem with ready times, Unnamed Item