Optimal due date assignment in multi-machine scheduling environments
From MaRDI portal
Publication:835592
DOI10.1007/S10951-007-0015-YzbMATH Open1168.90470OpenAlexW2053052668MaRDI QIDQ835592FDOQ835592
Authors: Dvir Shabtay, George Steiner 
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
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
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- 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
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Scheduling independent tasks to reduce mean finishing time
- Due-date assignment and early/tardy scheduling on identical parallel machines
- 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
- Sequencing with Earliness and Tardiness Penalties: A Review
- Scheduling the Open Shop to Minimize Mean Flow Time
- Two due date assignment problems in scheduling a single machine
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Manufacturing lead-time rules: customer retention versus tardiness costs
- A note on a due-date assignment on a two-machine flow-shop
- Minimizing mean absolute deviation of completion times about a common due date
- Batch scheduling and common due-date assignment on a single machine
- Single-machine sequencing with controllable processing times
- A common due-data assignment problem on parallel identical machines
Cited In (21)
- Due-date assignment on uniform machines
- Due-date assignment with acceptable lead-times on parallel machines
- Multi-objective due-date setting in a make-to-order environment
- Title not available (Why is that?)
- A Generalized Model of Optimal Due-Date Assignment by Linear Programming
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
- Minmax due-date assignment with a time window for acceptable lead-times
- 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
- Optimal restricted due date assignment in scheduling
- A new perspective on single-machine scheduling problems with late work related criteria
- A note: minmax due-date assignment problem with lead-time cost
- Minsum scheduling with acceptable lead-times and optional job rejection
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Due-date assignment and maintenance activity scheduling problem
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- Scheduling with due date assignment under special conditions on job processing
- Due date assignment and two-agent scheduling under multitasking environment
- 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)
