General stochastic single-machine scheduling with regular cost functions

DOI10.1016/S0895-7177(97)00134-9zbMath0895.90125OpenAlexW2072485054MaRDI QIDQ1381780

Xian Zhou, Xiaoqiang Cai

Publication date: 1 April 1998

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(97)00134-9

zbMATH Keywords

stochastic schedulingdue datesstochastic breakdownsregular performance measuresmean weighted flowtimemean weighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Single-machine scheduling to stochastically minimize maximum lateness ⋮ Optimal scheduling replacement policies for a system with multiple random works ⋮ Single machine stochastic JIT scheduling problem subject to machine breakdowns ⋮ Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties ⋮ Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model ⋮ OPTIMAL SCHEDULING OF RANDOM WORKS WITH RELIABILITY APPLICATION ⋮ Stochastic scheduling to minimize expected maximum lateness ⋮ Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling stochastic jobs with due dates on parallel machines
• Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• A polynomial time algorithm for a chance-constrained single machine scheduling problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Scheduling tasks with exponential service times on parallel processors
• Scheduling stochastic jobs on a single machine subject to breakdowns
• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• Stochastic Scheduling with Release Dates and Due Dates
• Inequalities and bounds for the scheduling of stochastic jobs on parallel machines
• On the optimality of static priority policies in stochastic scheduling on parallel machines
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
• Scheduling Jobs Subject to Nonhomogeneous Poisson Shocks
• Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach
• Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
• AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM
• N-Job, One Machine Sequencing Problems Under Uncertainty
• A Renewal Decision Problem
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Single-machine scheduling subject to stochastic breakdowns
• Single machine sequencing with random processing times and random due‐dates
• Scheduling with Random Service Times
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

This page was built for publication: General stochastic single-machine scheduling with regular cost functions