Sequencing jobs on a single machine with a common due data and stochastic processing times

DOI10.1016/0377-2217(91)90249-UzbMath0741.90037MaRDI QIDQ1179194

George Steiner, Erdal Erel, Sarin, Subhash C.

Publication date: 26 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

single machinesequencingcommon due datestochastic processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ Single-machine scheduling to stochastically minimize maximum lateness ⋮ 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 ⋮ Chance-constrained model for uncertain job shop scheduling problem ⋮ Optimal sequences in stochastic single machine shops ⋮ Single-machine scheduling with general costs under compound-type distributions ⋮ Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines ⋮ On the minimization of the weighted number of tardy jobs with random processing times and deadline ⋮ OPTIMAL SCHEDULING OF RANDOM WORKS WITH RELIABILITY APPLICATION ⋮ Predictive-reactive scheduling on a single resource with uncertain future jobs ⋮ Single-machine scheduling with exponential processing times and general stochastic cost functions ⋮ Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs ⋮ Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method ⋮ A production rescheduling expert simulation system ⋮ An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups ⋮ 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
• Scheduling with Deadlines and Loss Functions
• Stochastic Scheduling with Release Dates and Due Dates
• Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure

This page was built for publication: Sequencing jobs on a single machine with a common due data and stochastic processing times