Scheduling problems with non-regular penalty functions - a review
The problem of scheduling n jobs on a single or several machines so as to minimize certain non-regular objectives is discussed. Such criteria include the variance of completion times, absolute deviations of the completion times from a common due date, piecewise linear functions imposing penalty on early and late completion times and quadratic loss functions. These problems include both the case when the due date is given as well as the case when the due date is to be determined. This paper presents a review of research done in these areas of scheduling. The review also considers the situations when the processing times are not known deterministically but are random variables with known probability distributions.
- Exact penalty functionals in scheduling problems
- scientific article; zbMATH DE number 67596
- Publication:3478253
- A metric approach for scheduling problems with minimizing the maximum penalty
- Scheduling jobs with time-resource tradeoff via nonlinear programming
- Continuous nonlinear programming techniques to solve scheduling problems
- Machine scheduling with earliness, tardiness and non-execution penalties
- scientific article; zbMATH DE number 1159455
- Non-clairvoyantly scheduling to minimize convex functions
- Non-approximability results for scheduling problems with minsum criteria
- Multiple and bicriteria scheduling: A literature survey
- A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
- Determination of common due window location in a single machine scheduling problem
- Earliness-tardiness scheduling problems with a common delivery window
- Single machine scheduling to minimize weighted earliness subject to maximum tardiness
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- Optimal sequences in stochastic single machine shops
- Job sequencing and due date assignment in a single machine shop with uncertain processing times
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
- Tabu search for a class of single-machine scheduling problems
- Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties
This page was built for publication: Scheduling problems with non-regular penalty functions - a review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106097)
