General stochastic single-machine scheduling with regular cost functions
type: Item
instance of: scholarly article
title: General stochastic single-machine scheduling with regular cost functions
zbMATH Open document ID: 0895.90125
DOI: 10.1016/S0895-7177(97)00134-9
published in: Mathematical and Computer Modelling
publication date: 1998-04-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1135910
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: stochastic breakdowns
zbMATH Keywords: regular performance measures
zbMATH Keywords: due dates
zbMATH Keywords: mean weighted flowtime
zbMATH Keywords: mean weighted tardiness
author: Xian Zhou
author: Xiaoqiang Cai
MaRDI profile type: Publication
cites work: Single-machine scheduling subject to stochastic breakdowns
cites work: Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
cites work: N-Job, One Machine Sequencing Problems Under Uncertainty
cites work: Minimizing the expected weighted number of tardy jobs in stochastic flow shops
cites work: Single machine sequencing with random processing times and random due‐dates
cites work: A Renewal Decision Problem
cites work: Scheduling stochastic jobs with due dates on parallel machines
cites work: Scheduling tasks with exponential service times on parallel processors
cites work: On the optimality of static priority policies in stochastic scheduling on parallel machines
cites work: A polynomial time algorithm for a chance-constrained single machine scheduling problem
cites work: Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
cites work: AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM
cites work: Stochastic Scheduling with Release Dates and Due Dates
cites work: Inequalities and bounds for the scheduling of stochastic jobs on parallel machines
cites work: Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
cites work: Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
cites work: Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
cites work: Scheduling Jobs Subject to Nonhomogeneous Poisson Shocks
cites work: Scheduling stochastic jobs on a single machine subject to breakdowns
cites work: Q4306273
cites work: Scheduling with Random Service Times
cites work: Q3940839
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Q4124332
cites work: Q4142699
cites work: Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
cites work: Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach
cites work: Q3938812
full work available at URL: s0895-7177(97)00134-9
OpenAlex ID: W2072485054
description: scientific article; zbMATH DE number 1135910