Single-machine scheduling with general costs under compound-type distributions

DOI10.1007/s10951-006-0327-3zbMath1154.90424OpenAlexW1989436015MaRDI QIDQ880581

Xianyi Wu, Xiaoqiang Cai, Xian Zhou

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-0327-3

zbMATH Keywords

Single machineCharacteristic functionsConvexity orderDue datesIncrement orderStochastic cost functionsStochastic scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs ⋮ Single machine scheduling with stochastically dependent times

Cites Work

• Unnamed Item
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• Sequencing jobs on a single machine with a common due data and stochastic processing times
• Single machine scheduling when processing times are correlated normal random variables
• Minimizing the expected number of tardy jobs when processing times are normally distributed
• Single-machine scheduling with exponential processing times and general stochastic cost functions
• Scheduling tasks with exponential service times on parallel processors
• Stochastic Scheduling with Release Dates and Due Dates
• Inequalities for stochastic flow shops and job shops
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
• Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach
• A Renewal Decision Problem
• Optimal issuing policies under stochastic field lives
• Scheduling with Random Service Times
• Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine