Genetic algorithms to minimize the weighted number of late jobs on a single machine
- 1 December 2003
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 151 (2) , 296-306
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints1998
- Feature Article—Genetic Algorithms for the Operations ResearcherINFORMS Journal on Computing, 1997
- Minimizing late jobs in the general one machine scheduling problemEuropean Journal of Operational Research, 1995
- A genetic algorithm for flowshop sequencingComputers & Operations Research, 1995
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘tower of sets’ propertyMathematical and Computer Modelling, 1994
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late JobsManagement Science, 1988
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due TimesOperations Research, 1978
- Complexity of Machine Scheduling Problems1977
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968