Minimizing the maximum deviation of job completion time about a common due-date
Given a set of n jobs with deterministic processing times and the same ready times, the problem is to find the optimal common due-date \(k^*\) and the optimal job sequences \(\sigma^*\) to minimize the maximum deviation of job completion time about the common due-date. It is shown that the problem can be formulated as an equivalent linear programming (LP) minimization problem. Using the strong duality property of LP, we derive the optimal due-date by considering the dual of the LP problem. When the optimal due-date is determined the optimal job seqa set S. Remember that the pair (S,\(\sigma)\) is called a convexity space if \(\sigma\) is closed under intersections and if S,\(\emptyset \in \sigma\). The authors introduce and discuss the following notion of \(\sigma\)- separability: a set \(X\subset S\) is called to be \(\sigma\)-separable from a set \(Y\subset S\) if there is an \(A\in \sigma\) such that \(X\subset A\subset S\setminus Y.\)
- A note on ``Minimizing the maximum deviation of job completion time about a common due-date
- Optimal common due-date with limited completion time deviation
- Determination of an optimal common due date and optimal sequence in a single machine job shop
- A Note on the Common Due-Date Assignment Problem
- On Optimal Common Due-Date Determination
- A Simulation Study of Predictable Due-Dates
- Analytical determination of optimal TWK due-dates in a job shop
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Due Date Assignment for Production Systems
- scientific article; zbMATH DE number 3724172 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- A minimax job completion-time problem revisited
- A note on ``Minimizing the maximum deviation of job completion time about a common due-date
- Survey of scheduling research involving due date determination decisions
- Scheduling about a given common due date to minimize mean squared deviation of completion times
- A survey of the state-of-the-art of common due date assignment and scheduling research
- On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
- Minmax due-date assignment on a two-machine flowshop
- Minmax due-date assignment with a time window for acceptable lead-times
- A note: minmax due-date assignment problem with lead-time cost
- Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing weighted mean absolute deviation of job completion times from their weighted mean
- The minmax due-date assignment problem with acceptable lead-times
This page was built for publication: Minimizing the maximum deviation of job completion time about a common due-date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098766)
