Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
From MaRDI portal
(Redirected from Publication:2490167)
Recommendations
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Minmax earliness-tardiness costs with unit processing time jobs
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
- Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
Cites work
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A Generalized Model of Optimal Due-Date Assignment by Linear Programming
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Algorithms for two bottleneck optimization problems
- An algorithm for the CON due-date determination and sequencing problem
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Determination of an optimal common due date and optimal sequence in a single machine job shop
- Due-date assignment with asymmetric earliness–tardiness cost
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- On the Assignment of Optimal Due Dates
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- The parallel machine min-max weighted absolute lateness scheduling problem
Cited in
(26)- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Single machine scheduling with two competing agents and equal job processing times
- Just-in-time scheduling with equal-size jobs
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
- scientific article; zbMATH DE number 434689 (Why is no real title available?)
- Optimal restricted due date assignment in scheduling
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Due-window assignment problems with unit-time jobs
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Minmax earliness-tardiness costs with unit processing time jobs
- Due dates assignment and JIT scheduling with equal-size jobs
- Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
- Equitable scheduling on a single machine
- Solving the rectangular assignment problem and applications
- Scheduling with due date assignment under special conditions on job processing
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
- Scheduling unit processing time jobs on an m-machine flow-shop
- Due-date assignment with asymmetric earliness–tardiness cost
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
- Due-window assignment with identical jobs on parallel uniform machines
This page was built for publication: Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490167)
