The Experts below are selected from a list of 273 Experts worldwide ranked by ideXlab platform

Hiroaki Ishii - One of the best experts on this subject based on the ideXlab platform.

  • single machine parallel batching scheduling problem with fuzzy due date and fuzzy Precedence Relation
    International Journal of Production Research, 2015
    Co-Authors: Xuesong Li, Hiroaki Ishii, Minghao Chen
    Abstract:

    A problem of single machine parallel-batching problem with fuzzy due-date and fuzzy Precedence Relation is investigated. Each job has a positive processing time. Set-up times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. The length of a batch is equal to the largest processing time among all jobs in the batch. Fuzzy due-date denotes the degree of satisfaction with respect to completion times of jobs. Fuzzy Precedence constraint expresses the satisfaction level about Precedence between two jobs. The objective is to minimise maximum completion time, maximise the minimum value of desirability of the fuzzy due-date and the minimum value of desirability of the fuzzy Precedence. First, we propose a fuzzy due-date and ordinary Precedence model, which maximises the minimum satisfaction degree of fuzzy due-date. An efficient iterative algorithm based on Procedure HL is designed. On that basis, another efficient algorithm to seek non-dominated solution is presented...

  • batch scheduling problem with due date and fuzzy Precedence Relation
    Kybernetika, 2012
    Co-Authors: Xuesong Li, Hiroaki Ishii, Minghao Chen
    Abstract:

    A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible Precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy Precedence. However, there usually exists no batch sequence optimizing both objectives at a time. Therefore, we seek some non-dominated batch sequences after the definition of non-dominated batch sequence. Based on an iterative Procedure HL proposed by Cheng et al., an efficient algorithm is presented to find some non-dominated batch sequences.

  • Scheduling problems with generalized Precedence Relations
    1999
    Co-Authors: Muthusamy Kanesan, Hiroaki Ishii, Milan Vlach
    Abstract:

    In this paper, we consider the single machine scheduling problem with generalized Precedence Relations. A Precedence delay specifies a time delay between the completion of job Ji and start of job Jj must be at least lij when job Ji precedes job Jj. The fuzzy Precedence Relation relaxes the Precedence restriction and it reflects the satisfaction level with respect to the processing order between two jobs. We combine some special cases of the generalized Precedence Relation with fuzzy Precedence Relation. The objective is to minimize the makespan and minimal satisfaction level with respect to fuzzy Precedence Relation and fuzzy Precedence delay to be maximized. We present an efficient algorithm for this problem. (Abstract by authors)

  • single machine scheduling problem with fuzzy Precedence Relation
    European Journal of Operational Research, 1995
    Co-Authors: Hiroaki Ishii, Minoru Tada
    Abstract:

    Abstract This paper considers the single machine scheduling problem with fuzzy Precedence Relation. A Precedence Relation is a binary Relation between jobs, that is, ‘Job J j precedes job J j ’ means that processing of job J j cannot be started till completion of job J j , which reflects the technical ordering with respect to production, etc. The fuzzy Precedence Relation relaxes this restriction and it reflects the satisfaction level with respect to Precedence between two jobs. Two objectives are considered, i.e., L max (maximum lateness) to be minimized, and minimal satisfaction level with respect to fuzzy Precedence Relation to be maximized. Analogously to ordinary multi-criteria problems, we define nondominated schedules and find them. In order to calculate nondominated schedules, we first define a schedule vector and then a nondominated schedule vector. Our aim is to propose an efficient algorithm for calculating nondominated schedules. Finally, we discuss further research problems in this direction.

Minghao Chen - One of the best experts on this subject based on the ideXlab platform.

  • single machine parallel batching scheduling problem with fuzzy due date and fuzzy Precedence Relation
    International Journal of Production Research, 2015
    Co-Authors: Xuesong Li, Hiroaki Ishii, Minghao Chen
    Abstract:

    A problem of single machine parallel-batching problem with fuzzy due-date and fuzzy Precedence Relation is investigated. Each job has a positive processing time. Set-up times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. The length of a batch is equal to the largest processing time among all jobs in the batch. Fuzzy due-date denotes the degree of satisfaction with respect to completion times of jobs. Fuzzy Precedence constraint expresses the satisfaction level about Precedence between two jobs. The objective is to minimise maximum completion time, maximise the minimum value of desirability of the fuzzy due-date and the minimum value of desirability of the fuzzy Precedence. First, we propose a fuzzy due-date and ordinary Precedence model, which maximises the minimum satisfaction degree of fuzzy due-date. An efficient iterative algorithm based on Procedure HL is designed. On that basis, another efficient algorithm to seek non-dominated solution is presented...

  • batch scheduling problem with due date and fuzzy Precedence Relation
    Kybernetika, 2012
    Co-Authors: Xuesong Li, Hiroaki Ishii, Minghao Chen
    Abstract:

    A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible Precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy Precedence. However, there usually exists no batch sequence optimizing both objectives at a time. Therefore, we seek some non-dominated batch sequences after the definition of non-dominated batch sequence. Based on an iterative Procedure HL proposed by Cheng et al., an efficient algorithm is presented to find some non-dominated batch sequences.

Minoru Tada - One of the best experts on this subject based on the ideXlab platform.

  • single machine scheduling problem with fuzzy Precedence Relation
    European Journal of Operational Research, 1995
    Co-Authors: Hiroaki Ishii, Minoru Tada
    Abstract:

    Abstract This paper considers the single machine scheduling problem with fuzzy Precedence Relation. A Precedence Relation is a binary Relation between jobs, that is, ‘Job J j precedes job J j ’ means that processing of job J j cannot be started till completion of job J j , which reflects the technical ordering with respect to production, etc. The fuzzy Precedence Relation relaxes this restriction and it reflects the satisfaction level with respect to Precedence between two jobs. Two objectives are considered, i.e., L max (maximum lateness) to be minimized, and minimal satisfaction level with respect to fuzzy Precedence Relation to be maximized. Analogously to ordinary multi-criteria problems, we define nondominated schedules and find them. In order to calculate nondominated schedules, we first define a schedule vector and then a nondominated schedule vector. Our aim is to propose an efficient algorithm for calculating nondominated schedules. Finally, we discuss further research problems in this direction.

Xuesong Li - One of the best experts on this subject based on the ideXlab platform.

  • single machine parallel batching scheduling problem with fuzzy due date and fuzzy Precedence Relation
    International Journal of Production Research, 2015
    Co-Authors: Xuesong Li, Hiroaki Ishii, Minghao Chen
    Abstract:

    A problem of single machine parallel-batching problem with fuzzy due-date and fuzzy Precedence Relation is investigated. Each job has a positive processing time. Set-up times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. The length of a batch is equal to the largest processing time among all jobs in the batch. Fuzzy due-date denotes the degree of satisfaction with respect to completion times of jobs. Fuzzy Precedence constraint expresses the satisfaction level about Precedence between two jobs. The objective is to minimise maximum completion time, maximise the minimum value of desirability of the fuzzy due-date and the minimum value of desirability of the fuzzy Precedence. First, we propose a fuzzy due-date and ordinary Precedence model, which maximises the minimum satisfaction degree of fuzzy due-date. An efficient iterative algorithm based on Procedure HL is designed. On that basis, another efficient algorithm to seek non-dominated solution is presented...

  • batch scheduling problem with due date and fuzzy Precedence Relation
    Kybernetika, 2012
    Co-Authors: Xuesong Li, Hiroaki Ishii, Minghao Chen
    Abstract:

    A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible Precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy Precedence. However, there usually exists no batch sequence optimizing both objectives at a time. Therefore, we seek some non-dominated batch sequences after the definition of non-dominated batch sequence. Based on an iterative Procedure HL proposed by Cheng et al., an efficient algorithm is presented to find some non-dominated batch sequences.

Mitsuru Ishizuka - One of the best experts on this subject based on the ideXlab platform.

  • improving chronological sentence ordering by Precedence Relation
    International Conference on Computational Linguistics, 2004
    Co-Authors: Naoaki Okazaki, Yutaka Matsuo, Mitsuru Ishizuka
    Abstract:

    It is necessary to find a proper arrangement of sentences in order to generate a well-organized summary from multiple documents. In this paper we describe an approach to coherent sentence ordering for summarizing newspaper articles. Since there is no guarantee that chronological ordering of extracted sentences, which is widely used by conventional summarization system, arranges each sentence behind presupposed information of the sentence, we improve chronological ordering by resolving antecedent sentences of arranged sentences. Combining the refinement algorithm with topical segmentation and chronological ordering, we address our experiment to test the effectiveness of the proposed method. The results reveal that the proposed method improves chronological sentence ordering.

  • COLING - Improving chronological sentence ordering by Precedence Relation
    Proceedings of the 20th international conference on Computational Linguistics - COLING '04, 2004
    Co-Authors: Naoaki Okazaki, Yutaka Matsuo, Mitsuru Ishizuka
    Abstract:

    It is necessary to find a proper arrangement of sentences in order to generate a well-organized summary from multiple documents. In this paper we describe an approach to coherent sentence ordering for summarizing newspaper articles. Since there is no guarantee that chronological ordering of extracted sentences, which is widely used by conventional summarization system, arranges each sentence behind presupposed information of the sentence, we improve chronological ordering by resolving antecedent sentences of arranged sentences. Combining the refinement algorithm with topical segmentation and chronological ordering, we address our experiment to test the effectiveness of the proposed method. The results reveal that the proposed method improves chronological sentence ordering.