Optimal due-date assignment for a single machine sequencing problem with random processing times

DOI10.1080/00207728608926876zbMath0601.90074OpenAlexW2135385543MaRDI QIDQ3737189

Cheng, T. C. Edwin

Publication date: 1986

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728608926876

zbMATH Keywords

random processing timesdue-date assignmentoptimal sequencesingle machine sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates, Job sequencing and due date assignment in a single machine shop with uncertain processing times, Survey of scheduling research involving due date determination decisions, Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine, Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine, Due-window assignment scheduling problem with stochastic processing times, Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs

Cites Work

• Due Date Assignment for Production Systems
• A Simulation Study of Predictable Due-Dates