Optimal due date assignment in multi-machine scheduling environments
From MaRDI portal
Publication:835592
Recommendations
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Due-date assignment and early/tardy scheduling on identical parallel machines
- A common due-data assignment problem on parallel identical machines
- Two due date assignment problems in scheduling a single machine
- Optimal restricted due date assignment in scheduling
Cites work
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A common due-data assignment problem on parallel identical machines
- A note on a due-date assignment on a two-machine flow-shop
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Batch scheduling and common due-date assignment on a single machine
- 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
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing Total Tardiness on One Machine is NP-Hard
- Minimizing mean absolute deviation of completion times about a common due date
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Scheduling independent tasks to reduce mean finishing time
- Scheduling the Open Shop to Minimize Mean Flow Time
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single-machine sequencing with controllable processing times
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- The Complexity of Flowshop and Jobshop Scheduling
- Two due date assignment problems in scheduling a single machine
Cited in
(21)- Minmax due-date assignment with a time window for acceptable lead-times
- Minsum scheduling with acceptable lead-times and optional job rejection
- scientific article; zbMATH DE number 1731175 (Why is no real title available?)
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- A new perspective on single-machine scheduling problems with late work related criteria
- Multi-objective due-date setting in a make-to-order environment
- Due date assignment and two-agent scheduling under multitasking environment
- A Generalized Model of Optimal Due-Date Assignment by Linear Programming
- Due-date assignment and maintenance activity scheduling problem
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration
- Due-date assignment on uniform machines
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Scheduling with due date assignment under special conditions on job processing
- Optimal restricted due date assignment in scheduling
- Due-date assignment with acceptable lead-times on parallel machines
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- A note: minmax due-date assignment problem with lead-time cost
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
- Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs
This page was built for publication: Optimal due date assignment in multi-machine scheduling environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835592)
