Optimal sequences in stochastic single machine shops
From MaRDI portal
Publication:1919778
DOI10.1016/0305-0548(95)00069-0zbMath0854.90083OpenAlexW2058218546MaRDI QIDQ1919778
Publication date: 19 January 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(95)00069-0
sequencingrandom processing timesmean waiting timemean flow time, mean waiting timemean latenessmultidimensional deterministic single machine problems
Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quadratic assignment problems
- Parametric precedence relations in single machine scheduling
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Scheduling problems with non-regular penalty functions - a review
- On the quadratic assignment problem
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- One machine scheduling to minimize expected mean tardiness. I
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- An algorithm for the quadratic assignment problem using Benders' decomposition
- The stochastic single machine scheduling problem with earliness and tardiness costs
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- A parallel heuristic for quadratic assignment problems
- Single machine scheduling with nonlinear cost functions
- The cμ rule revisited
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- 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
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
- The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
- Minimizing Total Costs in One-Machine Scheduling
- A Problem in Single-Machine Sequencing with Nonlinear Delay Costs
- P-Complete Approximation Problems
- Hospital Layout as a Quadratic Assignment Problem
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Numerical investigations on quadratic assignment problems
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- An Algorithm for the Quadratic Assignment Problem
- Single machine sequencing with random processing times and random due‐dates
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
