Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
From MaRDI portal
Publication:2673557
DOI10.1016/j.ejor.2022.02.017OpenAlexW4211237573WikidataQ114184336 ScholiaQ114184336MaRDI QIDQ2673557
Dvir Shabtay, Gur Mosheiov, Daniel Oron
Publication date: 10 June 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.02.017
Related Items (3)
A heuristic for single machine common due date assignment problem with different earliness/tardiness weights ⋮ Single machine scheduling with release dates: a distributionally robust approach ⋮ Single machine scheduling with assignable due dates to minimize maximum and total late work
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal restricted due date assignment in scheduling
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- Optimal due date assignment in multi-machine scheduling environments
- Two due date assignment problems in scheduling a single machine
- Scheduling and fixed-parameter tractability
- Approximation algorithms for scheduling a single machine to minimize total late work
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Minimizing total late work on a single machine with generalized due-dates
- Parameterized multi-scenario single-machine scheduling problems
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- A note on a two-agent scheduling problem related to the total weighted late work
- A survey on scheduling problems with due windows
- Common due window size and location determination in a single machine scheduling problem
- 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
- Single Machine Scheduling to Minimize Total Late Work
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- Bicriteria scheduling for due date assignment with total weighted tardiness
- Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Two-machine flow-shop scheduling to minimize total late work: revisited
- Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
- Discrete-Variable Extremum Problems
- Single Machine Scheduling with Flow Allowances
This page was built for publication: Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
