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

DOI10.1016/J.DAM.2010.02.010zbMATH Open1230.90101OpenAlexW2087681531MaRDI QIDQ708343FDOQ708343

Authors: Dvir Shabtay, George Steiner, Liron Yedidsion 

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

Recommendations

• Optimal due date assignment in multi-machine scheduling environments
• Bicriteria scheduling for due date assignment with total weighted tardiness
• On bicriteria scheduling of due date assignment and weighted number of tardy jobs
• Two due date assignment problems in scheduling a single machine
• Due-date assignment and early/tardy scheduling on identical parallel machines

zbMATH Keywords

complexitybicriteria schedulingdue date assignmentmaximum tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Discrete location and assignment (90B80)

Cites Work

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

Cited In (12)

• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• On bicriteria scheduling of due date assignment and weighted number of tardy jobs
• Title not available (Why is that?)
• Optimal due date assignment in multi-machine scheduling environments
• A new perspective on single-machine scheduling problems with late work related criteria
• Title not available (Why is that?)
• 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
• Bi-criteria scheduling against restrictive common due dates using a multi-objective differential evolution algorithm
• Bicriteria scheduling for due date assignment with total weighted tardiness
• A bicriterion scheduling problem involving total flowtime and total tardiness
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness

This page was built for publication: Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708343)