Minimizing total flowtime and maximum earliness on a single machine using multiple measures of fitness
Pages 803 - 809
Abstract
The intent of this research is to investigate methods to use genetic algorithms to find the set of efficient solutions to a bi-criteria problem. We propose a general methodology which is characterized by using different criteria upon which the decision to retain chromosomes into the next generation is made. We perform elite reproduction based on two general measures of "eliteness": non-dominated in the current population and performance measured in terms of each criterion individually. We investigate its performance on a specific bi-criteria scheduling problem, minimizing total flowtime and maximum earliness on a single machine.
References
[1]
Bean, J.C., Genetic algorithms and random keys for sequencing and optimization, ORSA Journal on Computing, 6, 1994, 154--160.
[2]
Coello Coello, C.A. and Mariano Romero, C.E. Multicriteria scheduling problems, In Multiple criteria optimization: state of the art annotated bibliography surveys, Eds. M. Ehrgott and X. Gandibleux. Kluwer, Boston, 2002, 445--491.
[3]
Goldberg, D.E., Genetic algorithms in search, optimization, and machine learning, Addison-Wesley, Reading, MA. 1989.
[4]
Halliburton, R., Introduction to Population Genetics, Pearson Prentice Hall, Upper Saddle River, NJ. 2004.
[5]
Holland, J., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor. 1975.
[6]
Karasakal, E.K. and Koksalan, M.,A simulated annealing approach to bicriteria scheduling problems on a single machine, Journal of Heuristics, 6(3), 2000, 311--327.
[7]
Koksalan, M., Azizoglu, M., and Kondakci, S.K., Minimizing flowtime and maximum earliness on a single machine, IIE Transactions, 30(2) 1998, 192--200.
[8]
Koksalan, M.M., A heuristic approach to bicriteria scheduling, Naval Research Logistics, 46(7), 1999, 777--789.
[9]
Kurz, M.E. and Askin, R.G., Heuristic Scheduling of Parallel Machines with Sequence-dependent Setup Times, International Journal of Production Research, 39(16), 2001, 3747--3769.
[10]
Kurz, M.E. and Askin, R.G., Scheduling flexible flow lines with sequence-dependent setup times, European Journal of Operational Research, 159(1), 2004, 66--82.
[11]
Michalewicz, Z., Genetic algorithms + data structures = evolution programs, Springer-Verlag, Berlin. 1992.
[12]
Norman, B.A. and Bean, J.C., A genetic algorithm methodology for complex scheduling problems, Naval Research Logistics, 46, 1999, 199--211.
[13]
Rangsaritratsamee, R., Ferrell, W., and Kurz, M., Dynamic rescheduling using a bicriteria objective with genetic local search, Computers and Industrial Engineering, 46(1), 2004, 1--15.
[14]
T'Kindt, V. and Billaut, J.-C., Multicriteria scheduling problems, In Multiple criteria optimization: state of the art annotated bibliography surveys, Eds. M. Ehrgott and X. Gandibleux. Kluwer, Boston, 2002, 445--491.
[15]
Wang, C-S. and Uzsoy, R., A genetic algorithm to minimize maximum lateness on a batch processing machine, Computers & Operations Research, 29, 2002, 1621--1640.
Index Terms
- Minimizing total flowtime and maximum earliness on a single machine using multiple measures of fitness
Recommendations
Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
We consider the following single-machine bicriteria scheduling problem. A set of n independent jobs has to be scheduled on a single machine that can handle only one job at a time and that is available from time zero onwards. Each job Jj requires ...
Single machine scheduling with maximum earliness and number tardy
Special issue: Selected papers from the 25th international conference on computers & industrial engineering in New Orleans, LouisianaIn this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness ...
On the identical parallel-machine rescheduling with job rework disruption
This paper investigates an issue of rescheduling on identical parallel machines where the original jobs have already been scheduled to minimize the total completion time, when a single set of jobs to be reworked re-arrives and creates a job rework ...
Comments
Information & Contributors
Information
Published In
June 2005
2272 pages
Copyright © 2005 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 June 2005
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 289Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jul 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in