One machine scheduling to minimize expected mean tardiness. II

DOI10.1016/0305-0548(94)90008-6zbMath0820.90050OpenAlexW4243381458MaRDI QIDQ1332812

B. V. Cadambi

Publication date: 13 October 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90008-6

zbMATH Keywords

single machineheuristic algorithmmean or total expected tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

One machine scheduling to minimize expected mean tardiness. I

Cites Work

• Unnamed Item
• One machine scheduling to minimize expected mean tardiness. I
• A decomposition algorithm for the single machine total tardiness problem
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Minimizing Total Costs in One-Machine Scheduling
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

This page was built for publication: One machine scheduling to minimize expected mean tardiness. II