The stochastic single machine scheduling problem with earliness and tardiness costs
type: Item
instance of: scholarly article
title: The stochastic single machine scheduling problem with earliness and tardiness costs
zbMATH Open document ID: 0809.90083
DOI: 10.1016/0377-2217(94)90373-5
published in: European Journal of Operational Research
publication date: 1994-09-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 639282
zbMATH Keywords: static single machine scheduling
zbMATH Keywords: earliness and tardiness costs
zbMATH Keywords: job processing times
zbMATH Keywords: heuristics
author: Hossein M. Soroush
author: Lawrence D. Fredendall
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90373-5
OpenAlex ID: W1996683648
cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
cites work: Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
cites work: Minimizing mean absolute deviation of completion times about a common due date
cites work: Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
cites work: On the Assignment of Optimal Due Dates
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
cites work: N-Job, One Machine Sequencing Problems Under Uncertainty
cites work: Minimizing the expected weighted number of tardy jobs in stochastic flow shops
cites work: A single-machine scheduling problem with random processing times
cites work: Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
cites work: Q4658190
cites work: Single machine sequencing with random processing times and random due‐dates
cites work: Single-machine scheduling with early and tardy completion costs
cites work: On the minimization of the weighted number of tardy jobs with random processing times and deadline
cites work: Minimising Waiting Time Variance in the Single Machine Problem
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: Q3793928
cites work: Q3938812
cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
cites work: Minimizing Variation of Flow Time in Single Machine Systems
cites work: Minimizing the average deviation of job completion times about a common due date
cites work: Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
cites work: Variance Minimization in Single Machine Sequencing Problems
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: The Single Machine Early/Tardy Problem
cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
cites work: Stochastic Scheduling with Release Dates and Due Dates
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: Sequencing jobs on a single machine with a common due data and stochastic processing times
cites work: Minimizing the Time-in-System Variance for a Finite Jobset
cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
cites work: On the Single-machine Scheduling Problem with Tardiness Penalties
cites work: Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
cites work: Deterministic and Random Single Machine Sequencing with Variance Minimization
cites work: Q5612245
description: scientific article; zbMATH DE number 639282