Solving a stochastic single machine problem with initial idle time and quadratic objective

DOI10.1016/j.cor.2009.10.002zbMath1178.90168MaRDI QIDQ2655649

Hossein Soroush

Publication date: 25 January 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.10.002

zbMATH Keywords

scheduling; single machine; stochastic; idle time; JIT; quadratic lateness

Mathematics Subject Classification ID

90C15: Stochastic programming

90B36: Stochastic scheduling theory in operations research

Cites Work

• Unnamed Item
• Unnamed Item
• Group shops scheduling with makespan criterion subject to random release dates and processing times
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
• Minimising a weighted quadratic function of job lateness in the stochastic single machine scheduling problem
• Optimal paths in probabilistic networks: A case with temporary preferences
• Scheduling about a given common due date to minimize mean squared deviation of completion times
• Solution of the generalized Townsend single machine scheduling model
• On stochastic machine scheduling with general distributional assumptions
• Completion time variance minimization on a single machine is difficult
• An improved precedence rule for single machine sequencing problems with quadratic penalty
• Dynamic scheduling of stochastic jobs on a single machine
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
• Minimizing the sum of squares lateness on a single machine
• Single machine scheduling with symmetric earliness and tardiness penalties
• Safe scheduling: Setting due dates in single-machine problems
• Job sequencing and due date assignment in a single machine shop with uncertain processing times
• Multicriteria scheduling
• Johnson's problem with stochastic processing times and optimal service level
• Note—Sequencing JIT Mixed-Model Assembly Lines
• Sequencing with Earliness and Tardiness Penalties: A Review
• Principles of Sequencing and Scheduling
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
• Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost