Using permutation space in job-shop scheduling

Using permutation space in job-shop scheduling

0.00 Avg rating0 Votes
Article ID: iaor19931779
Country: Singapore
Volume: 9
Issue: 2
Start Page Number: 183
End Page Number: 193
Publication Date: Nov 1992
Journal: Asia-Pacific Journal of Operational Research
Authors: ,
Abstract:

The space of permutations of {1,...,mn} is mapped onto the space of feasible solutions of the general job-shop scheduling problem n/m/G/Cmax by two algorithms. The first algorithm produces a makespan which satisfies an analogue of continuity, for large m and n, on the space of permutations with the inverse metric. Simulations results are presented for two examples which show that the second algorithm produces good makespans compared to those produced by priority rules.

Reviews

Required fields are marked *. Your email address will not be published.