Optimal constant due-date assignment and sequencing

DOI10.1080/00207728808547167zbMath0645.90039OpenAlexW2101672056MaRDI QIDQ3789321

Cheng, T. C. Edwin

Publication date: 1988

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

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

zbMATH Keywords

sequencingsingle-machineoptimal job sequencejob earliness and tardinessflow allowance

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Optimal assignment of due-dates for preemptive single-machine scheduling ⋮ Survey of scheduling research involving due date determination decisions

Cites Work

• Minimizing the average deviation of job completion times about a common due date
• Due Date Assignment for Production Systems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

This page was built for publication: Optimal constant due-date assignment and sequencing