WORST-CASE ANALYSIS OF INDEXING RULES FOR SINGLE MACHINE SEQUENCING

DOI10.15807/JORSJ.36.234MaRDI QIDQ4294130zbMATH OpenOpenAlexFDO

Authors Tsung-Chyan Lai

Publication date 24 May 1994

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.36.234

zbMATH Keywords

delivery timeprocessing timerelease datesingle machine sequencingworst-case bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A note on the optimality of index priority rules for search and sequencing problems
• MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING
• Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
• scientific article; zbMATH DE number 4085399
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Effective heuristics for the single machine sequencing problem with ready times
• A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling
• Worst-case analysis of the iterated longest fragment algorithm
• scientific article; zbMATH DE number 527370
• Minimizing the number of tardy jobs in single machine sequencing

Cited in

(1)

• A note on the optimality of index priority rules for search and sequencing problems

This page was built for publication: WORST-CASE ANALYSIS OF INDEXING RULES FOR SINGLE MACHINE SEQUENCING

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