Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
From MaRDI portal
Publication:2490167
DOI10.1016/J.EJOR.2004.10.021zbMATH Open1120.90023OpenAlexW2072841259MaRDI QIDQ2490167FDOQ2490167
Authors: Gur Mosheiov, Uri Yovel 
Publication date: 28 April 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.10.021
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
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Linear Programming in Linear Time When the Dimension Is Fixed
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- A Generalized Model of Optimal Due-Date Assignment by Linear Programming
- On the Assignment of Optimal Due Dates
- The parallel machine min-max weighted absolute lateness scheduling problem
- Algorithms for two bottleneck optimization problems
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- An algorithm for the CON due-date determination and sequencing 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
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
- A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Title not available (Why is that?)
- Optimal restricted due date assignment in scheduling
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- 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
- Equitable scheduling on a single machine
- Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
- Solving the rectangular assignment problem and applications
- Scheduling with due date assignment under special conditions on job processing
- Scheduling unit processing time jobs on an m-machine flow-shop
- Due-date assignment with asymmetric earliness–tardiness cost
- 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 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)
