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 σ*which minimizes the weighted average of missed due-dates. As k*and σ*cannot be independently determined, we propose an algorithm which systematically searches for the optimal solution. Although the algorithm has time complexity of 0(2nn2), it is considerably more efficient than the exhaustive enumeration method which considers all n! possible sequences.
ASJC Scopus subject areas
- Computer Science(all)
- Modelling and Simulation
- Management Science and Operations Research