The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization

DOI10.1287/opre.36.2.293zbMath0655.90037OpenAlexW2001312822MaRDI QIDQ3802872

Hirofumi Matsuo

Publication date: 1988

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.36.2.293

zbMATH Keywords

approximation algorithmjob sequencingdue datesingle machineNP-hardovertimedeadlinetardiness penaltiesnonpreemptive job sequenceregular time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness ⋮ On the fixed interval due-date scheduling problem ⋮ A fixed interval due-date scheduling problem with earliness and due-date costs ⋮ Finding efficient make-to-order production and batch delivery schedules ⋮ Logistics scheduling with batching and transportation ⋮ Scheduling Identical Parallel Machines with a Fixed Number of Delivery Dates ⋮ Two-agent integrated scheduling of production and distribution operations with fixed departure times

This page was built for publication: The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization