Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
From MaRDI portal
Publication:3902463
DOI10.1137/0210014zbMath0454.68010OpenAlexW1977745207MaRDI QIDQ3902463
No author found.
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210014
Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (22)
A look-ahead heuristic for scheduling jobs with release dates on a single machine ⋮ Scheduling with a position-weighted learning effect and job release dates ⋮ A mixed integer programming approach for the single machine problem with unequal release dates ⋮ An iterative heuristic for the single machine dynamic total completion time scheduling problem ⋮ A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems ⋮ Dominance rules in combinatorial optimization problems ⋮ Single-machine scheduling with no idle time and release dates to~minimize a regular criterion ⋮ Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ An algorithm for single machine sequencing with release dates to minimize total weighted completion time ⋮ A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times ⋮ Scheduling with release dates on a single machine to minimize total weighted completion time ⋮ Efficient heuristics to minimize total flow time with release dates ⋮ A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals ⋮ 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 ⋮ Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates ⋮ Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem ⋮ A new dominance rule to minimize total weighted tardiness with unequal release dates. ⋮ Effective heuristics for the single machine sequencing problem with ready times ⋮ On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
This page was built for publication: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
