Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
From MaRDI portal
(Redirected from Publication:708343)
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
Cites work
- scientific article; zbMATH DE number 167292 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 2159153 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A common due-data assignment problem on parallel identical machines
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- A note on a due-date assignment on a two-machine flow-shop
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Batch scheduling and common due-date assignment on a single machine
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Due date management policies
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Optimal due date assignment in multi-machine scheduling environments
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Scheduling independent tasks to reduce mean finishing time
- Scheduling the Open Shop to Minimize Mean Flow Time
- Solving a bicriterion scheduling problem
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- The Complexity of Flowshop and Jobshop Scheduling
- Two due date assignment problems in scheduling a single machine
Cited in
(12)- A bicriterion scheduling problem involving total flowtime and total tardiness
- 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
- scientific article; zbMATH DE number 5260995 (Why is no real title available?)
- Optimal due date assignment in multi-machine scheduling environments
- A note: minmax due-date assignment problem with lead-time cost
- A new perspective on single-machine scheduling problems with late work related criteria
- scientific article; zbMATH DE number 3821427 (Why is no real title available?)
- 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
- 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)
