 Scheduling to minimize product design time using a genetic algorithmF. S. C. Lam International Journal of Production Research, 1999, vol. 37, issue 6, 1369-1386 Abstract: We consider a scheduling problem encountered in a semiconductor manufacturing company where the time for designing products (or makespan) needs to be minimized. The problem can be stated as follows: there are sets of tasks (or jobs) to be performed in a design project by a set of engineers. Since engineers are qualified to perform a certain set of jobs, so they are considered to be nonidentical. However, a job can be worked on by more than one engineer while an engineer can work on one job at a time. Moreover, there is a precedence relation among the jobs. The problem is to schedule jobs to engineers so that the makespan is minimized. We develop a Genetic Algorithm (GA) for this problem, which is one of combinatorial optimization subjects to many practical constraints. The GA is found to be very effective for solving this intractable problem. This research attempts to study this scheduling problem in a scientific manner and to propose ways in which the task can be automated with the help of an algorithm embedded in a computer program. Date: 1999 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:37:y:1999:i:6:p:1369-1386 Ordering information: This journal article can be ordered from Access Statistics for this article International Journal of Production Research is currently edited by Professor A. Dolgui More articles in International Journal of Production Research from Taylor & Francis Journals |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.