The single-machine absolute-deviation early-tardy problem with random completion times

DOI10.1002/(SICI)1520-6750(199606)43:4%3C573::AID-NAV9%3E3.0.CO;2-4MaRDI QIDQ4883172zbMATH OpenOpenAlexFDO

Authors John Mittenthal, M. Raghavachari, U. Al-Turki

Publication date 1 July 1996

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199606)43:4%3C573::aid-nav9%3E3.0.co;2-4

zbMATH Keywords

completion timesearliness, and tardiness penaltiesmachine breakdownssequencingsingle machineweighted combination of due dates

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Recommendations

• On the single machine total tardiness problem
• The stochastic single machine scheduling problem with earliness and tardiness costs
• scientific article; zbMATH DE number 1076139
• New insights on the single machine total tardiness problem
• Decomposition of the single machine total tardiness problem
• Single machine total tardiness maximization problems: complexity and algorithms
• Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
• Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs

Cited in

(9)

• Job sequencing and due date assignment in a single machine shop with uncertain processing times
• Common due-date assignment and scheduling on single machine with exponential processing times.
• OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
• Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs
• Scheduling problems with random processing times under expected earliness/tardiness costs
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times
• Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
• Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties

This page was built for publication: The single-machine absolute-deviation early-tardy problem with random completion times

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