Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties

DOI10.1287/opre.41.4.786zbMath0782.90055OpenAlexW1991519998MaRDI QIDQ4272902

M. Raghavachari, John Mittenthal

Publication date: 2 January 1994

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.41.4.786

zbMATH Keywords

single machinerandom breakdownsrecourse modelexpected sum of nonregular penalty functions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns ⋮ A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties ⋮ Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem ⋮ Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function ⋮ \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions ⋮ Optimal rules for single machine scheduling with stochastic breakdowns ⋮ 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 ⋮ Single machine scheduling with coefficient of variation minimization ⋮ A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions ⋮ Scheduling deteriorating jobs on a single machine subject to breakdowns ⋮ Tabu search for a class of single-machine scheduling problems ⋮ Stochastic single machine scheduling with an exponentially distributed due date ⋮ Stochastically minimizing total flowtime in flowshops with no waiting space ⋮ A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems ⋮ Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness ⋮ Scheduling problems with random processing times under expected earliness/tardiness costs ⋮ Single–machine scheduling with random machine breakdowns and randomly compressible processing times