The ``least flexible job first rule in scheduling and in queueing

DOI10.1016/j.orl.2013.08.009zbMath1287.90026MaRDI QIDQ2450742

Josh Reed, Michael L. Pinedo

Publication date: 15 May 2014

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

Full work available at URL: https://doi.org/10.1016/j.orl.2013.08.009

zbMATH Keywords

makespan; stochastic scheduling; total flow time; priority queues; restricted processing sets

Mathematics Subject Classification ID

90B22: Queues and service in operations research

90B36: Stochastic scheduling theory in operations research

Related Items

Ideal schedules in parallel machine settings, On the optimality of the earliest due date rule in stochastic scheduling and in queueing

Cites Work

• Scheduling jobs with equal processing times subject to machine eligibility constraints
• A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
• Preemptive scheduling on uniform machines to minimize mean flow time
• Scheduling parallel machines with inclusive processing set restrictions and job release times
• Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
• Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
• Heavy traffic resource pooling in parallel-server systems
• Parallel machine problems with equal processing times: a survey
• Scheduling unit-length jobs with machine eligibility restrictions
• A survey of hard real-time scheduling for multiprocessor systems
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
• Scheduling
• Unnamed Item