Common due-date assignment and scheduling on single machine with exponential processing times.

DOI10.1007/BF03398614zbMath1141.90437OpenAlexW2774328138MaRDI QIDQ2468636

D. K. Manna

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398614

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Discrete location and assignment (90B80)

Cites Work

• Survey of scheduling research involving due date determination decisions
• A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems
• Scheduling tasks with exponential service times on parallel processors
• A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
• 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
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Due-date assignment and early/tardy scheduling on identical parallel machines
• The single-machine absolute-deviation early-tardy problem with random completion times

This page was built for publication: Common due-date assignment and scheduling on single machine with exponential processing times.