ON THE DUALITY APPROACH TO OPTIMAL DUE DATE DETERMINATION AND SEQUENCING IN A JOB SHOP
- 1 January 1987
- journal article
- research article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 10 (4) , 271-278
- https://doi.org/10.1080/03052158708902542
Abstract
This paper considers the problem of finding an optimal CON due date and sequencing of n independent jobs to be processed on a single machine by minimizing the total value of lateness. A linear programming model is developed to find an optimal CON due date which is solved by considering its dual. A procedure to find the optimal job sequence is then presented and elaborated by a numerical example.Keywords
This publication has 11 references indexed in Scilit:
- A Generalized Model of Optimal Due-Date Assignment by Linear ProgrammingJournal of the Operational Research Society, 1987
- A DUALITY APPROACH TO OPTIMAL DUE-DATE DETERMINATIONEngineering Optimization, 1985
- Optimal assignment of due-dates for a single processor scheduling problemInternational Journal of Production Research, 1981
- A Simulation Study of Predictable Due-DatesManagement Science, 1979
- A Methodology for Assigning Minimum Cost Due-DatesManagement Science, 1977
- Due dates in job shop schedulingInternational Journal of Production Research, 1976
- A hybrid algorithm for the one machine sequencing problem to minimize total tardinessNaval Research Logistics Quarterly, 1971
- On Sequencing n Jobs on One Machine to Minimize the Number of Late JobsManagement Science, 1970
- One-Machine Sequencing to Minimize Certain Functions of Job TardinessOperations Research, 1969
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968