A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Job Shop Scheduling with Capacity Adjustment (An Efficient Search Method Using the Mixture of GA and Priority Rule)
Transactions of the Japan Society of Mechanical Engineers Series C
In this paper, we propose an efficient scheduling method for a job shop environment in which production capacity is adjustable by adding overtime in each machine of each production shift. The primal objective of scheduling is to meet due-dates of jobs and the secondary one is to minimize overtime. To achieve these two objectives efficiently, the schedule is searched to eliminate tardy jobs at first by allowing large overtime. Then the overtime is minimized. The method using the mixture ofdoi:10.1299/kikaic.79.4424 fatcat:igtcynceyjggxg3rthkbybffhi