Optimal due date assignment in multi-machine scheduling environments
From MaRDI portal
Publication:835592
DOI10.1007/s10951-007-0015-yzbMath1168.90470MaRDI QIDQ835592
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0015-y
90B35: Deterministic scheduling theory in operations research
90B80: Discrete location and assignment
Related Items
A new perspective on single-machine scheduling problems with late work related criteria, Optimal restricted due date assignment in scheduling, A note: minmax due-date assignment problem with lead-time cost, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration, Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection, Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs, Minsum scheduling with acceptable lead-times and optional job rejection, Scheduling with due date assignment under special conditions on job processing, Minmax due-date assignment with a time window for acceptable lead-times, Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Two due date assignment problems in scheduling a single machine
- 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
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- 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
- 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
- Scheduling the Open Shop to Minimize Mean Flow Time
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Due-date assignment and early/tardy scheduling on identical parallel machines
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Scheduling independent tasks to reduce mean finishing time
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- A common due-data assignment problem on parallel identical machines
