Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs

DOI10.1287/opre.32.2.451zbMath0541.90052OpenAlexW2077390257MaRDI QIDQ3329199

Michael H. Rothkopf, Stephen A. Smith

Publication date: 1984

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.32.2.451

zbMATH Keywords

job sequencingsingle machinepriority indexlinear and exponential cost functions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Optimal design of a multiservice system: The line-penalty problem ⋮ Single machine scheduling under market uncertainty ⋮ Optimal preemptive scheduling on uniform machines with discounted flowtime objectives ⋮ A note on minimizing the sum of quadratic completion times on two identical parallel machines ⋮ The list scheduling algorithm for scheduling unreliable jobs on two parallel machines ⋮ On index priority sequencing rules for scheduling with time-dependent job processing times ⋮ A note on the optimality of index priority rules for search and sequencing problems ⋮ Scheduling jobs on a single machine to maximize the total revenue of jobs ⋮ Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem ⋮ A survey of algorithms for the single machine total weighted tardiness scheduling problem ⋮ An optimal sequence in multicharacteristic inspection ⋮ Selecting the best choice in the full information group interview problem ⋮ Stochastic machine scheduling to minimize waiting time related objectives with emergency jobs ⋮ A job shop scheduling heuristic for varying reward structures

This page was built for publication: Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs