A multiple objective decision theoretic approach to one-machine scheduling problems
- 31 December 1980
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 7 (4) , 251-259
- https://doi.org/10.1016/0305-0548(80)90023-4
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound SolutionManagement Science, 1978
- An experimental comparison of solution algorithms for the single‐machine tardiness problemNaval Research Logistics Quarterly, 1974
- On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound SolutionManagement Science, 1972
- A hybrid algorithm for the one machine sequencing problem to minimize total tardinessNaval Research Logistics Quarterly, 1971
- One-Machine Sequencing to Minimize Certain Functions of Job TardinessOperations Research, 1969
- On Scheduling Problems with Deferral CostsManagement Science, 1964
- Scheduling Tasks with Deadlines and Non-Linear Loss FunctionsManagement Science, 1962
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956