Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem

DOI10.1287/MNSC.29.3.384MaRDI QIDQ3659513zbMATH OpenOpenAlexFDO

Authors Toshihide Ibaraki, Hiroshi Kise

Publication date 1983

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.29.3.384

zbMATH Keywords

Balut's algorithmchance-constrained schedulingminimization of the number of tardy jobsn-job one- machine schedulingNP-completenessrandom processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(15)

• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• On the minimization of the weighted number of tardy jobs with random processing times and deadline
• The stochastic single machine scheduling problem with earliness and tardiness costs
• General stochastic single-machine scheduling with regular cost functions
• Dynamic scheduling of stochastic jobs on a single machine
• Minimizing the expected number of tardy jobs when processing times are normally distributed
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
• A polynomial time algorithm for a chance-constrained single machine scheduling problem
• Optimal sequences in stochastic single machine shops
• Minimizing earliness and tardiness costs in stochastic scheduling
• Setting optimal due dates in a basic safe-scheduling model
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
• Minimizing the number of tardy jobs with stochastically-ordered processing times
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

This page was built for publication: Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem

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