A dual criteria sequencing problem with earliness and tardiness penalties

DOI10.1002/nav.10020zbMath0993.90045OpenAlexW2012711731MaRDI QIDQ4552543

Joseph Y.-T. Leung

Publication date: 3 September 2002

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.10020

zbMATH Keywords

earlinesstardinessNP-hardnessfully polynomial time approximation schemesingle machine sequencing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work

Cites Work

• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
• Bounds on Multiprocessing Timing Anomalies
• Unnamed Item
• Unnamed Item

This page was built for publication: A dual criteria sequencing problem with earliness and tardiness penalties