A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem
- 10 May 2007
- journal article
- research article
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 37 (9-10) , 996-1004
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Block approach—tabu search algorithm for single machine total weighted tardiness problemComputers & Industrial Engineering, 2006
- Single machine scheduling to minimize total weighted tardinessEuropean Journal of Operational Research, 2005
- A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single ProcessorAnnals of Operations Research, 2004
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling ProblemINFORMS Journal on Computing, 1998
- Single Machine Tardiness Sequencing HeuristicsIIE Transactions, 1991
- A Branch and Bound Algorithm for the Total Weighted Tardiness ProblemOperations Research, 1985
- Complexity of Machine Scheduling Problems1977
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977
- A dual algorithm for the one-machine scheduling problemMathematical Programming, 1976
- Minimizing Total Costs in One-Machine SchedulingOperations Research, 1975