A heuristic for single machine common due date assignment problem with different earliness/tardiness weights

DOI10.1007/S12597-023-00652-1MaRDI QIDQ6059906zbMATH OpenOpenAlexFDO

Authors Oğuzhan Ahmet Arık

Publication date 2 November 2023

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-023-00652-1

zbMATH Keywords

common due date assignmentearlinessschedulingsingle machinetardiness

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A common due-data assignment problem on parallel identical machines
• A survey of the state-of-the-art of common due date assignment and scheduling research
• A V-shape property of optimal schedule of jobs about a common due date
• An alternative proof of optimality for the common due-date assignment problem
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Due-date assignment and early/tardy scheduling on identical parallel machines
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
• Minimizing the average deviation of job completion times about a common due date
• Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• Single machine scheduling with coefficient of variation minimization
• Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
• Single-machine scheduling with a common due window
• Survey of scheduling research involving due date determination decisions
• V-shape property of optimal sequence of jobs about a common due date on a single machine

Cited in

(3)

• The weighted common due date single machine scheduling problem revisited
• HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE
• Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling

This page was built for publication: A heuristic for single machine common due date assignment problem with different earliness/tardiness weights

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