The stochastic single machine scheduling problem with earliness and tardiness costs
From MaRDI portal
Publication:1333461
DOI10.1016/0377-2217(94)90373-5zbMath0809.90083OpenAlexW1996683648MaRDI QIDQ1333461
Lawrence D. Fredendall, Hossein 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
Related Items
Distributionally robust single machine scheduling with the total tardiness criterion, Safe scheduling: Setting due dates in single-machine problems, Setting optimal due dates in a basic safe-scheduling model, Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem, Optimal sequences in stochastic single machine shops, 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, Analysis of computer job control under uncertainty, Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs, Single machine earliness and tardiness scheduling, STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS, Bi-objective single machine scheduling problem with stochastic processing times, Setting due dates in a stochastic single machine environment, Dynamic scheduling of stochastic jobs on a single machine, Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs, Trading off due-date tightness and job tardiness in a basic scheduling model, Minimizing earliness and tardiness costs in stochastic scheduling, Minimizing the expected number of tardy jobs when processing times are normally distributed
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
- 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
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
- Stochastic Scheduling with Release Dates and Due Dates
- A single-machine scheduling problem with random processing times
- Minimizing mean absolute deviation of completion times about a common due date
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- The Single Machine Early/Tardy Problem
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- On the Assignment of Optimal Due Dates
- Minimizing Variation of Flow Time in Single Machine Systems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- On the Single-machine Scheduling Problem with Tardiness Penalties
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Minimizing the Time-in-System Variance for a Finite Jobset
- N-Job, One Machine Sequencing Problems Under Uncertainty
- Minimising Waiting Time Variance in the Single Machine Problem
- Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Single-machine scheduling with early and tardy completion costs
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Single machine sequencing with random processing times and random due‐dates
- Variance Minimization in Single Machine Sequencing Problems
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
