BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS

DOI10.1142/S179383090900018XzbMath1178.90148MaRDI QIDQ3397512

Guochun Tang, Rongjun Chen, Baoqiang Fan

Publication date: 22 September 2009

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

scheduling; approximation algorithm; NP-hardness; performance ratio; bicriteria

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Cites Work

• Multiple and bicriteria scheduling: A literature survey
• Complexity of single machine, multi-criteria scheduling problems
• Scheduling unit processing time jobs on a single machine with multiple criteria
• A note on one-processor scheduling with asymmetric earliness and tardiness penalties
• Multicriteria scheduling
• Minimizing flowtime and missed due-dates in single-machine sequencing
• Complexity of two dual criteria scheduling problems
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• One machine sequencing to minimize mean flow time with minimum number tardy
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Single-machine scheduling with early and tardy completion costs
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs