Hiroshi Kise

Learn More
This paper considers a scheduling problem of minimizing the maximum completion time (i.e., the makespan) for an automated flowshop manufacturing system such as FMS which consists of m machining cells with sufficient buffers, an AGV (automated guided vehicle) and loading/unloading stations. For this problem we propose a heuristic algorithm based on a fuzzy(More)
Hiroshi Kise Kyoto Institute of Technology Toshihid,! Ibaraki ar.d Hisashi Mine Kyoto University (Received November 24,1978; Revised March 12, 1979) Six approximation algorithms for the one-machine scheduling problem with ready and due times to minimize the maximum lateness are analyzed. The performance is measured by the relative deviation of approximate(More)
  • 1