The worst-case performance ratio with time-dependent single-scheduling problems

DOI10.11721/CQNUJ20130502MaRDI QIDQ5167620zbMATH OpenFDO

Authors Zhang Xingong

Publication date 30 June 2014

Full work available at URL https://doi.org/10.11721/CQNUJ20130502

zbMATH Keywords

schedulingpolynomial time algorithmtime-dependent schedulingworst-case performance ratios

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling problems with position-dependent processing times
• Single-machine scheduling problems with time and position dependent processing times
• Study on single machine scheduling problem based on general time-and-position dependent jobs processing time
• Scheduling jobs with position-dependent processing times
• Single-machine total completion time scheduling with a time-dependent deterioration

Cited in

(7)

• A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling
• On the worst-case ratio of a compound multiprocessor scheduling algorithm
• Study on single machine scheduling problem based on general time-and-position dependent jobs processing time
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Single machine scheduling problems with position-dependent processing times
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
• Average and worst-case analysis of heuristics for the maximum tardiness problem

This page was built for publication: The worst-case performance ratio with time-dependent single-scheduling problems

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