On Scheduling with Ready Times to Minimize Mean Flow Time

DOI10.1093/COMJNL/26.4.320zbMATH Open0523.68029OpenAlexW2043510756MaRDI QIDQ3674053FDOQ3674053

Jitender Deogun

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

zbMATH Keywords

schedulingalgorithm for sequencing jobs on a single processorminimizing the mean flow time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (9)

• Effective heuristics for the single machine sequencing problem with ready times
• Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
• Title not available (Why is that?)
• A mixed integer programming approach for the single machine problem with unequal release dates
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
• Scheduling a single machine to minimize a regular objective function under setup constraints
• 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

This page was built for publication: On Scheduling with Ready Times to Minimize Mean Flow Time

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