A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling

DOI10.1016/S0305-0548(03)00080-7zbMath1073.90018MaRDI QIDQ1885984

Joseph Geunes, Bibo Yang, William J. O'Brien

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Optimizing temporary work and overtime in the time cost quality trade-off problem ⋮ Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling ⋮ Multi-coloring and job-scheduling with assignment and incompatibility costs ⋮ Predictive-reactive scheduling on a single resource with uncertain future jobs ⋮ Modeling single machine preemptive scheduling problems for computational efficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The discrete time-cost tradeoff problem revisited
• A multi-objective approach to resource allocation in single machine scheduling
• Genetic algorithms and tabu search: Hybrids for optimization
• Structure of a simple scheduling polyhedron
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Dynamic Programming Algorithm for Decision CPM Networks
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set

This page was built for publication: A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling