The stochastic single machine scheduling problem with earliness and tardiness costs
From MaRDI portal
Publication:1333461
DOI10.1016/0377-2217(94)90373-5zbMATH Open0809.90083OpenAlexW1996683648MaRDI QIDQ1333461FDOQ1333461
Lawrence D. Fredendall, Hossein M. Soroush
Publication date: 15 September 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90373-5
Recommendations
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Minimizing earliness and tardiness costs in stochastic scheduling
- Scheduling problems with random processing times under expected earliness/tardiness costs
- Single machine scheduling with stochastic processing times or stochastic due-date to minimize the number of early and tardy jobs
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
Cites Work
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Title not available (Why is that?)
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Sequencing with Earliness and Tardiness Penalties: A Review
- Title not available (Why is that?)
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Single-machine scheduling with early and tardy completion costs
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- A decomposition algorithm for the single machine total tardiness problem
- Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
- Stochastic Scheduling with Release Dates and Due Dates
- The Single Machine Early/Tardy Problem
- On the Assignment of Optimal Due Dates
- Single machine sequencing with random processing times and random due‐dates
- Title not available (Why is that?)
- Variance Minimization in Single Machine Sequencing Problems
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing the Time-in-System Variance for a Finite Jobset
- Minimising Waiting Time Variance in the Single Machine Problem
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Minimizing Variation of Flow Time in Single Machine Systems
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- Minimizing the average deviation of job completion times about a common due date
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Title not available (Why is that?)
- Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
- On the Single-machine Scheduling Problem with Tardiness Penalties
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- N-Job, One Machine Sequencing Problems Under Uncertainty
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
- A single-machine scheduling problem with random processing times
Cited In (24)
- Trading off due-date tightness and job tardiness in a basic scheduling model
- Safe scheduling: Setting due dates in single-machine problems
- EA/G-GA for single machine scheduling problems with earliness/tardiness costs
- Setting due dates in a stochastic single machine environment
- Minimizing earliness and tardiness costs in stochastic scheduling
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs
- The single-machine absolute-deviation early-tardy problem with random completion times
- Distributionally robust single machine scheduling with the total tardiness criterion
- A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
- Analysis of computer job control under uncertainty
- Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
- STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- Setting optimal due dates in a basic safe-scheduling model
- Optimal sequences in stochastic single machine shops
- Dynamic scheduling of stochastic jobs on a single machine
- Single machine earliness and tardiness scheduling
- OPTIMAL SCHEDULING OF RANDOM WORKS WITH RELIABILITY APPLICATION
- Assessing the impact of reducing demand variance through improved planning on the performance of a dual resource constrained job shop
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Scheduling problems with random processing times under expected earliness/tardiness costs
- Bi-objective single machine scheduling problem with stochastic processing times
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
This page was built for publication: The stochastic single machine scheduling problem with earliness and tardiness costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333461)
