A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
From MaRDI portal
Publication:6059906
DOI10.1007/s12597-023-00652-1OpenAlexW4367312199MaRDI QIDQ6059906
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
Cites Work
- 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
- 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
- Single machine scheduling with coefficient of variation minimization
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Minimizing the average deviation of job completion times about a common due date
- 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
- Due-date assignment and early/tardy scheduling on identical parallel machines
- HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Single-machine scheduling with a common due window
- A common due-data assignment problem on parallel identical machines
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
This page was built for publication: A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
