Single-machine scheduling with exponential processing times and general stochastic cost functions

DOI10.1007/S10898-004-5702-ZzbMATH Open1090.90073OpenAlexW2063711711MaRDI QIDQ1781971FDOQ1781971

Authors: Xiaoqiang Cai, Xian Zhou 

Publication date: 9 June 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-5702-z

Recommendations

• General stochastic single-machine scheduling with regular cost functions
• scientific article; zbMATH DE number 519846
• Single-machine stochastic scheduling with dependent processing times
• Stochastic single machine scheduling with an exponentially distributed due date
• A stochastic single machine scheduling with random processing time
• Single-machine scheduling with general costs under compound-type distributions
• Single machine scheduling problems with exponentially start time dependent job processing times
• Single machine scheduling with stochastically dependent times

zbMATH Keywords

Single machineDue datesStochastic cost functionsStochastic schedulingExponential processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)

Cites Work

• A Renewal Decision Problem
• Sequencing jobs on a single machine with a common due data and stochastic processing times
• Stochastic Scheduling with Release Dates and Due Dates
• Minimizing the expected weighted number of tardy jobs in stochastic flow 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

Cited In (12)

• Single-machine scheduling to stochastically minimize maximum lateness
• Single-machine scheduling with general costs under compound-type distributions
• Title not available (Why is that?)
• Stochastic bicriteria single machine scheduling with quadratic cost functions
• A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
• Stochastic scheduling to minimize expected maximum lateness
• The effect of service time variability on maximum queue lengths in M^X/G/1 queues
• Stochastic scheduling on parallel machines to minimize discounted holding costs
• Stochastic single machine scheduling with an exponentially distributed due date
• Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
• A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flowtimes of Jobs with Exponential Processing Times
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

This page was built for publication: Single-machine scheduling with exponential processing times and general stochastic cost functions

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