Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs

DOI10.1016/j.ejor.2004.10.021zbMath1120.90023OpenAlexW2072841259MaRDI QIDQ2490167

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

zbMATH Keywords

SchedulingAssignment problemDue-date assignmentEarliness-tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (17)

Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ Optimal restricted due date assignment in scheduling ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ A heuristic for single machine common due date assignment problem with different earliness/tardiness weights ⋮ Equitable scheduling on a single machine ⋮ Just-in-Time Scheduling with Equal-Size Jobs ⋮ Due-window assignment problems with unit-time jobs ⋮ Solving the rectangular assignment problem and applications ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties ⋮ An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs ⋮ Due dates assignment and JIT scheduling with equal-size jobs ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ Due-window assignment with identical jobs on parallel uniform machines

Cites Work

• Unnamed Item
• An algorithm for the CON due-date determination and sequencing problem
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• A Generalized Model of Optimal Due-Date Assignment by Linear Programming
• Linear Programming in Linear Time When the Dimension Is Fixed
• Determination of an optimal common due date and optimal sequence in a single machine job shop
• Algorithms for two bottleneck optimization problems
• On the Assignment of Optimal Due Dates
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• The parallel machine min-max weighted absolute lateness scheduling problem
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Due-date assignment with asymmetric earliness–tardiness cost

This page was built for publication: Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs