An algorithm for the CON due-date determination and sequencing problem
For a set of n jobs with deterministic processing times and common starting times, the problem is to determine the optimal constant flow allowance \(k^*\) for the CON due-date assignment method, and the optimal sequence \(\sigma^*\) which minimizes the weighted average of missed due- dates. As \(k^*\) and \(\sigma^*\) cannot be independently determined, we propose an algorithm which systematically searches for the optimal solution. Although the algorithm has time complexity of \(O(2^ nn^ 2)\), it is considerably more efficient than the exhaustive enumeration method which considers all n! possible sequences.
- A Simulation Study of Predictable Due-Dates
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Minimizing the average deviation of job completion times about a common due date
- Optimal due-date assignment in a job shop†
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- Optimal common due-date with limited completion time deviation
- A minimax job completion-time problem revisited
- Survey of scheduling research involving due date determination decisions
- Mimimization of agreeably weighted variance in single machine systems
- Scheduling to minimize weighted earliness and tardiness about a common due-date
- Optimal due-date assignment and sequencing
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Single-machine scheduling to minimize earliness and number of tardy jobs
- Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties
- Single machine scheduling with common due data assignment in a group technology environment
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Common due-date determination and sequencing using tabu search
- Algorithms for mixed-model sequencing with due date restrictions
- Job sequencing and due date assignment in a single machine shop with uncertain processing times
- New approaches to due date assignment in job shops
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Minimization of total absolute deviation for a common due date
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Form Similarities of the CON and SLK Due Date Determination Methods
- A simpler and faster algorithm for optimal total-work-content-power due data determination
- Algorithm of sequential analysis of variants for minimization of the number of devices in scheduling problem with due date
- CON due-date determination and sequencing
- A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem
This page was built for publication: An algorithm for the CON due-date determination and sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097162)
