Preemptive scheduling with position costs

MaRDI QIDQ5755520zbMATH OpenFDO

Authors Francis Sourd

Publication date 13 August 2007

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/668

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• single Machine Preemptive Scheduling With Special Cost Functions¹
• Scheduling jobs to minimize total cost
• On-line bin packing with two item sizes
• Preemptive scheduling with two minimax criteria
• Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times

Cited in

(9)

• The one-machine just-in-time scheduling problem with preemption
• Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
• Scheduling jobs to minimize total cost
• Preemptive scheduling with two minimax criteria
• The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
• Single-machine scheduling with job can be processed in advance
• scientific article; zbMATH DE number 6157244 (Why is no real title available?)
• On-line bin packing with two item sizes
• Approximation schemes for packing with item fragmentation

This page was built for publication: Preemptive scheduling with position costs

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