Two due date assignment problems in scheduling a single machine
From MaRDI portal
Publication:867932
DOI10.1016/j.orl.2005.10.009zbMath1112.90038OpenAlexW2042776370MaRDI QIDQ867932
Publication date: 19 February 2007
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.10.009
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (24)
Minsum scheduling with acceptable lead-times and optional job rejection ⋮ Optimal due date assignment in multi-machine scheduling environments ⋮ Optimal restricted due date assignment in scheduling ⋮ Bicriteria scheduling for due date assignment with total weighted tardiness ⋮ A note: minmax due-date assignment problem with lead-time cost ⋮ Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection ⋮ A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment ⋮ Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ A survey on offline scheduling with rejection ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ Minmax due-date assignment with a time window for acceptable lead-times ⋮ Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine ⋮ Due date assignments and scheduling a single machine with a general earliness/tardiness cost function ⋮ The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times ⋮ Four single-machine scheduling problems involving due date determination decisions ⋮ A faster algorithm for a due date assignment problem with tardy jobs ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments ⋮ Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs ⋮ SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT ⋮ The single-machine total tardiness scheduling problem: review and extensions ⋮ Proportionate flow shop: New complexity results and models with due date assignment ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Single-machine sequencing with controllable processing times
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A note on a due-date assignment on a two-machine flow-shop
- Batch scheduling and common due-date assignment on a single machine
- Minimizing Total Tardiness on One Machine is NP-Hard
- Sequencing with Earliness and Tardiness Penalties: A Review
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing Mean Squared Deviation of 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
- Algorithms for Scheduling Independent Tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A common due-data assignment problem on parallel identical machines
This page was built for publication: Two due date assignment problems in scheduling a single machine
