Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties

DOI10.1287/OPRE.41.4.786MaRDI QIDQ4272902zbMATH OpenOpenAlexFDO

Authors John Mittenthal, M. Raghavachari

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

expected sum of nonregular penalty functionsrandom breakdownsrecourse modelsingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model
• AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
• The stochastic single machine scheduling problem with earliness and tardiness costs
• Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
• Stochastic single machine scheduling to minimize the weighted number of tardy jobs
• Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
• Single-machine scheduling to stochastically minimize maximum lateness

Cited in

(25)

• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
• Single machine scheduling with coefficient of variation minimization
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
• A dominant subset of V-shaped sequences for a class of single machine sequencing problems
• \(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
• Stochastically minimizing total flowtime in flowshops with no waiting space
• Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
• Stochastic bicriteria single machine scheduling with quadratic cost functions
• Solving a stochastic single machine problem with initial idle time and quadratic objective
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
• Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs
• Scheduling problems with random processing times under expected earliness/tardiness costs
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times
• Scheduling deteriorating jobs on a single machine subject to breakdowns
• Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
• Tabu search for a class of single-machine scheduling problems
• Stochastic single machine scheduling with an exponentially distributed due date
• Stochastic single machine JIT scheduling with geometric processing times and due dates
• Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
• 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

This page was built for publication: Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties

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