Pages that link to "Item:Q4272902"
From MaRDI portal
The following pages link to Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties (Q4272902):
Displaying 19 items.
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties (Q339632) (← links)
- Scheduling deteriorating jobs on a single machine subject to breakdowns (Q539453) (← links)
- Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns (Q829166) (← links)
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (Q872264) (← links)
- Single machine stochastic JIT scheduling problem subject to machine breakdowns (Q931488) (← links)
- Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties (Q943438) (← links)
- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function (Q1129910) (← links)
- Single machine scheduling with coefficient of variation minimization (Q1205688) (← links)
- A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions (Q1207198) (← links)
- A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems (Q1266600) (← links)
- \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions (Q1390208) (← links)
- Optimal rules for single machine scheduling with stochastic breakdowns (Q1717990) (← links)
- Stochastically minimizing total flowtime in flowshops with no waiting space (Q1806645) (← links)
- Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model (Q2471329) (← links)
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness (Q2563893) (← links)
- Scheduling problems with random processing times under expected earliness/tardiness costs (Q4487018) (← links)
- Single–machine scheduling with random machine breakdowns and randomly compressible processing times (Q4495504) (← links)
- Tabu search for a class of single-machine scheduling problems (Q5945325) (← links)
- Stochastic single machine scheduling with an exponentially distributed due date (Q5945390) (← links)