Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
From MaRDI portal
Publication:5677269
DOI10.1287/mnsc.19.11.1283zbMath0261.90025OpenAlexW2048473151MaRDI QIDQ5677269
Publication date: 1973
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.19.11.1283
Related Items
The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ Minimizing the number of tardy jobs with stochastically-ordered processing times ⋮ Minimizing the expected weighted number of tardy jobs in stochastic flow shops ⋮ Setting optimal due dates in a basic safe-scheduling model ⋮ Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem ⋮ Optimal sequences in stochastic single machine shops ⋮ General stochastic single-machine scheduling with regular cost functions ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs ⋮ Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems ⋮ On the minimization of the weighted number of tardy jobs with random processing times and deadline ⋮ 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 ⋮ Dynamic scheduling of stochastic jobs on a single machine ⋮ Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs ⋮ Trading off due-date tightness and job tardiness in a basic scheduling model ⋮ Minimizing earliness and tardiness costs in stochastic scheduling ⋮ Minimizing the expected number of tardy jobs when processing times are normally distributed
