Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 46, Issue 10, Pages 2695-2705Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540701244820
Keywords
job shop; production scheduling; FMS; genetic algorithm
Ask authors/readers for more resources
The purpose of this research is to solve a general job shop problem with alternative machine routings. We consider four performance measures: mean flow time, makespan, maximum lateness, and total absolute deviation from the due dates. We first develop mixed-integer linear programming (MILP) formulations for the problems. The MILP formulations can be used either to compute optimal solutions for small-sized problems or to test the performance of existing heuristic algorithms. In addition, we have developed a genetic algorithm that can be used to generate relatively good solutions quickly. Further, computational experiments have been performed to compare the solution of the MILP formulations with that of existing algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available