Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

DOI10.1016/j.dam.2010.02.010zbMath1230.90101MaRDI QIDQ708343

Liron Yedidsion, George Steiner, Dvir Shabtay

Publication date: 11 October 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.02.010

zbMATH Keywords

complexity; bicriteria scheduling; due date assignment; maximum tardiness

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B80: Discrete location and assignment

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Bicriteria scheduling for due date assignment with total weighted tardiness, A new perspective on single-machine scheduling problems with late work related criteria, A note: minmax due-date assignment problem with lead-time cost, Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Manufacturing lead-time rules: customer retention versus tardiness costs
• Optimal due date assignment in multi-machine scheduling environments
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
• Two due date assignment problems in scheduling a single machine
• Solving a bicriterion scheduling problem
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• A survey of the state-of-the-art of common due date assignment and scheduling research
• A note on a due-date assignment on a two-machine flow-shop
• Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Approximation algorithms for minimizing the total weighted tardiness on a single machine
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
• Batch scheduling and common due-date assignment on a single machine
• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Scheduling the Open Shop to Minimize Mean Flow Time
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling independent tasks to reduce mean finishing time
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• A common due-data assignment problem on parallel identical machines