A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines
- 3 July 2009
- journal article
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 22 (2) , 247-261
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machinesComputers & Operations Research, 2004
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobsComputers & Operations Research, 2002
- Generating Experimental Data for Computational Testing with Machine Scheduling ApplicationsOperations Research, 2001
- Scheduling with agreeable release times and due dates on a batch processing machineEuropean Journal of Operational Research, 1997
- Single machine scheduling to minimize the number of early and tardy jobsComputers & Operations Research, 1996
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Average and worst-case analysis of heuristics for the maximum tardiness problemEuropean Journal of Operational Research, 1986
- Algorithms for Scheduling Tasks on Unrelated ProcessorsJournal of the ACM, 1981
- A Survey of Scheduling RulesOperations Research, 1977
- Sequencing with due‐dates and early start times to minimize maximum tardinessNaval Research Logistics Quarterly, 1974